F3: A Compiler for Feature Engineering.

Daniel P. Friedman Indiana University, Bloomington, USA http://www.cs.indiana.edu/~dfried/ https://dl.acm.org/profile/81100636522 https://mathscinet.ams.org/mathscinet/MRAuthorID/248857 https://mathgenealogy.org/id.php?id=75750 https://en.wikipedia.org/wiki/Daniel_P._Friedman https://orcid.org/0000-0001-9992-1675 https://www.wikidata.org/entity/Q5218364 http://isni.org/isni/000000009464494X https://id.loc.gov/authorities/names/n83185951 https://d-nb.info/gnd/1140757091 https://www.wikidata.org/entity/Q130811368 https://zbmath.org/authors/?q=ai:friedman.daniel-p Weixi Ma Siyu Wang Arnaud Venet Junhua Gu Subbu Subramanian Rocky Liu Yafei Yang Daniel P. Friedman F3: A Compiler for Feature Engineering. 3-9 2024 FUNARCH https://doi.org/10.1145/3677998.3678220 https://www.wikidata.org/entity/Q130811369 conf/funarch/2024 db/conf/funarch/funarch2024.html#MaWVGSLYF24 Jason Hemann Daniel P. Friedman Nearly Macro-free microKanren. 72-91 2023 TFP https://doi.org/10.1007/978-3-031-38938-2_5 conf/sfp/2023 db/conf/sfp/tfp2023.html#HemannF23 Jason Hemann Daniel P. Friedman William E. Byrd Matthew Might A Simple Complete Search for Logic Programming. 14:1-14:8 2017 ICLP (Technical Communications) https://doi.org/10.4230/OASIcs.ICLP.2017.14 conf/iclp/2017 db/conf/iclp/iclp2017.html#HemannFBM17 Jason Hemann Daniel P. Friedman A Framework for Extending microKanren with Constraints. WLP / WFLP 2017 135-149 https://doi.org/10.4204/EPTCS.234.10 http://arxiv.org/abs/1701.00633 journals/corr/SchwarzV17 db/series/eptcs/eptcs234.html#HemannF17 Jason Hemann Daniel P. Friedman William E. Byrd Matthew Might A small embedding of logic programming with a simple complete search. 96-107 2016 DLS https://doi.org/10.1145/2989225.2989230 https://doi.org/10.1145/3093334.2989230 https://www.wikidata.org/entity/Q130860777 conf/dls/2016 db/conf/dls/dls2016.html#HemannFBM16 William E. Byrd Eric Holk Daniel P. Friedman miniKanren, live and untagged: quine generation via relational interpreters (programming pearl). 8-29 2012 Scheme@ICFP https://doi.org/10.1145/2661103.2661105 conf/icfp/2012scheme db/conf/icfp/scheme2012.html#ByrdHF12 Daniel P. Friedman Mitchell Wand Essentials of programming languages (3. ed.). I-XXII, 1-410 MIT Press 2008 978-0-262-06279-4

Mitchell Wand Daniel P. Friedman Programming languages: fundamental concepts for expanding and disciplining the mind. 133-135 2008 43 ACM SIGPLAN Notices 11 https://doi.org/10.1145/1480828.1480857 db/journals/sigplan/sigplan43.html#WandF08

Oleg Kiselyov William E. Byrd Daniel P. Friedman Chung-chieh Shan Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl). 64-80 2008 FLOPS https://doi.org/10.1007/978-3-540-78969-7_7 conf/flops/2008 db/conf/flops/flops2008.html#KiselyovBFS08 Joseph P. Near William E. Byrd Daniel P. Friedman alpha-leanTAP: A Declarative Theorem Prover for First-Order Classical Logic. 238-252 2008 ICLP https://doi.org/10.1007/978-3-540-89982-2_26 conf/iclp/2008 db/conf/iclp/iclp2008.html#NearBF08

Daniel P. Friedman Abdulaziz Ghuloum Jeremy G. Siek Onnie Lynn Winebarger Improving the lazy Krivine machine. 271-293 2007 20 High. Order Symb. Comput. 3 https://doi.org/10.1007/s10990-007-9014-0 db/journals/lisp/lisp20.html#FriedmanGSW07

