Book contents
- Frontmatter
- Contents
- Preface
- Acknowledgments
- Contributors
- Our Founders
- Introduction
- Part I Simple Types λA→
- 1 The Simply Typed Lambda Calculus
- 2 Properties
- 3 Tools
- 4 Definability, unification and matching
- 5 Extensions
- 6 Applications
- Part II Recursive Types λA=
- Part III Intersection Types λS∩
- References
- Indices
2 - Properties
from Part I - Simple Types λA→
Published online by Cambridge University Press: 05 August 2013
- Frontmatter
- Contents
- Preface
- Acknowledgments
- Contributors
- Our Founders
- Introduction
- Part I Simple Types λA→
- 1 The Simply Typed Lambda Calculus
- 2 Properties
- 3 Tools
- 4 Definability, unification and matching
- 5 Extensions
- 6 Applications
- Part II Recursive Types λA=
- Part III Intersection Types λS∩
- References
- Indices
Summary

- Type
- Chapter
- Information
- Lambda Calculus with Types , pp. 55 - 93Publisher: Cambridge University PressPrint publication year: 2013