Lambda Calculus with Types

Lambda Calculus with Types

4.66 (3 ratings by Goodreads)
By (author)  , By (author)  , By (author) 

List price: US$125.00

Currently unavailable

We can notify you when this item is back in stock

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks

Description

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.show more

Product details

  • Online resource
  • Cambridge University Press (Virtual Publishing)
  • Cambridge, United Kingdom
  • English
  • 52 b/w illus. 300 exercises
  • 1139032631
  • 9781139032636

Review quote

'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 Societyshow more

About Henk Barendregt

Henk Barendregt holds the chair on the Foundations of Mathematics and Computer Science at Radboud University, Nijmegen, The Netherlands. Wil Dekkers is an Associate Professor in the Institute of Information and Computing Sciences at Radboud University, Nijmegen, The Netherlands. Richard Statman is a Professor of Mathematics at Carnegie Mellon University, Pittsburgh, USA.show more

Table of 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.show more

Rating details

3 ratings
4.66 out of 5 stars
5 67% (2)
4 33% (1)
3 0% (0)
2 0% (0)
1 0% (0)
Book ratings by Goodreads
Goodreads is the world's largest site for readers with over 50 million reviews. We're featuring millions of their reader ratings on our book pages to help you find your new favourite book. Close X