Lambda-Calculus and Combinators
An Introduction
2nd Edition
- Authors:
- J. Roger Hindley, University of Wales, Swansea
- Jonathan P. Seldin, University of Lethbridge, Alberta
- Date Published: August 2008
- availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
- format: Adobe eBook Reader
- isbn: 9780511410963
Find out more about Cambridge eBooks
Adobe eBook Reader
Other available formats:
Hardback
Looking for an inspection copy?
This title is not currently available on inspection
-
Combinatory logic and lambda-calculus, originally devised in the 1920s, have since developed into linguistic tools, especially useful in programming languages. The authors' previous book served as the main reference for introductory courses on lambda-calculus for over 20 years: this version is thoroughly revised and offers an account of the subject with the same authoritative exposition. The grammar and basic properties of both combinatory logic and lambda-calculus are discussed, followed by an introduction to type-theory. Typed and untyped versions of the systems, and their differences, are covered. Lambda-calculus models, which lie behind much of the semantics of programming languages, are also explained in depth. The treatment is as non-technical as possible, with the main ideas emphasized and illustrated by examples. Many exercises are included, from routine to advanced, with solutions to most at the end of the book.
Read more- The authors' 1986 version of this book is widely recognised as the best introduction to these topics for the reader with some previous experience of logic; this version builds and updates that framework
- Accessible and clear: a non-technical treatment of the subject with the main ideas emphasized and illustrated by examples
- Exercises are designed to give practice to beginners and range from elementary to advanced, with solutions to most found at the end of the book
Reviews & endorsements
From reviews of the first edition: 'The book of R. Hindley and J. Seldin is a very good introduction to fundamental techniques and results in these fields ... the book is clear, pleasant to read, and it needs no previous knowledge in the domain, but only basic notions of mathematical logic ... Clearly, it was impossible to treat everything in detail; but even when a subject is only skimmed, the book always provides an incentive for going deeper, and furnishes the means to do it, owing to a substantial bibliography. Several chapters end with interesting and useful notes with history, comments, and indications for further reading ... In conclusion, this book is very interesting and well written, and is highly recommended to everyone who wants to approach combinatory logic and lambda-calculus (logicians or computer scientists). J. Symbolic Logic
See more reviews'The best general book on lambda-calculus (typed or untyped) and the theory of combinators.' Gérard Huet, INRIA
'… for teaching and for research or self-study the book is an outstanding source with its own clear merits. I think this second edition of this classical book is a beautiful asset for the literature on λ-calculus and CL.' Theory and Practice of Logic Programming
'… well written and offers a broad coverage backed by an extensive list of references. It could serve as an excellent study material for classes on λ-calculus and CL as well as a reference for logicians and computer scientists interested in the formal background for functional programming and related areas.' EMS Newsletter
'Without doubt this is a valuable treatment of a venerable topic that rewards those who understand it. The authors successfully promulgate their tradition, and that is certainly more important than providing full proofs for every result.' The Journal of JFP
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Edition: 2nd Edition
- Date Published: August 2008
- format: Adobe eBook Reader
- isbn: 9780511410963
- contains: 10 b/w illus. 1 table 55 exercises
- availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
Table of Contents
Preface
1. The λ-calculus
2. Combinatory logic
3. The power of λ and CL
4. Computable functions
5. Undecidability
6. Formal theories
7. Extensionality in λ-calculus
8. Extensionality in CL
9. Correspondence between λ and CL
10. Simple typing, Church-style
11. Simple typing, Curry-style in CL
12. Simple typing, Curry-style in λ
13. Generalizations of typing
14. Models of CL
15. Models of λ
16. Scott's D∞ and other models
Appendix 1. α-conversion
Appendix 2. Confluence proofs
Appendix 3. Normalization proofs
Appendix 4. Care of your pet combinator
Appendix 5. Answers to starred exercises
Bibliography
Index.-
General Resources
Find resources associated with this title
Type Name Unlocked * Format Size Showing of
This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to lecturers whose faculty status has been verified. To gain access to locked resources, lecturers should sign in to or register for a Cambridge user account.
Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other lecturers may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.
Supplementary resources are subject to copyright. Lecturers are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.
If you are having problems accessing these resources please contact [email protected].
Instructors have used or reviewed this title for the following courses
- Functionnal Programming
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]
Register Sign in» Proceed
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 ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×