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.
This handbook with exercises reveals the mathematical beauty of formalisms hitherto mostly used for software and hardware design and verification.
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.
'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
Ask a Question About this Product More... |