Daniel P. Friedman William E. Byrd Oleg Kiselyov The reasoned schemer. I-X, 1-169 MIT Press 2005 978-0-262-56214-0 Oleg Kiselyov Chung-chieh Shan Daniel P. Friedman Amr Sabry Backtracking, interleaving, and terminating monad transformers: (functional pearl). 192-203 2005 conf/icfp/2005 ICFP https://doi.org/10.1145/1086365.1086390 https://doi.org/10.1145/1090189.1086390 https://www.wikidata.org/entity/Q56115130 db/conf/icfp/icfp2005.html#KiselyovSFS05

Daniel P. Friedman Amr Sabry CPS in little pieces: composing partial continuations. 617-622 2002 12 J. Funct. Program. 6 https://doi.org/10.1017/S0956796801004221 db/journals/jfp/jfp12.html#FriedmanS02

Daniel P. Friedman Mitchell Wand Christopher T. Haynes Essentials of programming languages (2. ed.). I-XVIII, 1-389 MIT Press 2001 978-0-262-06217-6 Steven E. Ganz Daniel P. Friedman Mitchell Wand Trampolined Style. 18-27 1999 conf/icfp/1999 ICFP https://doi.org/10.1145/317636.317779 https://doi.org/10.1145/317765.317779 db/conf/icfp/icfp99.html#GanzFW99

Christian Wagenknecht Daniel P. Friedman Teaching Nondeterministic and Universal Automata Using SCHEME. 197-227 1998 8 Comput. Sci. Educ. 3 https://doi.org/10.1076/csed.8.3.197.7089 db/journals/csedu/csedu8.html#WagenknechtF98

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. 7-105 1998 11 High. Order Symb. Comput. 1 db/journals/lisp/lisp11.html#AbelsonDHRAFKSBHOSBHPW98 https://doi.org/10.1023/A:1010051815785 https://www.wikidata.org/entity/Q55867909

Shriram Krishnamurthi Matthias Felleisen Daniel P. Friedman Synthesizing Object-Oriented and Functional Design to Promote Re-Use. 91-113 https://doi.org/10.1007/BFb0054088 1998 conf/ecoop/1998 ECOOP db/conf/ecoop/ecoop98.html#KrishnamurthiFF98 Jonathan Sobel Daniel P. Friedman Recycling Continuations. 251-260 1998 conf/icfp/1998 ICFP https://doi.org/10.1145/289423.289452 https://doi.org/10.1145/291251.289452 db/conf/icfp/icfp98.html#SobelF98 Daniel P. Friedman Matthias Felleisen The little schemer (4. ed.). I-XIII, 1-196 MIT Press 1996 978-0-262-56099-3 Daniel P. Friedman Matthias Felleisen The seasoned schemer. I-XIII, 1-210 MIT Press 1996 978-0-262-56100-6 Matthias Felleisen Daniel P. Friedman A little Java, a few patterns. I-XIV, 1-179 MIT Press 1996 978-0-262-56115-0 Matthias Felleisen Daniel P. Friedman The little MLer. I-XVI, 1-181 MIT Press 1996 978-0-262-56114-3

Stanley Jefferson Daniel P. Friedman A Simple Reflective Interpreter. 181-202 1996 9 LISP Symb. Comput. 2-3 db/journals/lisp/lisp9.html#JeffersonF96

