Daniel P. Friedman
#220,262
Most Influential Person Across History
Daniel P. Friedman's AcademicInfluence.com Rankings
Daniel P. Friedmancomputer-science Degrees
Computer Science
#11223
Historical Rank
Database
#7937
Historical Rank
Download Badge
Computer Science
Why Is Daniel P. Friedman Influential?
(Suggest an Edit or Addition)Daniel P. Friedman's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Aspect-Oriented Programming is Quantification and Obliviousness (2000) (718)
- Revised4 report on the algorithmic language scheme (1991) (703)
- Revised5 Report on the Algorithmic Language Scheme (1986) (697)
- Essentials of programming languages (2008) (367)
- CONS Should Not Evaluate its Arguments (1976) (311)
- Hygienic macro expansion (1986) (293)
- Control operators, the SECD-machine, and the λ-calculus (1987) (290)
- A Syntactic Theory of Sequential Control (1987) (245)
- Revised 5 Report on the Algorithmic Language (1999) (218)
- Reification: Reflection without metaphysics (1984) (131)
- The mystery of the tower revealed: a non-reflective description of the reflective tower (1986) (126)
- Scheme and the art of programming (1983) (115)
- Synthesizing Object-Oriented and Functional Design to Promote Re-Use (1998) (115)
- Backtracking, interleaving, and terminating monad transformers: (functional pearl) (2005) (109)
- Obtaining Coroutines with Continuations (1986) (106)
- Reasoning with Continuations (1986) (106)
- Aspects of Applicative Programming for Parallel Processing (1978) (95)
- The mystery of the tower revealed: A nonreflective description of the reflective tower (1988) (93)
- Continuations and coroutines (1984) (85)
- The reasoned schemer (2005) (85)
- Trampolined style (1999) (85)
- Abstract continuations: a mathematical semantics for handling full jumps (1988) (81)
- A Syntactic Theory of Sequential State (1989) (81)
- A calculus for assignments in higher-order languages (1987) (80)
- Engines build process abstractions (1984) (76)
- Coordinated computing: tools and techniques for distributed software (1984) (72)
- Relational programming in minikanren: techniques, applications, and implementations (2009) (69)
- Embedding continuations in procedural objects (1987) (63)
- The little LISPer (1974) (57)
- Programming with Continuations (1984) (55)
- A scheme for a higher-level semantic algebra (1986) (49)
- Constraining control (1985) (49)
- Abstracting Timed Preemption with Engines (1987) (44)
- Reference Counting Can Manage the Circular Environments of Mutual Recursion (1979) (42)
- The one-bit reference count (1977) (41)
- Expansion-passing style: A general macro mechanism (1988) (39)
- A simple reflective interpreter (1996) (39)
- miniKanren, live and untagged: quine generation via relational interpreters (programming pearl) (2012) (38)
- Essentials of programming languages (2nd ed.) (2001) (37)
- A Reduction Semantics for Imperative Higher-Order Languages (1987) (36)
- An algebraic semantics of subobjects (1995) (34)
- A little Java, a few patterns (1997) (32)
- α Kanren A Fresh Name in Nominal Logic Programming (2007) (28)
- Essentials of Programming Languages, 3rd Edition (2008) (28)
- Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl) (2008) (27)
- Improving the lazy Krivine machine (2007) (27)
- Recursive programming through table look-up (1976) (24)
- Quasi-static scoping: sharing variable bindings across multiple lexical scopes (1993) (23)
- Enriching the lambda calculus with contexts: toward a theory of incremental program construction (1996) (23)
- Modeling Subobject-based Inheritance (1996) (23)
- An indeterminate constructor for applicative programming (1980) (22)
- A language extension for graph processing and its formal semantics (1971) (21)
- cKanren miniKanren with Constraints (2011) (21)
- From Variadic Functions to Variadic Relations A miniKanren Perspective (2006) (21)
- Compiling Lambda-Expressions Using Continuations and Factorizations (1978) (20)
- Expansion-passing style: beyond conventional macros (1986) (19)
- alpha-leanTAP: A Declarative Theorem Prover for First-Order Classical Logic (2008) (19)
- A small embedding of logic programming with a simple complete search (2016) (18)
- The Little Schemer (1986) (18)
- Functional Combination (1978) (16)
- An Approach to Fair Applicative Multiprogramming (1979) (16)
- Aspects of applicative programming for file systems (Preliminary Version) (1977) (16)
- A Closer Look at Export and Import Statements (1986) (16)
- A note on conditional expressions (1978) (14)
- A Framework for Extending microKanren with Constraints (2017) (14)
- Garbage Collecting a Heap Which Includes a Scatter Table (1976) (14)
- Writing Macros in Continuation-Passing Style (2000) (14)
- Language Extension via First-class Interpreters (1992) (13)
- A case for while-until (1974) (12)
- The seasoned schemer (1995) (12)
- The little MLer (1997) (11)
- Unbounded computational structures (1978) (11)
- An Introduction to Reeection-oriented Programming (1996) (11)
- Recycling continuations (1998) (11)
- Output Driven Interpretation of Recursive Programs, or Writing Creates and Destroys Data Structures (1976) (10)
- Multi-Way Streams in Scheme (1990) (10)
- Essentials of programming languages (3. ed.) (2001) (7)
- Connecting the Wire (2005) (7)
- Towards a Theory of Reflective Programming Languages (1993) (7)
- Using SCHEME in the introductory computer science curriculum (abstract) (1993) (6)
- Boolean-valued loops (1975) (5)
- First-class extents (1992) (5)
- Methods to Our Madness (1997) (5)
- GRASPE 1.5: A GRAPH PROCESSOR AND ITS APPLICATION. (1969) (5)
- Compiler Construction Using Scheme (1995) (4)
- Hendrix's Model for Simultaneous Actions and Continuous Processes: An Introduction and Implementation (1977) (4)
- Concur: A Language for Continuous, Concurrent Processes (1980) (4)
- Issues in the choice of programming language for CS 1 (abstract) (1993) (4)
- Creating Efficient Programs by Exchanging Data for Procedures (1989) (4)
- Teaching Nondeterministic and Universal Automata Using SCHEME (1998) (4)
- Encapsulation of state with monad transformers (2007) (3)
- Abstraction and Performance from Explicit Monadic Reflectio n (2005) (3)
- Efficient representations for triangular substitutions : A comparison in miniKanren (2009) (3)
- A pattern-matcher for αKanren -or- How to get into trouble with CPS macros (2009) (3)
- The little Schemer (4th ed.) (1996) (2)
- The Fun Never Ends (2005) (2)
- Think It Through (2015) (2)
- A Fresh Name in Nominal Logic Programming (2007) (2)
- The little LISPer (2nd ed.) (1986) (2)
- A Syntactic Theory of Transparent Parameterization (1990) (2)
- Aspect-Oriented Programming is Quantification and Implicit Invocation (2001) (2)
- Towards a Facility for Lexically Scoped, Dynamic Mutual Recursion in Scheme (1990) (2)
- Towards Leakage Containment (1992) (2)
- Models, languages, and heuristics for distributed computing (1899) (2)
- Towards a Theory of Reeective Programming Languages (1993) (2)
- A Simple Reeective I N Terpreter Imsa '92 International Workshop on Reeection and Meta-level Architecture Tokyo, November 4-7, 1992 a Simple Reeective I N Terpreter (1999) (1)
- Higher-order Logic Programming with λKanren (2020) (1)
- The State of Things to Come (1997) (1)
- A Bit Too Much (2005) (1)
- Theoretical aspects of reflection in programming languages (1998) (1)
- CPS in little pieces: composing partial continuations (2002) (1)
- Learning the Rules (2011) (1)
- Efficiency of a good but not linear nominal unification algorithm (2018) (1)
- A Reflective System is as Extensible as its Internal Representations: An Illustration (1992) (1)
- Programming languages: fundamental concepts for expanding and disciplining the mind (2008) (1)
- A Surprisingly Competitive Conditional Operator (2018) (1)
- The Scheme Programming Language (1992) (1)
- Object Oriented Style (2020) (1)
- The Little Assistant (2015) (0)
- Characterizing the Paralation Model using Dynamic Assignment (1992) (0)
- Double Your Fun (2005) (0)
- The Little Prover (2015) (0)
- Interleaving is Possible with Re ned Abstract Machines : A New Approach to Engineering a Compiler (0)
- Tools and Techniques for Use of the Scheme Programming Language in Undergraduate Education (1997) (0)
- The Stars Are Aligned (2015) (0)
- A Simple Complete Search for Logic Programming (2017) (0)
- Little Languages for Relational Programming (2014) (0)
- Objects Are People, Too (1997) (0)
- Changing the Rules (2015) (0)
- Data Compilation: Its Design and Analysis (1990) (0)
- Composing Partial Continuations (1993) (0)
- Using Scheme in the introductory computer science curriculum (abstract) (1993) (0)
- Oh My, Stars! (2015) (0)
- The little schemer (4. ed.) (1996) (0)
- Be a Good Visitor (1997) (0)
- Towards Leakage (1992) (0)
- Recursion Is a Computational Eeect Recursion Is a Computational Eeect (0)
- Hygenic Macro Expansion History of Programming Languages (2010) (0)
- Come to Our Carousel (1997) (0)
- Even Older Games (2015) (0)
- General interest (Paper Session) (1976) (0)
- 11 All Lists Are Created Equal (2018) (0)
- Under the Hood (2005) (0)
- Relation-Oriented Programming ( 5 / 11 / 2004 ) (2004) (0)
- Welcome to the Club (2005) (0)
- Old Games, New Rules (2015) (0)
- An Object Encoding For SelfType (0)
- Just a Bit More (2005) (0)
- Think It Over, and Over, and Over (2015) (0)
- Towards a Theory of Re Blockinective Programming Languages (extended Abstract) (1993) (0)
- Part of This Total Breakfast (2015) (0)
- Restless for More (2015) (0)
- Teaching Old Toys New Tricks (2005) (0)
- A New Higher-order Unification Algorithm for λKanren (2021) (0)
- Seeing Old Friends in New Ways (2005) (0)
- The Proof of the Pudding (2015) (0)
- A Modular Interpreter In Scheme With Objects (2000) (0)
This paper list is powered by the following services:
What Schools Are Affiliated With Daniel P. Friedman?
Daniel P. Friedman is affiliated with the following schools:
