Search for Author All Reviews
	Friedman, Daniel P.     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 5 of 6 reviews       The little prover Friedman D., Eastlund C., The MIT Press, Cambridge, MA, 2015. 248 pp.  Type: Book (978-0-262527-95-8) The goal of this book is to teach readers how to prove that recursive Lisp programs are correct. The method used is based on principles from mathematical logic; it involves identifying basic axioms, theorems, and rules of text transfor...... Dec 9 2015     Essentials of programming languages Friedman D., Wand M., The MIT Press, 2008. 416 pp.  Type: Book (9780262062794) What is the best way to talk about the general topic of programming languages? Certainly, the most common approach adopts the pattern of “compare features X, Y, Z in languages A, B, and C,” but this of...... Aug 15 2008     The reasoned schemer Friedman D., Byrd W., Kiselyov O., The MIT Press, 2005. 176 pp.  Type: Book (9780262562140) Declarative programming encompasses both functional and logic paradigms, but few declarative languages support both. This textbook uses an extension to the LISP-like functional language Scheme to cover most of the logical constructs av...... Aug 10 2006     Essentials of programming languages (2nd ed.) Friedman D., Haynes C., Wand M., Massachusetts Institute of Technology, Cambridge, MA, 2001. 389 pp.  Type: Book (9780262062176) The first edition of this book [1] has been so influential that the initials EOPL are a widely understood shorthand. It is still the primary representative of one school of thought regarding how programming language principles s...... May 1 2001     Embedding continuations in procedural objects Haynes C., Friedman D. ACM Transactions on Programming Languages and Systems 9(4): 582-598, 1987.  Type: Article The idea of continuations is old and basically amounts to marking a point during program execution and returning to that state later in execution. The authors discuss first-class continuations, which can be treated like any other data ...... Jul 1 1988     Display 510152550100 per column
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy