default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel P. Friedman
Person information
- affiliation: Indiana University, Bloomington, USA
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c41]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: 3-9- 2023
- [c40]Jason Hemann, Daniel P. Friedman:
Nearly Macro-free microKanren. TFP 2023: 72-91
2010 – 2019
- 2017
- [c39]Jason Hemann, Daniel P. Friedman, William E. Byrd, Matthew Might:
A Simple Complete Search for Logic Programming. ICLP (Technical Communications) 2017: 14:1-14:8 - [c38]Jason Hemann, Daniel P. Friedman:
A Framework for Extending microKanren with Constraints. WLP / WFLP 2017: 135-149 - 2016
- [c37]Jason Hemann, Daniel P. Friedman, William E. Byrd, Matthew Might:
A small embedding of logic programming with a simple complete search. DLS 2016: 96-107 - 2012
- [c36]William E. Byrd, Eric Holk, Daniel P. Friedman:
miniKanren, live and untagged: quine generation via relational interpreters (programming pearl). Scheme@ICFP 2012: 8-29
2000 – 2009
- 2008
- [b8]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 - [j30]Mitchell Wand, Daniel P. Friedman:
Programming languages: fundamental concepts for expanding and disciplining the mind. ACM SIGPLAN Notices 43(11): 133-135 (2008) - [c35]Oleg Kiselyov, William E. Byrd, Daniel P. Friedman, Chung-chieh Shan:
Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl). FLOPS 2008: 64-80 - [c34]Joseph P. Near, William E. Byrd, Daniel P. Friedman:
alpha-leanTAP: A Declarative Theorem Prover for First-Order Classical Logic. ICLP 2008: 238-252 - 2007
- [j29]Daniel P. Friedman, Abdulaziz Ghuloum, Jeremy G. Siek, Onnie Lynn Winebarger:
Improving the lazy Krivine machine. High. Order Symb. Comput. 20(3): 271-293 (2007) - 2005
- [b7]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 - [c33]Oleg Kiselyov, Chung-chieh Shan, Daniel P. Friedman, Amr Sabry:
Backtracking, interleaving, and terminating monad transformers: (functional pearl). ICFP 2005: 192-203 - 2002
- [j28]Daniel P. Friedman, Amr Sabry:
CPS in little pieces: composing partial continuations. J. Funct. Program. 12(6): 617-622 (2002) - 2001
- [b6]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
1990 – 1999
- 1999
- [c32]Steven E. Ganz, Daniel P. Friedman, Mitchell Wand:
Trampolined Style. ICFP 1999: 18-27 - 1998
- [j27]Christian Wagenknecht, Daniel P. Friedman:
Teaching Nondeterministic and Universal Automata Using SCHEME. Comput. Sci. Educ. 8(3): 197-227 (1998) - [j26]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): 7-105 (1998) - [c31]Shriram Krishnamurthi, Matthias Felleisen, Daniel P. Friedman:
Synthesizing Object-Oriented and Functional Design to Promote Re-Use. ECOOP 1998: 91-113 - [c30]Jonathan Sobel, Daniel P. Friedman:
Recycling Continuations. ICFP 1998: 251-260 - 1996
- [b5]Daniel P. Friedman, Matthias Felleisen:
The little schemer (4. ed.). MIT Press 1996, ISBN 978-0-262-56099-3, pp. I-XIII, 1-196 - [b4]Daniel P. Friedman, Matthias Felleisen:
The seasoned schemer. MIT Press 1996, ISBN 978-0-262-56100-6, pp. I-XIII, 1-210 - [b3]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 - [b2]Matthias Felleisen, Daniel P. Friedman:
The little MLer. MIT Press 1996, ISBN 978-0-262-56114-3, pp. I-XVI, 1-181 - [j25]Stanley Jefferson, Daniel P. Friedman:
A Simple Reflective Interpreter. LISP Symb. Comput. 9(2-3): 181-202 (1996) - [c29]Jonathan G. Rossie Jr., Daniel P. Friedman, Mitchell Wand:
Modeling Subobject-based Inheritance. ECOOP 1996: 248-274 - [c28]Shinn-Der Lee, Daniel P. Friedman:
Enriching the Lambda Calculus with Contexts: Toward a Theory of Incremental Program Construction. ICFP 1996: 239-250 - 1995
- [c27]Eric Hilsdale, J. Michael Ashley, R. Kent Dybvig, Daniel P. Friedman:
Compiler Construction Using Scheme. FPLE 1995: 251-267 - [c26]Jonathan G. Rossie Jr., Daniel P. Friedman:
An Algebraic Semantics of Subobjects. OOPSLA 1995: 187-199 - 1993
- [c25]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 - [c24]Shinn-Der Lee, Daniel P. Friedman:
Quasi-Static Scoping: Sharing Variable Bindings Across Multiple Lexical Scopes. POPL 1993: 479-492 - [c23]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 - [c22]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 - 1992
- [b1]Daniel P. Friedman, Mitchell Wand, Christopher T. Haynes:
Essentials of programming languages. MIT Press 1992, ISBN 978-0-262-06145-2, pp. 1-536 - [j24]Shinn-Der Lee, Daniel P. Friedman:
First-Class Extents. LISP Symb. Comput. 5(4): 343-375 (1992) - [c21]Eric T. Freeman, Daniel P. Friedman:
Characterizing the Paralation Model using Dynamic Assignment. PARLE 1992: 483-496 - 1990
- [j23]John V. Franco, Daniel P. Friedman:
Towards a Facility for Lexically Scoped, Dynamic Mutual Recursion in Scheme. Comput. Lang. 15(1): 54-64 (1990) - [j22]John V. Franco, Daniel P. Friedman, Steven D. Johnson:
Multi-Way Streams in Scheme. Comput. Lang. 15(1): 109-125 (1990) - [c20]Stanley Jefferson, Shinn-Der Lee, Daniel P. Friedman:
A Syntactic Theory of Transparent Parameterization. ESOP 1990: 212-226
1980 – 1989
- 1989
- [j21]John V. Franco, Daniel P. Friedman:
Creating Efficient Programs by Exchanging Data for Procedures. Comput. Lang. 14(1): 11-23 (1989) - [j20]Matthias Felleisen, Daniel P. Friedman:
A Syntactic Theory of Sequential State. Theor. Comput. Sci. 69(3): 243-287 (1989) - 1988
- [j19]Mitchell Wand, Daniel P. Friedman:
The Mystery of the Tower Revealed: A Nonreflective Description of the Reflective Tower. LISP Symb. Comput. 1(1): 11-37 (1988) - [j18]R. Kent Dybvig, Daniel P. Friedman, Christopher T. Haynes:
Expansion-Passing Style: A General Macro Mechanism. LISP Symb. Comput. 1(1): 53-75 (1988) - [c19]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 - 1987
- [j17]Christopher T. Haynes, Daniel P. Friedman:
Abstracting Timed Preemption with Engines. Comput. Lang. 12(2): 109-121 (1987) - [j16]Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker, Bruce F. Duba:
A Syntactic Theory of Sequential Control. Theor. Comput. Sci. 52: 205-237 (1987) - [j15]Christopher T. Haynes, Daniel P. Friedman:
Embedding Continuations in Procedural Objects. ACM Trans. Program. Lang. Syst. 9(4): 582-598 (1987) - [c18]Matthias Felleisen, Daniel P. Friedman:
Control operators, the SECD-machine, and the λ-calculus. Formal Description of Programming Concepts 1987: 193-222 - [c17]Matthias Felleisen, Daniel P. Friedman:
A Reduction Semantics for Imperative Higher-Order Languages. PARLE (2) 1987: 206-223 - [c16]Matthias Felleisen, Daniel P. Friedman:
A Calculus for Assignments in Higher-Order Languages. POPL 1987: 314-325 - 1986
- [j14]Matthias Felleisen, Daniel P. Friedman:
A Closer Look at Export and Import Statements. Comput. Lang. 11(1): 29-37 (1986) - [j13]Christopher T. Haynes, Daniel P. Friedman, Mitchell Wand:
Obtaining Coroutines with Continuations. Comput. Lang. 11(3/4): 143-153 (1986) - [c15]R. Kent Dybvig, Daniel P. Friedman, Christopher T. Haynes:
Expansion-Passing Style: Beyond Conventional Macros. LISP and Functional Programming 1986: 143-150 - [c14]Eugene E. Kohlbecker, Daniel P. Friedman, Matthias Felleisen, Bruce F. Duba:
Hygienic Macro Expansion. LISP and Functional Programming 1986: 151-161 - [c13]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 - [c12]Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker, Bruce F. Duba:
Reasoning with Continuations. LICS 1986: 131-141 - 1985
- [c11]Daniel P. Friedman, Christopher T. Haynes:
Constraining Control. POPL 1985: 245-254 - 1984
- [c10]Christopher T. Haynes, Daniel P. Friedman:
Engines Build Process Abstractions. LISP and Functional Programming 1984: 18-24 - [c9]Christopher T. Haynes, Daniel P. Friedman, Mitchell Wand:
Continuations and Coroutines. LISP and Functional Programming 1984: 293-298 - [c8]Daniel P. Friedman, Mitchell Wand:
Reification: Reflection without Metaphysics. LISP and Functional Programming 1984: 348-355 - 1982
- [c7]Robert E. Filman, Daniel P. Friedman:
Models, languages, and heuristics for distributed computing. AFIPS National Computer Conference 1982: 671-677 - [e1]David M. R. Park, Daniel P. Friedman, David S. Wise, Guy L. Steele Jr.:
Proceedings of the 1982 ACM Symposium on LISP and Functional Programming, LFP 1980, Pittsburgh, PA, USA, August 15-18, 1982. ACM 1982, ISBN 0-89791-082-6 [contents] - 1980
- [j12]Richard M. Salter, Terence J. Brennan, Daniel P. Friedman:
Concur: A Language for Continuous, Concurrent Processes. Comput. Lang. 5(3): 163-189 (1980) - [c6]Daniel P. Friedman, David S. Wise:
An Indeterminate Constructor for Applicative Programming. POPL 1980: 245-250
1970 – 1979
- 1979
- [j11]Daniel P. Friedman, David S. Wise:
Reference Counting Can Manage the Circular Environments of Mutual Recursion. Inf. Process. Lett. 8(1): 41-45 (1979) - [c5]Daniel P. Friedman, David S. Wise:
An Approach to Fair Applicative Multiprogramming. Semantics of Concurrent Computation 1979: 203-225 - 1978
- [j10]Daniel P. Friedman, David S. Wise:
A Note on Conditional Expressions. Commun. ACM 21(11): 931-933 (1978) - [j9]Daniel P. Friedman, David S. Wise:
Functional Combination. Comput. Lang. 3(1): 31-35 (1978) - [j8]Mitchell Wand, Daniel P. Friedman:
Compiling Lambda-Expressions Using Continuations and Factorizations. Comput. Lang. 3(4): 241-263 (1978) - [j7]Daniel P. Friedman, David S. Wise:
Unbounded Computational Structures. Softw. Pract. Exp. 8(4): 407-416 (1978) - [j6]Daniel P. Friedman, David S. Wise:
Aspects of Applicative Programming for Parallel Processing. IEEE Trans. Computers 27(4): 289-296 (1978) - 1977
- [j5]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): 537-581 (1977) - [c4]Daniel P. Friedman, David S. Wise:
Aspects of Applicative Programming for File Systems (Preliminary Version). Language Design for Reliable Software 1977: 41-55 - 1976
- [j4]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) - [j3]Daniel P. Friedman, David S. Wise:
Garbage Collecting a Heap Which Includes a Scatter Table. Inf. Process. Lett. 5(6): 161-164 (1976) - [c3]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: 529 - [c2]Daniel P. Friedman, David S. Wise:
CONS Should Not Evaluate its Arguments. ICALP 1976: 257-284 - [c1]Daniel P. Friedman, David S. Wise, Mitchell Wand:
Recursive programming through table look-up. SYMSACC 1976: 85-89 - 1974
- [j2]Daniel P. Friedman, Stuart C. Shapiro:
A case for while-until. ACM SIGPLAN Notices 9(7): 7-14 (1974) - 1971
- [j1]Terrence W. Pratt, Daniel P. Friedman:
A Language Extension for Graph Processing and Its Formal Semantics. Commun. ACM 14(7): 460-467 (1971)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
