Lambda Calculus with Types (Hardcover, New)

This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and was treated in the first author's classic The Lambda Calculus (1984). The formalism has since been extended with types and used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), used in designing and verifying IT products and mathematical proofs. In this book, the authors focus on three classes of typing for lambda terms: simple types, recursive types and intersection types. It is in these three formalisms of terms and types that the unexpected mathematical beauty is revealed. The treatment is authoritative and comprehensive, complemented by an exhaustive bibliography, and numerous exercises are provided to deepen the readers' understanding and increase their confidence using types.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	Perspectives in Logic
Release date:	June 2013
First published:	July 2013
Authors:	Henk Barendregt • Wil Dekkers • Richard Statman
Dimensions:	244 x 170 x 44mm (L x W x T)
Format:	Hardcover
Pages:	856
Edition:	New
ISBN-13:	978-0-521-76614-2
Categories:	Books > Science & Mathematics > Mathematics > Mathematical foundations > Mathematical logic Promotions
LSN:	0-521-76614-1
Barcode:	9780521766142

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!