Daniel P. Friedman

Daniel P. Friedman, Mitchell Wand: Essentials of programming languages (3. ed.). MIT Press 2008, isbn 978-0-262-06279-4, pp. I-XXII, 1-410

Mitchell Wand, Daniel P. Friedman: Programming languages: fundamental concepts for expanding and disciplining the mind. SIGPLAN Notices 43(11): 133-135 (2008)

Oleg Kiselyov, William E. Byrd, Daniel P. Friedman, Chung-chieh Shan: Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl). FLOPS 2008: 64-80

Joseph P. Near, William E. Byrd, Daniel P. Friedman: alpha-leanTAP: A Declarative Theorem Prover for First-Order Classical Logic. ICLP 2008: 238-252

Daniel P. Friedman, Abdulaziz Ghuloum, Jeremy G. Siek, Onnie Lynn Winebarger: Improving the lazy Krivine machine. Higher-Order and Symbolic Computation 20(3): 271-293 (2007)

Daniel P. Friedman, William E. Byrd, Oleg Kiselyov: The reasoned schemer. MIT Press 2005, isbn 978-0-262-56214-0, pp. I-X, 1-169

Oleg Kiselyov, Chung-chieh Shan, Daniel P. Friedman, Amr Sabry: Backtracking, interleaving, and terminating monad transformers: (functional pearl). ICFP 2005: 192-203

Daniel P. Friedman, Amr Sabry: CPS in little pieces: composing partial continuations. J. Funct. Program. 12(6): 617-622 (2002)

Daniel P. Friedman, Mitchell Wand, Christopher T. Haynes: Essentials of programming languages (2. ed.). MIT Press 2001, isbn 978-0-262-06217-6, pp. I-XVIII, 1-389

Steven E. Ganz, Daniel P. Friedman, Mitchell Wand: Trampolined Style. ICFP 1999: 18-27

Harold Abelson, R. Kent Dybvig, Christopher T. Haynes, Guillermo Juan Rozas, N. I. Adams IV, Daniel P. Friedman, Eugene E. Kohlbecker, Guy L. Steele Jr., David H. Bartley, Robert H. Halstead Jr., Don Oxley, Gerald J. Sussman, G. Brooks, Chris Hanson, Kent M. Pitman, Mitchell Wand: Revised Report on the Algorithmic Language Scheme. Higher-Order and Symbolic Computation 11(1): 7-105 (1998)

Shriram Krishnamurthi, Matthias Felleisen, Daniel P. Friedman: Synthesizing Object-Oriented and Functional Design to Promote Re-Use. ECOOP 1998: 91-113

Jonathan Sobel, Daniel P. Friedman: Recycling Continuations. ICFP 1998: 251-260

Daniel P. Friedman, Matthias Felleisen: The little schemer (4. ed.). MIT Press 1996, isbn 978-0-262-56099-3, pp. I-XIII, 1-196

Daniel P. Friedman, Matthias Felleisen: The seasoned schemer. MIT Press 1996, isbn 978-0-262-56100-6, pp. I-XIII, 1-210

Matthias Felleisen, Daniel P. Friedman: A little Java, a few patterns. MIT Press 1996, isbn 978-0-262-56115-0, pp. I-XIV, 1-179

Matthias Felleisen, Daniel P. Friedman: The little MLer. MIT Press 1996, isbn 978-0-262-56114-3, pp. I-XVI, 1-181

Stanley Jefferson, Daniel P. Friedman: A Simple Reflective Interpreter. Lisp and Symbolic Computation 9(2-3): 181-202 (1996)

Jonathan G. Rossie Jr., Daniel P. Friedman, Mitchell Wand: Modeling Subobject-based Inheritance. ECOOP 1996: 248-274

Shinn-Der Lee, Daniel P. Friedman: Enriching the Lambda Calculus with Contexts: Toward a Theory of Incremental Program Construction. ICFP 1996: 239-250

Eric Hilsdale, J. Michael Ashley, R. Kent Dybvig, Daniel P. Friedman: Compiler Construction Using Scheme. FPLE 1995: 251-267

