Lambda-Calculus and Combinators: An Introduction
and over 360,000 other books are available for Amazon Kindle – Amazon’s new wireless reading device.
Learn more
| |||||||||||||||
Frequently Bought Together
Customers Who Bought This Item Also Bought
by Benjamin C. Pierce
|
by C Hankin
|
by Franklyn A. Turbak
|
by Peter Seibel
|
by Thomas H. Cormen
|
Editorial Reviews
Review
From reviews of the 1st 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
'The best general book on lambda-calculus (typed or untyped) and the theory of combinators.' Gérard Huet, INRIA
'The best general book on lambda-calculus (typed or untyped) and the theory of combinators.' Gérard Huet, INRIA
Product Description
Combinatory logic and lambda-calculus, originally devised in the 1920's, 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 long-awaited new version is thoroughly revised and offers a fully up-to-date 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.
Product Details
Would you like to update product info or give feedback on images?
|
Inside This Book
(learn more)
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
proper type function, typable iff, typed analogues, weak normal form, provable equations, combinatory completeness, discharged assumption, applicative structure, combinatory algebra, weak equality, constant function whose value, dependent function type, weak reduction, typed terms, extensional equality, principal axiom, infinite reduction, atomic constants, extensional equalities, given deduction, parametric types, extensionality axioms, pure terms, combinatory logic, atomic type Key Phrases - Capitalized Phrases (CAPs): (learn more)
Proof Straightforward, Proof First, Proof Let, Dana Scott, The A-calculus, Proof See Appendix, Gordon Plotkin, Henk Barendregt, Typed A-calculus Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
proper type function, typable iff, typed analogues, weak normal form, provable equations, combinatory completeness, discharged assumption, applicative structure, combinatory algebra, weak equality, constant function whose value, dependent function type, weak reduction, typed terms, extensional equality, principal axiom, infinite reduction, atomic constants, extensional equalities, given deduction, parametric types, extensionality axioms, pure terms, combinatory logic, atomic type Key Phrases - Capitalized Phrases (CAPs): (learn more)
Proof Straightforward, Proof First, Proof Let, Dana Scott, The A-calculus, Proof See Appendix, Gordon Plotkin, Henk Barendregt, Typed A-calculus Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
What Do Customers Ultimately Buy After Viewing This Item?
 |
75% buy the item featured on this page: Lambda-Calculus and Combinators: An Introduction$50.40 |
 |
8% buy The Haskell Road to Logic, Maths and Programming (Texts in Computing) $22.50 |
 |
6% buy Let Over Lambda $35.95 |
 |
6% buy Design Concepts in Programming Languages $50.62 |
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
 |
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Listmania!
So You'd Like to...
|
|
Product Information from the Amapedia Community
Beta (What's this?)Be the first person to add an article about this item at Amapedia.com.
› See featured Amapedia.com articles
Look for Similar Items by Category
Look for Similar Items by Subject
Your Recent History
(What's this?)|
After viewing product detail pages or search results, look here to find an easy way to navigate back to pages you are interested in. |
