Computing Publications

Publications Home » Intersection Type Assignment Systems

Intersection Type Assignment Systems

Steffen van Bakel

Journal Article
Theoretical Computer Science
Volume 151
Issue 2
pp.385–435
November, 1995
Elsevier
DOI 10.1016/0304-3975(95)00073-6
Abstract

This paper gives an overview of intersection type assignment for the Lambda Calculus, as well as compare in detail variants that have been defined in the past. It presents the essential intersection type assignment system, that will prove to be as powerful as the well-known BCD-system. It is essential in the following sense: it is an almost syntax directed system that satisfies all major properties of the BCD-system, and the types used are the representatives of equivalence classes of types in the BCD-system. The set of typeable terms can be characterized in the same way, the system is complete with respect to the simple type semantics, and it has the principal type property.

BibTEX file for the publication
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.