Completeness of type assignment systems with intersection, union, and type quantifiers

This paper develops type assignment systems with intersection and union types, and type quantifiers. We show that the known system for these types is not semantically complete. However, the following two hold for a certain class of typing statements, called stable statements, which include all state...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science 2002-02, Vol.272 (1), p.341-398
1. Verfasser:	Yokouchi, Hirofumi
Format:	Artikel
Sprache:	eng
Schlagworte:	Cut-elimination Kripke models Lambda calculus Sequent calculus Type systems
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!