Skip to main content
Conference Proceedings

Inhabitation of low-rank intersection types

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5608 LNCS 356-370
DOI: 10.1007/978-3-642-02273-9_26
18Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We prove that the inhabitation problem ("Does there exist a closed term of a given type?") is undecidable for intersection types of rank 3 and exponential space complete for intersection types of rank 2. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Urzyczyn, P. (2009). Inhabitation of low-rank intersection types. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5608 LNCS, pp. 356–370). https://doi.org/10.1007/978-3-642-02273-9_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free