Home » Nonfiction » Henk Barendregt » Lambda Calculus with Types

January 15 , 2010

Lambda Calculus with Types


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.

How to download book

Buy this book

You can buy this book now only for $59.09. This is the lowest price for this book.

Buy book

Download book free

If you want to download this book for free, please register, approve your account and get one book for free.


After that you may download book «Lambda Calculus with Types»:

Download Sony BookReader:


Download Adobe DRM: