Lambda Calculus with Types
 Responsibility
 Henk Barendregt, Wil Dekkers, Richard Statman ; with contributions from Fabio Alessi ... [et al.].
 Language
 English.
 Publication
 Cambridge : Cambridge University Press, 2013.
 Physical description
 xxii, 833 pages : ill. ; 26 cm.
 Series
 Perspectives in logic.
Access
Available online
Math & Statistics Library
Stacks
Call number  Status 

QA9.6 .B37 2013  Unknown 
More options
Creators/Contributors
 Author/Creator
 Barendregt, Henk.
 Contributor
 Dekkers, Wil.
 Statman, Richard.
Contents/Summary
 Bibliography
 Includes bibliographical references (pages 791813) and indexes.
 Contents

 List of contributors Preface Introduction Part I. 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 Bibliography Symbol index Names index Definitions index.
 (source: Nielsen Book Data)9780521766142 20160612
 Publisher's 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.
(source: Nielsen Book Data)9780521766142 20160612
Subjects
 Subject
 Lambda calculus.
Bibliographic information
 Publication date
 2013
 Series
 Perspectives in Logic
 ISBN
 9780521766142 (cloth)
 0521766141 (cloth)