Jump to content

Daniel P. Friedman

From Wikipedia, the free encyclopedia
For other people with the same name, see Daniel Friedman (disambiguation).
Daniel Paul Friedman
Born1944 (age 79–80)
Alma materUniversity of Houston[1]
Known forProgramming Languages
Notable workThe Little Schemer, Essentials of Programming Languages, The Little Prover
Scientific career
FieldsComputer Science
InstitutionsIndiana University

Daniel Paul Friedman (born 1944) is a professor of Computer Science at Indiana University in Bloomington, Indiana. His research focuses on programming languages, and he is a prominent author in the field.

With David Wise, Friedman wrote a highly influential paper on lazy programming, specifically on lazy streams (ICALP 1976). The paper, entitled "Cons should not evaluate its arguments," [2] is one of the first publications pushing for the exploration of a programming style with potentially infinite data structures and a form of programming that employs no computational effects (though programs may diverge). Over the 1970s, Friedman and Wise explored the topic in depth and also considered extensions to the world of parallel computing.

In the 1980s, Friedman turned to the study of the Scheme programming language. He explored the use of macros for defining programming languages; with Eugene Kohlbecker, Matthias Felleisen, and Bruce Duba, he co-introduced the notion of hygienic macros in a 1986 LFP paper that is still widely cited today.[3] With Christopher T. Haynes and Mitchell Wand, he simultaneously studied the nature of continuation objects, their uses, and the possibilities of constraining them.[4] Following that, Friedman and Felleisen introduced a lambda calculus with continuations and control operators.[5]

Books

[edit]

Daniel P. Friedman is the author or co-author of the following books:

  • The Little Lisper[6]
  • The Little Schemer[7]
  • The Little MLer[8]
  • A Little Java, A Few Patterns[9]
  • The Seasoned Schemer[10]
  • The Reasoned Schemer[11]
  • The Little Prover[12]
  • Essentials of Programming Languages[13]
  • Scheme and the Art of Programming[14]
  • Coordinated Computing: Tools and Techniques for Distributed Software[15]
  • The Little Typer[16]
  • The Little Learner[17]
[edit]

References

[edit]
  1. ^ "An Evening with Dan Friedman". April 6, 2016. Archived from the original on March 11, 2018. Retrieved September 11, 2017 – via Vimeo.
  2. ^ Friedman, Daniel P. (1976). "Cons should not evaluate its arguments". Automata, Languages and Programming. Edinburgh University Press.
  3. ^ Friedman, Daniel P. (1986). "Hygienic Macros". Proceedings of the ACM Symposium on LISP and Functional Programming.
  4. ^ Friedman, Daniel P. (1985). "Constraining Control". Conference Record of the Annual ACM Symposium on Principles of Programming Languages.
  5. ^ Friedman, Daniel P. (1986). "Reasoning with Continuations". Proceedings of the IEEE Symposium on Logic in Computer Science.
  6. ^ The Little Lisper. MIT Press. 1987. ISBN 0-262-56038-0.
  7. ^ The Little Schemer (4th ed.). MIT Press. 1996. ISBN 0-262-56099-2.
  8. ^ The Little MLer. MIT Press. 1998. ISBN 0-262-56114-X.
  9. ^ A Little Java, A Few Patterns. MIT Press. 1998. ISBN 0-262-56115-8.
  10. ^ The Seasoned Schemer. MIT Press. 1996. ISBN 0-262-56100-X.
  11. ^ The Reasoned Schemer. MIT Press. 2018. ISBN 0-262-56214-6.
  12. ^ The Little Prover. ISBN 0-262-52795-2.
  13. ^ Essentials of Programming Languages (3rd ed.). MIT Press. 2008. ISBN 0-262-06217-8.
  14. ^ Scheme and the Art of Programming. ISBN 0-262-19288-8.
  15. ^ Coordinated Computing: Tools and Techniques for Distributed Software. ISBN 0-07-022439-0.
  16. ^ The Little Typer. ISBN 9780262536431.
  17. ^ The Little Learner. MIT Press. 2023. ISBN 9780262546379.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Daniel_P._Friedman&oldid=1264361160"