Book contents
- Frontmatter
- Contents
- Preface
- Acknowledgments
- Contributors
- Our Founders
- Introduction
- Part I Simple Types λA→
- Part II Recursive Types λA=
- Part III Intersection Types λS∩
- 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
13 - Type Assignment Systems
from Part III - Intersection Types λS∩
Published online by Cambridge University Press: 05 August 2013
Book contents
- Frontmatter
- Contents
- Preface
- Acknowledgments
- Contributors
- Our Founders
- Introduction
- Part I Simple Types λA→
- Part II Recursive Types λA=
- Part III Intersection Types λS∩
- 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
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Lambda Calculus with Types , pp. 591 - 618Publisher: Cambridge University PressPrint publication year: 2013