Jonathan G. Rossie Jr., Daniel P. Friedman: An Algebraic Semantics of Subobjects. OOPSLA 1995: 187-199

Arthur M. Riehl, Daniel P. Friedman, Brian Harvey, Simon M. Kaplan, Richard M. Salter, George Springer: Using Scheme in the Introductory Computer Science Curriculum (abstract). ACM Conference on Computer Science 1993: 533-534

Shinn-Der Lee, Daniel P. Friedman: Quasi-Static Scoping: Sharing Variable Bindings Across Multiple Lexical Scopes. POPL 1993: 479-492

Arthur M. Riehl, Daniel P. Friedman, Brian Harvey, Simon M. Kaplan, Richard M. Salter, George Springer: Using SCHEME in the introductory computer science curriculum (abstract). SIGCSE 1993: 288

Rhys Price Jones, Doug Cooper, Daniel P. Friedman, Richard C. Holt, Peter Robinson: Issues in the choice of programming language for CS 1 (abstract). SIGCSE 1993: 301

Daniel P. Friedman, Mitchell Wand, Christopher T. Haynes: Essentials of programming languages. MIT Press 1992, isbn 978-0-262-06145-2, pp. 1-536

Shinn-Der Lee, Daniel P. Friedman: First-Class Extents. Lisp and Symbolic Computation 5(4): 343-375 (1992)

Eric T. Freeman, Daniel P. Friedman: Characterizing the Paralation Model using Dynamic Assignment. PARLE 1992: 483-496

John V. Franco, Daniel P. Friedman: Towards a Facility for Lexically Scoped, Dynamic Mutual Recursion in Scheme. Comput. Lang. 15(1): 54-64 (1990)

John V. Franco, Daniel P. Friedman, Steven D. Johnson: Multi-Way Streams in Scheme. Comput. Lang. 15(1): 109-125 (1990)

Stanley Jefferson, Shinn-Der Lee, Daniel P. Friedman: A Syntactic Theory of Transparent Parameterization. ESOP 1990: 212-226

John V. Franco, Daniel P. Friedman: Creating Efficient Programs by Exchanging Data for Procedures. Comput. Lang. 14(1): 11-23 (1989)

Matthias Felleisen, Daniel P. Friedman: A Syntactic Theory of Sequential State. Theor. Comput. Sci. 69(3): 243-287 (1989)

Mitchell Wand, Daniel P. Friedman: The Mystery of the Tower Revealed: A Nonreflective Description of the Reflective Tower. Lisp and Symbolic Computation 1(1): 11-37 (1988)

R. Kent Dybvig, Daniel P. Friedman, Christopher T. Haynes: Expansion-Passing Style: A General Macro Mechanism. Lisp and Symbolic Computation 1(1): 53-75 (1988)

Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, Bruce F. Duba: Abstract Continuations: A Mathematical Semantics for Handling Full Jumps. LISP and Functional Programming 1988: 52-62

Christopher T. Haynes, Daniel P. Friedman: Abstracting Timed Preemption with Engines. Comput. Lang. 12(2): 109-121 (1987)

Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker, Bruce F. Duba: A Syntactic Theory of Sequential Control. Theor. Comput. Sci. 52: 205-237 (1987)

Christopher T. Haynes, Daniel P. Friedman: Embedding Continuations in Procedural Objects. ACM Trans. Program. Lang. Syst. 9(4): 582-598 (1987)

Matthias Felleisen, Daniel P. Friedman: A Reduction Semantics for Imperative Higher-Order Languages. PARLE (2) 1987: 206-223

Matthias Felleisen, Daniel P. Friedman: A Calculus for Assignments in Higher-Order Languages. POPL 1987: 314-325

Matthias Felleisen, Daniel P. Friedman: A Closer Look at Export and Import Statements. Comput. Lang. 11(1): 29-37 (1986)

Christopher T. Haynes, Daniel P. Friedman, Mitchell Wand: Obtaining Coroutines with Continuations. Comput. Lang. 11(3/4): 143-153 (1986)

