Title :
The emptiness problem for intersection types
Author_Institution :
Inst. of Inf., Warsaw Univ., Poland
Abstract :
We prove that it is undecidable whether a given intersection type is non-empty, i.e., whether there exists a closed term of this type
Keywords :
decidability; formal logic; lambda calculus; type theory; closed term; emptiness problem; intersection types; Automata; Calculus; Informatics; Logic;
Conference_Titel :
Logic in Computer Science, 1994. LICS '94. Proceedings., Symposium on
Conference_Location :
Paris
Print_ISBN :
0-8186-6310-3
DOI :
10.1109/LICS.1994.316059
