| 2017 | ICLP | A Simple Complete Search for Logic Programming. | Jason Hemann, Daniel P. Friedman, William E. Byrd, Matthew Might |
| 2016 | DLS | A small embedding of logic programming with a simple complete search. | Jason Hemann, Daniel P. Friedman, William E. Byrd, Matthew Might |
| 2012 | ICFP | miniKanren, live and untagged: quine generation via relational interpreters (programming pearl). | William E. Byrd, Eric Holk, Daniel P. Friedman |
| 2008 | FLOPS | Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl). | Oleg Kiselyov, William E. Byrd, Daniel P. Friedman, Chung-chieh Shan |
| 2008 | ICLP | alpha-leanTAP: A Declarative Theorem Prover for First-Order Classical Logic. | Joseph P. Near, William E. Byrd, Daniel P. Friedman |
| 2005 | ICFP | Backtracking, interleaving, and terminating monad transformers: (functional pearl). | Oleg Kiselyov, Chung-chieh Shan, Daniel P. Friedman, Amr Sabry |
| 1999 | ICFP | Trampolined Style. | Steven E. Ganz, Daniel P. Friedman, Mitchell Wand |
| 1998 | ECOOP | Synthesizing Object-Oriented and Functional Design to Promote Re-Use. | Shriram Krishnamurthi, Matthias Felleisen, Daniel P. Friedman |
| 1998 | ICFP | Recycling Continuations. | Jonathan Sobel, Daniel P. Friedman |
| 1996 | ECOOP | Modeling Subobject-based Inheritance. | Jonathan G. Rossie Jr., Daniel P. Friedman, Mitchell Wand |
| 1996 | ICFP | Enriching the Lambda Calculus with Contexts: Toward a Theory of Incremental Program Construction. | Shinn-Der Lee, Daniel P. Friedman |
| 1995 | OOPSLA | An Algebraic Semantics of Subobjects. | Jonathan G. Rossie Jr., Daniel P. Friedman |
| 1993 | POPL | Quasi-Static Scoping: Sharing Variable Bindings Across Multiple Lexical Scopes. | Shinn-Der Lee, Daniel P. Friedman |
| 1993 | SIGCSE | Issues in the choice of programming language for CS 1 (abstract). | Rhys Price Jones, Doug Cooper, Daniel P. Friedman, Richard C. Holt, Peter Robinson |
| 1993 | SIGCSE | Using SCHEME in the introductory computer science curriculum (abstract). | Arthur M. Riehl, Daniel P. Friedman, Brian Harvey, Simon M. Kaplan, Richard M. Salter, George Springer |
| 1990 | ESOP | A Syntactic Theory of Transparent Parameterization. | Stanley Jefferson, Shinn-Der Lee, Daniel P. Friedman |
| 1987 | POPL | A Calculus for Assignments in Higher-Order Languages. | Matthias Felleisen, Daniel P. Friedman |
| 1986 | LICS | Reasoning with Continuations | Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker, Bruce F. Duba |
| 1985 | POPL | Constraining Control. | Daniel P. Friedman, Christopher T. Haynes |
| 1980 | POPL | An Indeterminate Constructor for Applicative Programming. | Daniel P. Friedman, David S. Wise |
| 1976 | ICALP | CONS Should Not Evaluate its Arguments. | Daniel P. Friedman, David S. Wise |
| 1976 | ISSAC | Recursive programming through table look-up. | Daniel P. Friedman, David S. Wise, Mitchell Wand |