二阶交型的居住问题
The Inhabitation Problem for Rank Two Intersection Types
摘要：
我们证明了居住问题的秩2相交类型是可判定的，但（与通常的信念相反）EXPTIME困难。指数时间硬度是从交替图灵机的就地验收问题的减少。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
