paper

The Inhabitation Problem for Rank Two Intersection Types

arXiv:cs/0701029

Abstract

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

15 pages

The Inhabitation Problem for Rank Two Intersection Types · wovepaper