论文信息 - The Inhabitation Problem for Rank Two Intersection Types

The Inhabitation Problem for Rank Two Intersection Types

We prove that the inhabitation problem for rank two intersection types is decidable, but (contrary to a common belief) EXPTIME-hard. The exponential time hardness is shown by reduction from the in-place acceptance problem for alternating Turing machines.

Dariusz Kusmierek

[1] Daniel Leivant,et al. Polymorphic type inference , 1983, POPL '83.

[2] Mariangiola Dezani-Ciancaglini,et al. Intersection types and lambda models , 2006, Theor. Comput. Sci..

[3] E. G. K. Lopez-Escobar,et al. Proof functional connectives , 1985 .

[4] Grigori Mints,et al. The Completeness of Provable Realizability , 1989, Notre Dame J. Formal Log..

[5] Pawel Urzyczyn. The Emptiness Problem for Intersection Types , 1999, J. Symb. Log..

[6] Richard Statman,et al. Intuitionistic Propositional Logic is Polynomial-Space Complete , 1979, Theor. Comput. Sci..

[7] Masako Takahashi,et al. Decidable Properties of Intersection Type Systems , 1995, TLCA.