The Inhabitation Problem for Rank Two Intersection Types
<|reference_start|>The Inhabitation Problem for Rank Two Intersection Types: 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.<|reference_end|>
@article{kusmierek2007the,
    title={The Inhabitation Problem for Rank Two Intersection Types},
    author={Dariusz Kusmierek},
    journal={arXiv preprint arXiv:cs/0701029},
    year={2007},
    archivePrefix={arXiv},
    eprint={cs/0701029},
    primaryClass={cs.LO}
}