Principal type schemes for the strict type assignment system (1993)
Cached
Download Links
- [www.doc.ic.ac.uk]
- [ftp.cs.kun.nl]
- [www.st.cs.ru.nl]
- [schiele.doc.ic.ac.uk]
- [www.doc.ic.ac.uk]
- DBLP
Other Repositories/Bibliography
by
Steffen Van Bakel
| Venue: | Logic and Computation |
| Citations: | 32 - 18 self |
BibTeX
@ARTICLE{Bakel93principaltype,
author = {Steffen Van Bakel},
title = {Principal type schemes for the strict type assignment system},
journal = {Logic and Computation},
year = {1993},
volume = {3},
pages = {643--670}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We study the strict type assignment system, a restriction of the intersection type discipline [6], and prove that it has the principal type property. We define, for a term, the principal pair (of basis and type). We specify three operations on pairs, and prove that all pairs deducible for can be obtained from the principal one by these operations, and that these map deducible pairs to deducible pairs.
