The Inhabitation Problem for Rank Two Intersection Types
Logic in Computer Science
2007-05-23 v1
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.
Keywords
Cite
@article{arxiv.cs/0701029,
title = {The Inhabitation Problem for Rank Two Intersection Types},
author = {Dariusz Kusmierek},
journal= {arXiv preprint arXiv:cs/0701029},
year = {2007}
}
Comments
15 pages