R. Kent Dybvig, Daniel P. Friedman, Christopher T. Haynes: Expansion-Passing Style: Beyond Conventional Macros. LISP and Functional Programming 1986: 143-150

Eugene E. Kohlbecker, Daniel P. Friedman, Matthias Felleisen, Bruce F. Duba: Hygienic Macro Expansion. LISP and Functional Programming 1986: 151-161

Mitchell Wand, Daniel P. Friedman: The Mystery of the Tower Revealed: A Non-Reflective Description of the Reflective Tower. LISP and Functional Programming 1986: 298-307

Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker, Bruce F. Duba: Reasoning with Continuations. LICS 1986: 131-141

Daniel P. Friedman, Christopher T. Haynes: Constraining Control. POPL 1985: 245-254

Christopher T. Haynes, Daniel P. Friedman: Engines Build Process Abstractions. LISP and Functional Programming 1984: 18-24

Christopher T. Haynes, Daniel P. Friedman, Mitchell Wand: Continuations and Coroutines. LISP and Functional Programming 1984: 293-298

Daniel P. Friedman, Mitchell Wand: Reification: Reflection without Metaphysics. LISP and Functional Programming 1984: 348-355

Robert E. Filman, Daniel P. Friedman: Models, languages, and heuristics for distributed computing. AFIPS National Computer Conference 1982: 671-677

Richard M. Salter, Terence J. Brennan, Daniel P. Friedman: Concur: A Language for Continuous, Concurrent Processes. Comput. Lang. 5(3): 163-189 (1980)

Daniel P. Friedman, David S. Wise: An Indeterminate Constructor for Applicative Programming. POPL 1980: 245-250

Daniel P. Friedman, David S. Wise: Reference Counting Can Manage the Circular Environments of Mutual Recursion. Inf. Process. Lett. 8(1): 41-45 (1979)

Daniel P. Friedman, David S. Wise: An Approach to Fair Applicative Multiprogramming. Semantics of Concurrent Computation 1979: 203-225

Daniel P. Friedman, David S. Wise: A Note on Conditional Expressions. Commun. ACM 21(11): 931-933 (1978)

Daniel P. Friedman, David S. Wise: Functional Combination. Comput. Lang. 3(1): 31-35 (1978)

Mitchell Wand, Daniel P. Friedman: Compiling Lambda-Expressions Using Continuations and Factorizations. Comput. Lang. 3(4): 241-263 (1978)

Daniel P. Friedman, David S. Wise: Unbounded Computational Structures. Softw., Pract. Exper. 8(4): 407-416 (1978)

Daniel P. Friedman, David S. Wise: Aspects of Applicative Programming for Parallel Processing. IEEE Trans. Computers 27(4): 289-296 (1978)

John D. Lowrance, Daniel P. Friedman: Hendrix's Model for Simultaneous Actions and Continuous Processes: An Introduction and Implementation. International Journal of Man-Machine Studies 9(5): 537-581 (1977)

Daniel P. Friedman, David S. Wise: Aspects of Applicative Programming for File Systems (Preliminary Version). Language Design for Reliable Software 1977: 41-55

Daniel P. Friedman, David S. Wise: Output Driven Interpretation of Recursive Programs, or Writing Creates and Destroys Data Structures. Inf. Process. Lett. 5(6): 155-160 (1976)

Daniel P. Friedman, David S. Wise: Garbage Collecting a Heap Which Includes a Scatter Table. Inf. Process. Lett. 5(6): 161-164 (1976)

Daniel P. Friedman, David S. Wise: CONS Should Not Evaluate its Arguments. ICALP 1976: 257-284

Daniel P. Friedman, David S. Wise, Mitchell Wand: Recursive programming through table look-up. SYMSACC 1976: 85-89

Terrence W. Pratt, Daniel P. Friedman: A Language Extension for Graph Processing and Its Formal Semantics. Commun. ACM 14(7): 460-467 (1971)