Lambda-calculus, Combinators and Functional Programming (Cambridge Tracts in Theoretical Computer Science) [Paperback]

G. E. Revesz (Author)

Book Description

ISBN-10: 0521114292 | ISBN-13: 978-0521114295 | Publication Date: June 25, 2009 | Edition: 1

Originally published in 1988, this book presents an introduction to lambda-calculus and combinators without getting lost in the details of mathematical aspects of their theory. Lambda-calculus is treated here as a functional language and its relevance to computer science is clearly demonstrated. The main purpose of the book is to provide computer science students and researchers with a firm background in lambda-calculus and combinators and show the applicabillity of these theories to functional programming. The presentation of the material is self-contained. It can be used as a primary text for a course on functional programming. It can also be used as a supplementary text for courses on the structure and implementation of programming languages, theory of computing, or semantics of programming languages.

Editorial Reviews

Book Description

Originally published in 1988, this book presents an introduction to lambda-calculus and combinators without getting lost in the details of mathematical aspects of their theory. Lambda-calculus is treated here as a functional language and its relevance to computer science is clearly demonstrated.

Product Details

• Paperback: 192 pages
• Publisher: Cambridge University Press; 1 edition (June 25, 2009)
• Language: English
• ISBN-10: 0521114292
• ISBN-13: 978-0521114295
• Product Dimensions: 9.4 x 6.7 x 0.7 inches
• Shipping Weight: 12.6 ounces (View shipping rates and policies)
• Average Customer Review: 4.0 out of 5 stars  See all reviews (1 customer review)
• Amazon Best Sellers Rank: #1,192,305 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

10 of 10 people found the following review helpful:

4.0 out of 5 stars Great introduction, but can feel dated, April 26, 2010

By 

Code Monkey - See all my reviews

This review is from: Lambda-calculus, Combinators and Functional Programming (Cambridge Tracts in Theoretical Computer Science) (Paperback)

This is an excellent and approachable introduction to the Lambda Calculus and its relevance to computer science. It introduces the calculus as a means of describing computer programs, and not merely as a mathematical construct. In the space of just over a eighty pages it develops the mathematical foundation for the calculus without the all too common cycle of theorem statements and proofs that can exhaust many readers. It also develops enough syntactic sugar for the calculus that the result should look familiar to any functional programmer. The remainder of the book defines the semantics of the calculus, and then shows how to implement these semantics on traditional computer systems (including shared memory multiprocessors) using graph reduction. Oh, and while at it, it also includes a proof of the Church Rosser theorem and an overview of the typed lambda calculus in appendices. That so much material is covered so succinctly, while remaining comprehensible, is what recommends this book.

Readers should remember that this book was published nearly a quarter century ago. Functional programming is now more widely accepted (consider Scala, Erlang, Haskell, F#, ML, and so on) and so this book often feels dated. Most noticeably the syntax chosen for lambda application requires far too many parenthesis. Apparently this was chosen to make predictive parsing easy, but I sorely missed the curried, left associative style for function application that is favored today. I also have to say, that with all due respect to John Backus and his Turing Award lecture, that the references to FP do feel like an anachronism. The extensive discussion of incremental garbage collection near the end of the book also seems out of place. Even the typeface and code formatting conventions hark back to an earlier age of computing (I'm not suggesting this is for the worse, rather that it is just different: imagine reading ALGOL-60 or MIX code today).

In the end though the dated feel of the text is a relatively minor annoyance. Readers just need to remember that all really good mathematics is timeless, even when it is expressed in programming terms that are not!