Principality and Type Inference for Intersection Types Using Expansion Variables (2003)
Cached
Download Links
- [www.church-project.org]
- [www.church-project.org]
- [www.church-project.org]
- [www.church-project.org]
- DBLP
Other Repositories/Bibliography
by
A. J. Kfoury
,
J. B. Wells
| Citations: | 24 - 12 self |
BibTeX
@MISC{Kfoury03principalityand,
author = {A. J. Kfoury and J. B. Wells},
title = {Principality and Type Inference for Intersection Types Using Expansion Variables},
year = {2003}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Principality of typings is the property that for each typable term, there is a typing from which all other typings are obtained via some set of operations. Type inference is the problem of finding a typing for a given term, if possible. We define an intersection type system which has principal typings and types exactly the strongly normalizable #-terms. More interestingly, every finite-rank restriction of this system (using Leivant's first notion of rank) has principal typings and also has decidable type inference.