Jonathan G. Rossie Jr. Daniel P. Friedman Mitchell Wand Modeling Subobject-based Inheritance. 248-274 https://doi.org/10.1007/BFb0053065 1996 conf/ecoop/1996 ECOOP db/conf/ecoop/ecoop96.html#RossieFW96 Shinn-Der Lee Daniel P. Friedman Enriching the Lambda Calculus with Contexts: Toward a Theory of Incremental Program Construction. 239-250 1996 conf/icfp/1996 ICFP db/conf/icfp/icfp96.html#LeeF96 https://doi.org/10.1145/232627.232652 https://doi.org/10.1145/232629.232652 Eric Hilsdale J. Michael Ashley R. Kent Dybvig Daniel P. Friedman Compiler Construction Using Scheme. 251-267 1995 conf/fple/1995 FPLE db/conf/fple/fple95.html#HilsdaleADF95 https://doi.org/10.1007/3-540-60675-0_49 Jonathan G. Rossie Jr. Daniel P. Friedman An Algebraic Semantics of Subobjects. 187-199 1995 conf/oopsla/1995 OOPSLA db/conf/oopsla/oopsla95.html#RossieF95 https://doi.org/10.1145/217838.217860 https://doi.org/10.1145/217839.217860 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). 533-534 1993 conf/acm/1993 ACM Conference on Computer Science https://doi.org/10.1145/170791.171168 db/conf/acm/csc93.html#RiehlFHKSS93 Shinn-Der Lee Daniel P. Friedman Quasi-Static Scoping: Sharing Variable Bindings Across Multiple Lexical Scopes. 479-492 1993 conf/popl/1993 POPL db/conf/popl/popl93.html#LeeF93 https://doi.org/10.1145/158511.158706 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). 288 1993 conf/sigcse/1993 SIGCSE https://doi.org/10.1145/169070.169510 https://doi.org/10.1145/169073.169510 db/conf/sigcse/sigcse1993.html#RiehlFHKSS93 Rhys Price Jones Doug Cooper Daniel P. Friedman Richard C. Holt Peter Robinson 0001 Issues in the choice of programming language for CS 1 (abstract). 301 1993 conf/sigcse/1993 SIGCSE https://doi.org/10.1145/169070.169531 https://doi.org/10.1145/169073.169531 db/conf/sigcse/sigcse1993.html#JonesCFHR93 Daniel P. Friedman Mitchell Wand Christopher T. Haynes Essentials of programming languages. 1-536 MIT Press 1992 978-0-262-06145-2

Shinn-Der Lee Daniel P. Friedman First-Class Extents. 343-375 1992 5 LISP Symb. Comput. 4 db/journals/lisp/lisp5.html#LeeF92

Eric T. Freeman Daniel P. Friedman Characterizing the Paralation Model using Dynamic Assignment. 483-496 1992 conf/parle/1992 PARLE db/conf/parle/parle92.html#FreemanF92 https://doi.org/10.1007/3-540-55599-4_106

John V. Franco Daniel P. Friedman Towards a Facility for Lexically Scoped, Dynamic Mutual Recursion in Scheme. 54-64 1990 15 Comput. Lang. 1 db/journals/cl/cl15.html#FrancoF90 https://doi.org/10.1016/0096-0551(90)90019-L

John V. Franco Daniel P. Friedman Steven D. Johnson Multi-Way Streams in Scheme. 109-125 1990 15 Comput. Lang. 1 db/journals/cl/cl15.html#FrancoFJ90 https://doi.org/10.1016/0096-0551(90)90014-G

Stanley Jefferson Shinn-Der Lee Daniel P. Friedman A Syntactic Theory of Transparent Parameterization. 212-226 1990 conf/esop/1990 ESOP db/conf/esop/esop90.html#JeffersonLF90 https://doi.org/10.1007/3-540-52592-0_65

John V. Franco Daniel P. Friedman Creating Efficient Programs by Exchanging Data for Procedures. 11-23 1989 14 Comput. Lang. 1 db/journals/cl/cl14.html#FrancoF89 https://doi.org/10.1016/0096-0551(89)90027-1

Matthias Felleisen Daniel P. Friedman A Syntactic Theory of Sequential State. 243-287 1989 69 Theor. Comput. Sci. 3 db/journals/tcs/tcs69.html#FelleisenF89 https://doi.org/10.1016/0304-3975(89)90069-8

Mitchell Wand Daniel P. Friedman The Mystery of the Tower Revealed: A Nonreflective Description of the Reflective Tower. 11-37 1988 1 LISP Symb. Comput. 1 db/journals/lisp/lisp1.html#WandF88

R. Kent Dybvig Daniel P. Friedman Christopher T. Haynes Expansion-Passing Style: A General Macro Mechanism. 53-75 1988 1 LISP Symb. Comput. 1 db/journals/lisp/lisp1.html#DybvigFH88

