The Inhabitation Problem for Rank Two Intersection Types
From MaRDI portal
Publication:3612635
DOI10.1007/978-3-540-73228-0_18zbMath1215.03025arXivcs/0701029OpenAlexW1550462199MaRDI QIDQ3612635
Publication date: 10 March 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0701029
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Turing machines and related notions (03D10) Combinatory logic and lambda calculus (03B40)
Related Items (5)
Finite Combinatory Logic with Intersection Types ⋮ Unnamed Item ⋮ On the Mints Hierarchy in First-Order Intuitionistic Logic ⋮ Inhabitation of Low-Rank Intersection Types ⋮ Pre-grammars and inhabitation for a subset of rank 2 intersection types
This page was built for publication: The Inhabitation Problem for Rank Two Intersection Types