Lambda calculus with types
by Barendregt, H. P., (Hendrik Pieter)
"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 …
Read More ↓Title Statements
- Full title :Lambda calculus with types / Henk Barendregt, Wil Dekkers, Richard Statman ; with contributions from Fabio Aless [and 10 others].
Summary
"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."--Publisher's website.
Read More ↓Edition Statements
- Publication Date:2013.
Publication Statements
- Publisher(s):Association for Symbolic Logic, Cambridge University Press
- Place of Publication:Cambridge, UK
- Language:eng
- Publication Date:2013.
The Physical Object
- Description:1 online resource (xxii, 833 pages) : : illustrations
Edition Identifiers
- ISBN:9781107273818, 1107273811, 1299772749, 9781299772748, 9781139032636, 1139032631, 9781107275041, 1107275040
- oclc:ocn857059436
- LC Classification:QA9.5
- Dewey Decimal:511.3
Table of Contents
Introduction -- Part 1. Simple types ; 1. The simply typed lambda calculus ; 2. Properties ; 3. Tools ; 4. Definability, unification and matching ; 5. Extensions ; 6. Applications -- Part II. Recursive types ; 7. The systems ; 8. Properties of recursive types ; 9. Properties of terms with types ; 10. Models ; 11. Applications -- Part III. Intersection Types ; 12. An exemplary system ; 13. Type assignment systems ; 14. Basic properties ; 15. Type and lambda structures ; 16. Filter models ; 17. Advanced properties and applications.
Read More ↓Subjects
Writers
More from this Series
No reviews yet. Be the first to rate this work.
Related Works
more →
Files & Downloads
-
Lambda Calculus with Types -- (.pdf)
PDF · 4.4 MB · updated
Rate & Review