Matthias Felleisen Mitchell Wand Daniel P. Friedman Bruce F. Duba Abstract Continuations: A Mathematical Semantics for Handling Full Jumps. 52-62 1988 conf/lfp/1988 LISP and Functional Programming https://doi.org/10.1145/62678.62684 db/conf/lfp/lfp1988.html#FelleisenWFD88

Christopher T. Haynes Daniel P. Friedman Abstracting Timed Preemption with Engines. 109-121 1987 12 Comput. Lang. 2 db/journals/cl/cl12.html#HaynesF87 https://doi.org/10.1016/0096-0551(87)90003-8

Matthias Felleisen Daniel P. Friedman Eugene E. Kohlbecker Bruce F. Duba A Syntactic Theory of Sequential Control. 205-237 1987 52 Theor. Comput. Sci. db/journals/tcs/tcs52.html#FelleisenFKD87 https://doi.org/10.1016/0304-3975(87)90109-5

Christopher T. Haynes Daniel P. Friedman Embedding Continuations in Procedural Objects. 582-598 1987 9 ACM Trans. Program. Lang. Syst. 4 https://doi.org/10.1145/29873.30392 db/journals/toplas/toplas9.html#HaynesF87

Matthias Felleisen Daniel P. Friedman Control operators, the SECD-machine, and the λ-calculus. 193-222 1987 Formal Description of Programming Concepts conf/ifip2/1987 db/conf/ifip2/fdpc1987.html#FelleisenF87 Matthias Felleisen Daniel P. Friedman A Reduction Semantics for Imperative Higher-Order Languages. 206-223 1987 conf/parle/1987-2 PARLE (2) db/conf/parle/parle87-2.html#FelleisenF87 https://doi.org/10.1007/3-540-17945-3_12 Matthias Felleisen Daniel P. Friedman A Calculus for Assignments in Higher-Order Languages. 314-325 1987 conf/popl/1987 POPL db/conf/popl/popl87.html#FelleisenF87 https://doi.org/10.1145/41625.41654

Matthias Felleisen Daniel P. Friedman A Closer Look at Export and Import Statements. 29-37 1986 11 Comput. Lang. 1 db/journals/cl/cl11.html#FelleisenF86 https://doi.org/10.1016/0096-0551(86)90015-9

Christopher T. Haynes Daniel P. Friedman Mitchell Wand Obtaining Coroutines with Continuations. 143-153 1986 11 Comput. Lang. 3/4 db/journals/cl/cl11.html#HaynesFW86 https://doi.org/10.1016/0096-0551(86)90007-X

R. Kent Dybvig Daniel P. Friedman Christopher T. Haynes Expansion-Passing Style: Beyond Conventional Macros. 143-150 1986 conf/lfp/1986 LISP and Functional Programming db/conf/lfp/lfp1986.html#DybvigFH86 https://doi.org/10.1145/319838.319858 Eugene E. Kohlbecker Daniel P. Friedman Matthias Felleisen Bruce F. Duba Hygienic Macro Expansion. 151-161 1986 conf/lfp/1986 LISP and Functional Programming db/conf/lfp/lfp1986.html#KohlbeckerFFD86 https://doi.org/10.1145/319838.319859 https://www.wikidata.org/entity/Q56057622 Mitchell Wand Daniel P. Friedman The Mystery of the Tower Revealed: A Non-Reflective Description of the Reflective Tower. 298-307 1986 conf/lfp/1986 LISP and Functional Programming db/conf/lfp/lfp1986.html#WandF86 https://doi.org/10.1145/319838.319871 https://www.wikidata.org/entity/Q61067953 Matthias Felleisen Daniel P. Friedman Eugene E. Kohlbecker Bruce F. Duba Reasoning with Continuations 131-141 conf/lics/1986 1986 LICS db/conf/lics/lics86.html#FelleisenFKD86 Daniel P. Friedman Christopher T. Haynes Constraining Control. 245-254 1985 conf/popl/1985 POPL db/conf/popl/popl85.html#FriedmanH85 https://doi.org/10.1145/318593.318654 Christopher T. Haynes Daniel P. Friedman Engines Build Process Abstractions. 18-24 1984 conf/lfp/1984 LISP and Functional Programming db/conf/lfp/lfp1984.html#HaynesF84 https://doi.org/10.1145/800055.802018 Christopher T. Haynes Daniel P. Friedman Mitchell Wand Continuations and Coroutines. 293-298 1984 conf/lfp/1984 LISP and Functional Programming db/conf/lfp/lfp1984.html#HaynesFW84 https://doi.org/10.1145/800055.802046 Daniel P. Friedman Mitchell Wand Reification: Reflection without Metaphysics. 348-355 1984 conf/lfp/1984 LISP and Functional Programming db/conf/lfp/lfp1984.html#FriedmanW84 https://doi.org/10.1145/800055.802051 Robert E. Filman Daniel P. Friedman Models, languages, and heuristics for distributed computing. 671-677 1982 AFIPS National Computer Conference https://doi.org/10.1145/1500774.1500859 conf/afips/1982 db/conf/afips/ncc82.html#FilmanF82 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. 1982 Symposium on LISP and Functional Programming ACM 0-89791-082-6 https://doi.org/10.1145/800068 db/conf/lfp/lfp1982.html

Richard M. Salter Terence J. Brennan Daniel P. Friedman Concur: A Language for Continuous, Concurrent Processes. 163-189 1980 5 Comput. Lang. 3 db/journals/cl/cl5.html#SalterBF80 https://doi.org/10.1016/0096-0551(80)90009-0

Daniel P. Friedman David S. Wise An Indeterminate Constructor for Applicative Programming. 245-250 1980 conf/popl/1980 POPL db/conf/popl/popl80.html#FriedmanW80 https://doi.org/10.1145/567446.567470

Daniel P. Friedman David S. Wise Reference Counting Can Manage the Circular Environments of Mutual Recursion. 41-45 1979 8 Inf. Process. Lett. 1 db/journals/ipl/ipl8.html#FriedmanW79 https://doi.org/10.1016/0020-0190(79)90091-7

Daniel P. Friedman David S. Wise An Approach to Fair Applicative Multiprogramming. 203-225 1979 conf/scc/1979 Semantics of Concurrent Computation db/conf/scc/scc1979.html#FriedmanW79 https://doi.org/10.1007/BFb0022471

Daniel P. Friedman David S. Wise A Note on Conditional Expressions. 931-933 1978 21 Commun. ACM 11 db/journals/cacm/cacm21.html#FriedmanW78 https://doi.org/10.1145/359642.359650

Daniel P. Friedman David S. Wise Functional Combination. 31-35 1978 3 Comput. Lang. 1 db/journals/cl/cl3.html#FriedmanW78 https://doi.org/10.1016/0096-0551(78)90004-8

Mitchell Wand Daniel P. Friedman Compiling Lambda-Expressions Using Continuations and Factorizations. 241-263 1978 3 Comput. Lang. 4 db/journals/cl/cl3.html#WandF78 https://doi.org/10.1016/0096-0551(78)90042-5 https://www.wikidata.org/entity/Q114215184

Daniel P. Friedman David S. Wise Unbounded Computational Structures. 407-416 1978 8 Softw. Pract. Exp. 4 db/journals/spe/spe8.html#FreidmanW78 https://doi.org/10.1002/spe.4380080404

Daniel P. Friedman David S. Wise Aspects of Applicative Programming for Parallel Processing. 289-296 1978 27 IEEE Trans. Computers 4 db/journals/tc/tc27.html#FriedmanW78 https://doi.org/10.1109/TC.1978.1675100 http://doi.ieeecomputersociety.org/10.1109/TC.1978.1675100

John D. Lowrance Daniel P. Friedman Hendrix's Model for Simultaneous Actions and Continuous Processes: An Introduction and Implementation. 537-581 1977 9 Int. J. Man Mach. Stud. 5 db/journals/ijmms/ijmms9.html#LowranceF77 https://doi.org/10.1016/S0020-7373(77)80003-5

