Lambda-Calculus and Combinators - An Introduction (Hardcover, 2nd Revised edition)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Release date:	July 2008
First published:	July 2008
Authors:	J. Roger Hindley • Jonathan P. Seldin
Dimensions:	235 x 156 x 23mm (L x W x T)
Format:	Hardcover
Pages:	345
Edition:	2nd Revised edition
ISBN-13:	978-0-521-89885-0
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Science & Mathematics > Mathematics > Mathematical foundations > Mathematical logic Promotions
LSN:	0-521-89885-4
Barcode:	9780521898850

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!