Lambda calculus with types / Henk Barendregt, Wil Dekkers and Richard Statman,
Material type:
- 9780521766142 (cloth)
- 511.35 23 B248
Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|
Books | ISI Library, Kolkata | 511.35 B248 (Browse shelf(Opens below)) | Available | 135387 |
"Association for Symbolic Logic."
Includes bibliographical references (pages 791-813) and index.
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 example system --
13. Type assignment systems --
14. Basic properties of intersection type assignment --
15. Type and lambda structures --
16. Filter models --
17. Advanced properties and applications--
References--
Indices--
"This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. ... In this book, the authors focus on three classes of typing for lambda terms: simple types, recursive types and intersection types. ... 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."--Page 4 of cover.
There are no comments on this title.