Daniel P. Friedman David S. Wise Aspects of Applicative Programming for File Systems (Preliminary Version). 41-55 1977 conf/ldrs/1977 Language Design for Reliable Software db/conf/ldrs/ldrs77.html#FriedmanW77 https://doi.org/10.1145/800022.808310 https://doi.org/10.1145/390017.808310 https://doi.org/10.1145/390018.808310 https://doi.org/10.1145/390019.808310

Daniel P. Friedman David S. Wise Output Driven Interpretation of Recursive Programs, or Writing Creates and Destroys Data Structures. 155-160 1976 5 Inf. Process. Lett. 6 db/journals/ipl/ipl5.html#FriedmanW76 https://doi.org/10.1016/0020-0190(76)90010-7 Erratum: IPL 9(2):101 (1979)

Daniel P. Friedman David S. Wise Garbage Collecting a Heap Which Includes a Scatter Table. 161-164 1976 5 Inf. Process. Lett. 6 db/journals/ipl/ipl5.html#FriedmanW76a https://doi.org/10.1016/0020-0190(76)90011-9 Erratum: IPL 6(2): 72 (1977)

Frederick E. Petry Alan W. Biermann Monroe M. Newborn Helmut Kerner Werner Beyerle Kathleen M. Shockley Daniel P. Friedman General interest (Paper Session). 529 1976 ACM Annual Conference https://doi.org/10.1145/800191.805658 conf/acm/1976 db/conf/acm/acm1976.html#PetryBNKBSF76 Daniel P. Friedman David S. Wise CONS Should Not Evaluate its Arguments. 257-284 1976 conf/icalp/1976 ICALP db/conf/icalp/icalp76.html#FriedmanW76 Daniel P. Friedman David S. Wise Mitchell Wand Recursive programming through table look-up. 85-89 1976 SYMSACC https://doi.org/10.1145/800205.806326 conf/issac/1976 db/conf/issac/symsac1976.html#FriedmanWW76

Daniel P. Friedman Stuart C. Shapiro A case for while-until. 7-14 1974 9 ACM SIGPLAN Notices 7 https://doi.org/10.1145/953224.953225 db/journals/sigplan/sigplan9.html#FriedmanS74a

Terrence W. Pratt Daniel P. Friedman A Language Extension for Graph Processing and Its Formal Semantics. 460-467 1971 14 Commun. ACM 7 db/journals/cacm/cacm14.html#PrattF71 https://doi.org/10.1145/362619.362627

Harold Abelson N. I. Adams IV J. Michael Ashley David H. Bartley Werner Beyerle Alan W. Biermann Terence J. Brennan G. Brooks William E. Byrd Doug Cooper Bruce F. Duba R. Kent Dybvig Matthias Felleisen Robert E. Filman John V. Franco Eric T. Freeman Steven E. Ganz Abdulaziz Ghuloum Junhua Gu Robert H. Halstead Jr. Chris Hanson Brian Harvey Christopher T. Haynes Jason Hemann Eric Hilsdale Eric Holk Richard C. Holt Stanley Jefferson Steven D. Johnson Rhys Price Jones Simon M. Kaplan Helmut Kerner Oleg Kiselyov Eugene E. Kohlbecker Shriram Krishnamurthi Shinn-Der Lee Rocky Liu John D. Lowrance Weixi Ma Matthew Might Joseph P. Near Monty NewbornMonroe M. Newborn Don Oxley David M. R. Park Fred PetryFrederick E. Petry Kent M. Pitman Terrence W. Pratt Arthur M. Riehl Peter Robinson 0001 Jonathan G. Rossie Jr. Guillermo Juan Rozas Amr Sabry Richard M. Salter Chung-chieh Shan Stuart C. Shapiro Kathleen M. Shockley Jeremy G. Siek Jonathan Sobel George Springer Guy L. Steele Jr. Subbu Subramanian Gerald J. Sussman Arnaud Venet Christian Wagenknecht Mitchell Wand Siyu Wang Onnie Lynn Winebarger David S. Wise Yafei Yang