Complete restrictions of the intersection type discipline (1992)
Cached
Download Links
- [www.doc.ic.ac.uk]
- [ftp.cs.kun.nl]
- [schiele.doc.ic.ac.uk]
- DBLP
Other Repositories/Bibliography
| Venue: | Theoretical Computer Science |
| Citations: | 90 - 33 self |
BibTeX
@ARTICLE{Bakel92completerestrictions,
author = {Steffen Van Bakel},
title = {Complete restrictions of the intersection type discipline},
journal = {Theoretical Computer Science},
year = {1992},
volume = {102},
pages = {135--163}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper the intersection type discipline as defined in [Barendregt et al. ’83] is studied. We will present two different and independent complete restrictions of the intersection type discipline. The first restricted system, the strict type assignment system, is presented in section two. Its major feature is the absence of the derivation rule (≤) and it is based on a set of strict types. We will show that these together give rise to a strict filter lambda model that is essentially different from the one presented in [Barendregt et al. ’83]. We will show that the strict type assignment system is the nucleus of the full system, i.e. for every derivation in the intersection type discipline there is a derivation in which (≤) is used only at the very end. Finally we will prove that strict type assignment is complete for inference semantics. The second restricted system is presented in section three. Its major feature is the absence of the type ω. We will show that this system gives rise to a filter λI-model and that type assignment without ω is complete for the λI-calculus. Finally we will prove that a lambda term is typeable in this system if and only if it is strongly normalizable.
