Other available formats:
Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact firstname.lastname@example.org providing details of the course you are teaching.
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.
Be the first to review this book
- Date Published: June 2009
- format: Paperback
- isbn: 9780521114295
- length: 192 pages
- dimensions: 244 x 170 x 10 mm
- weight: 0.32kg
- availability: Manufactured on demand: supplied direct from the printer
Table of Contents
2. Type-free lambda-calculus
3. Combinators and constant symbols
4. List manipulation in lambda-calculus
5. Rule-based semantics of λ-expressions
6. Outlines of a reduction machine
7. Towards a parallel graph-reduction
Appendix A: A proof of the Church-Rosser theorem
Appendix B: Introduction to typed λ-calculus
You are now leaving the Cambridge University Press website, your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×