2012 | OriginalPaper | Chapter
The Complexity of Inhabitation with Explicit Intersection
Authors : Jakob Rehof, Paweł Urzyczyn
Published in: Logic and Program Semantics
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
It is shown that the inhabitation problem for intersection types without the intersection introduction rule is
Expspace
-complete and that the further restriction without subtyping is
Pspace
-complete.