Henk Barendregt, Wil Dekkers, Richard StatmanCambridge University PressEdition: Illustrated, 6/20/2013EAN 9780521766142, ISBN10: 0521766141Hardcover, 856 pages, 24.4 x 17 x 4.3 cmLanguage: EnglishThis 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.List of contributorsPrefaceIntroductionPart I. Simple Types1. The simply typed lambda calculus2. Properties3. Tools4. Definability, unification and matching5. Extensions6. ApplicationsPart II. Recursive Types7. The systems8. Properties of recursive types9. Properties of terms with types10. Models11. ApplicationsPart III. Intersection Types12. An exemplary system13. Type assignment systems14. Basic properties15. Type and lambda structures16. Filter models17. Advanced properties and applicationsBibliographySymbol indexNames indexDefinitions index.'The book has a place in undergraduate libraries because of its uniquely comprehensive, if theoretical, treatment of a timely, widely important subject. Recommended.' D. V. Feldman, Choice 'The authors have produced a well-written, organised and comprehensive account of three important type systems. These systems' properties have been rich sources of interest to logicians for many years; their problems are not all solved, and in future work this book will almost certainly become a standard reference about them. It will also allow the more mathematically inclined computer scientist to obtain a deeper understanding of the principles behind some of the higher order languages in current use.' Bulletin of the London Mathematical Society
Related
Related