Computing Publications

Publications Home » Principal type schemes for the St...

Principal type schemes for the Strict Type Assignment System

Steffen van Bakel

Journal Article
Journal of Logic and Computation
Volume 3
Issue 6
December, 1993
Oxford University Press
DOI 10.1093/logcom/3.6.643

We study the strict type assignment system, a restriction of the intersection type discipline, and prove that it has the principal type property. We define, for a term M, the principal pair (of basis and type). We specify three operations on pairs, and prove that all pairs deducible for M can be obtained from the principal one by these operations, and that these map deducible pairs to deducible pairs.

PDF of full publication (238 kilobytes)
(need help viewing PDF files?)
BibTEX file for the publication
Conditions for downloading publications from this site. built & maintained by Ashok Argent-Katwala.