Daniel P. Friedman

Publication Activity (10 Years)

Years Active: 1971-2024
Publications (10 Years): 5

Top Topics

Nonmonotonic Reasoning

Logic Programming

Complete Search

Top Venues

ICLP (Technical Communications)

Publications

Weixi Ma, Siyu Wang, Arnaud Venet, Junhua Gu, Subbu Subramanian, Rocky Liu, Yafei Yang, Daniel P. Friedman
F3: A Compiler for Feature Engineering. FUNARCH (2024)
Jason Hemann, Daniel P. Friedman
Nearly Macro-free microKanren. TFP (2023)
Jason Hemann, Daniel P. Friedman
A Framework for Extending microKanren with Constraints. WLP / WFLP (2017)
Jason Hemann, Daniel P. Friedman, William E. Byrd, Matthew Might
A Simple Complete Search for Logic Programming. ICLP (Technical Communications) (2017)
Jason Hemann, Daniel P. Friedman, William E. Byrd, Matthew Might
A small embedding of logic programming with a simple complete search. DLS (2016)
William E. Byrd, Eric Holk, Daniel P. Friedman
miniKanren, live and untagged: quine generation via relational interpreters (programming pearl). Scheme@ICFP (2012)
Mitchell Wand, Daniel P. Friedman
Programming languages: fundamental concepts for expanding and disciplining the mind. ACM SIGPLAN Notices 43 (11) (2008)
Joseph P. Near, William E. Byrd, Daniel P. Friedman
alpha-leanTAP: A Declarative Theorem Prover for First-Order Classical Logic. ICLP (2008)
Oleg Kiselyov, William E. Byrd, Daniel P. Friedman, Chung-chieh Shan
Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl). FLOPS (2008)
Daniel P. Friedman, Abdulaziz Ghuloum, Jeremy G. Siek, Onnie Lynn Winebarger
Improving the lazy Krivine machine. High. Order Symb. Comput. 20 (3) (2007)
Oleg Kiselyov, Chung-chieh Shan, Daniel P. Friedman, Amr Sabry
Backtracking, interleaving, and terminating monad transformers: (functional pearl). ICFP (2005)
Daniel P. Friedman, Amr Sabry
CPS in little pieces: composing partial continuations. J. Funct. Program. 12 (6) (2002)
Steven E. Ganz, Daniel P. Friedman, Mitchell Wand
Trampolined Style. ICFP (1999)
Christian Wagenknecht, Daniel P. Friedman
Teaching Nondeterministic and Universal Automata Using SCHEME. Comput. Sci. Educ. 8 (3) (1998)
Jonathan Sobel, Daniel P. Friedman
Recycling Continuations. ICFP (1998)
Shriram Krishnamurthi, Matthias Felleisen, Daniel P. Friedman
Synthesizing Object-Oriented and Functional Design to Promote Re-Use. ECOOP (1998)
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. High. Order Symb. Comput. 11 (1) (1998)
Stanley Jefferson, Daniel P. Friedman
A Simple Reflective Interpreter. LISP Symb. Comput. 9 (2-3) (1996)
Shinn-Der Lee, Daniel P. Friedman
Enriching the Lambda Calculus with Contexts: Toward a Theory of Incremental Program Construction. ICFP (1996)
Jonathan G. Rossie Jr., Daniel P. Friedman, Mitchell Wand
Modeling Subobject-based Inheritance. ECOOP (1996)
Jonathan G. Rossie Jr., Daniel P. Friedman
An Algebraic Semantics of Subobjects. OOPSLA (1995)
Eric Hilsdale, J. Michael Ashley, R. Kent Dybvig, Daniel P. Friedman
Compiler Construction Using Scheme. FPLE (1995)
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)
Shinn-Der Lee, Daniel P. Friedman
Quasi-Static Scoping: Sharing Variable Bindings Across Multiple Lexical Scopes. POPL (1993)
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)
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)
Eric T. Freeman, Daniel P. Friedman
Characterizing the Paralation Model using Dynamic Assignment. PARLE (1992)
Shinn-Der Lee, Daniel P. Friedman
First-Class Extents. LISP Symb. Comput. 5 (4) (1992)
John V. Franco, Daniel P. Friedman, Steven D. Johnson
Multi-Way Streams in Scheme. Comput. Lang. 15 (1) (1990)
John V. Franco, Daniel P. Friedman
Towards a Facility for Lexically Scoped, Dynamic Mutual Recursion in Scheme. Comput. Lang. 15 (1) (1990)
Stanley Jefferson, Shinn-Der Lee, Daniel P. Friedman
A Syntactic Theory of Transparent Parameterization. ESOP (1990)
Matthias Felleisen, Daniel P. Friedman
A Syntactic Theory of Sequential State. Theor. Comput. Sci. 69 (3) (1989)
John V. Franco, Daniel P. Friedman
Creating Efficient Programs by Exchanging Data for Procedures. Comput. Lang. 14 (1) (1989)
Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, Bruce F. Duba
Abstract Continuations: A Mathematical Semantics for Handling Full Jumps. LISP and Functional Programming (1988)
R. Kent Dybvig, Daniel P. Friedman, Christopher T. Haynes
Expansion-Passing Style: A General Macro Mechanism. LISP Symb. Comput. 1 (1) (1988)
Mitchell Wand, Daniel P. Friedman
The Mystery of the Tower Revealed: A Nonreflective Description of the Reflective Tower. LISP Symb. Comput. 1 (1) (1988)
Matthias Felleisen, Daniel P. Friedman
Control operators, the SECD-machine, and the λ-calculus. Formal Description of Programming Concepts (1987)
Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker, Bruce F. Duba
A Syntactic Theory of Sequential Control. Theor. Comput. Sci. 52 (1987)
Matthias Felleisen, Daniel P. Friedman
A Reduction Semantics for Imperative Higher-Order Languages. PARLE (2) (1987)
Christopher T. Haynes, Daniel P. Friedman
Embedding Continuations in Procedural Objects. ACM Trans. Program. Lang. Syst. 9 (4) (1987)
Matthias Felleisen, Daniel P. Friedman
A Calculus for Assignments in Higher-Order Languages. POPL (1987)
Christopher T. Haynes, Daniel P. Friedman
Abstracting Timed Preemption with Engines. Comput. Lang. 12 (2) (1987)
R. Kent Dybvig, Daniel P. Friedman, Christopher T. Haynes
Expansion-Passing Style: Beyond Conventional Macros. LISP and Functional Programming (1986)
Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker, Bruce F. Duba
Reasoning with Continuations LICS (1986)
Christopher T. Haynes, Daniel P. Friedman, Mitchell Wand
Obtaining Coroutines with Continuations. Comput. Lang. 11 (3/4) (1986)
Eugene E. Kohlbecker, Daniel P. Friedman, Matthias Felleisen, Bruce F. Duba
Hygienic Macro Expansion. LISP and Functional Programming (1986)
Matthias Felleisen, Daniel P. Friedman
A Closer Look at Export and Import Statements. Comput. Lang. 11 (1) (1986)
Mitchell Wand, Daniel P. Friedman
The Mystery of the Tower Revealed: A Non-Reflective Description of the Reflective Tower. LISP and Functional Programming (1986)
Daniel P. Friedman, Christopher T. Haynes
Constraining Control. POPL (1985)
Daniel P. Friedman, Mitchell Wand
Reification: Reflection without Metaphysics. LISP and Functional Programming (1984)
Christopher T. Haynes, Daniel P. Friedman, Mitchell Wand
Continuations and Coroutines. LISP and Functional Programming (1984)
Christopher T. Haynes, Daniel P. Friedman
Engines Build Process Abstractions. LISP and Functional Programming (1984)
Robert E. Filman, Daniel P. Friedman
Models, languages, and heuristics for distributed computing. AFIPS National Computer Conference (1982)
Richard M. Salter, Terence J. Brennan, Daniel P. Friedman
Concur: A Language for Continuous, Concurrent Processes. Comput. Lang. 5 (3) (1980)
Daniel P. Friedman, David S. Wise
An Indeterminate Constructor for Applicative Programming. POPL (1980)
Daniel P. Friedman, David S. Wise
An Approach to Fair Applicative Multiprogramming. Semantics of Concurrent Computation (1979)
Daniel P. Friedman, David S. Wise
Reference Counting Can Manage the Circular Environments of Mutual Recursion. Inf. Process. Lett. 8 (1) (1979)
Daniel P. Friedman, David S. Wise
Unbounded Computational Structures. Softw. Pract. Exp. 8 (4) (1978)
Daniel P. Friedman, David S. Wise
A Note on Conditional Expressions. Commun. ACM 21 (11) (1978)
Mitchell Wand, Daniel P. Friedman
Compiling Lambda-Expressions Using Continuations and Factorizations. Comput. Lang. 3 (4) (1978)
Daniel P. Friedman, David S. Wise
Aspects of Applicative Programming for Parallel Processing. IEEE Trans. Computers 27 (4) (1978)
Daniel P. Friedman, David S. Wise
Functional Combination. Comput. Lang. 3 (1) (1978)
John D. Lowrance, Daniel P. Friedman
Hendrix's Model for Simultaneous Actions and Continuous Processes: An Introduction and Implementation. Int. J. Man Mach. Stud. 9 (5) (1977)
Daniel P. Friedman, David S. Wise
Aspects of Applicative Programming for File Systems (Preliminary Version). Language Design for Reliable Software (1977)
Daniel P. Friedman, David S. Wise
Output Driven Interpretation of Recursive Programs, or Writing Creates and Destroys Data Structures. Inf. Process. Lett. 5 (6) (1976)
Daniel P. Friedman, David S. Wise
Garbage Collecting a Heap Which Includes a Scatter Table. Inf. Process. Lett. 5 (6) (1976)
Daniel P. Friedman, David S. Wise, Mitchell Wand
Recursive programming through table look-up. SYMSACC (1976)
Frederick E. Petry, Alan W. Biermann, Monroe M. Newborn, Helmut Kerner, Werner Beyerle, Kathleen M. Shockley, Daniel P. Friedman
General interest (Paper Session). ACM Annual Conference (1976)
Daniel P. Friedman, David S. Wise
CONS Should Not Evaluate its Arguments. ICALP (1976)
Daniel P. Friedman, Stuart C. Shapiro
A case for while-until. ACM SIGPLAN Notices 9 (7) (1974)
Terrence W. Pratt, Daniel P. Friedman
A Language Extension for Graph Processing and Its Formal Semantics. Commun. ACM 14 (7) (1971)