Lambda-Calculus and Combinators: An Introduction / Edition 2

ISBN-13:	9780521898850
Publisher:	Cambridge University Press
Publication date:	07/24/2008
Edition description:	New Edition
Pages:	358
Sales rank:	627,330
Product dimensions:	6.10(w) x 9.10(h) x 1.00(d)

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.