Daniel P. Friedman

80 papers A* 6A 10B 1C 1Misc 1Journal 30Unranked 22

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