## A Complete Characterization of Complete Intersection-Type Theories (Extended Abstract) (2000)

### Cached

### Download Links

- [www.di.unito.it]
- [www.macs.hw.ac.uk]
- [arxiv.org]
- [www.di.unito.it]
- [www.di.unito.it]
- [www.di.unito.it]
- DBLP

### Other Repositories/Bibliography

Venue: | ACM TOCL |

Citations: | 12 - 5 self |

### BibTeX

@ARTICLE{Dezani-ciancaglini00acomplete,

author = {M. Dezani-ciancaglini and F. Honsell and F. Alessi},

title = {A Complete Characterization of Complete Intersection-Type Theories (Extended Abstract)},

journal = {ACM TOCL},

year = {2000},

volume = {4},

pages = {2003}

}

### OpenURL

### Abstract

M. DEZANI-CIANCAGLINI Universita di Torino, Italy F. HONSELL Universita di Udine, Italy F. ALESSI Universita di Udine, Italy Abstract We characterize those intersection-type theories which yield complete intersection-type assignment systems for l-calculi, with respect to the three canonical set-theoretical semantics for intersection-types: the inference semantics, the simple semantics and the F-semantics. Keywords Lambda Calculus, Intersection Types, Semantic Completeness, Filter Structures. 1 Introduction Intersection-types disciplines originated in [6] to overcome the limitations of Curry 's type assignment system and to provide a characterization of strongly normalizing terms of the l-calculus. But very early on, the issue of completeness became crucial. Intersection-type theories and filter l-models have been introduced, in [5], precisely to achieve the completeness for the type assignment system l" BCD W , with respect to Scott's simple semantics. And this result, ...