The complexity of inhabitation with explicit intersection

Authors:
Jakob Rehof;Paweł Urzyczyn
Affiliations:
Department of Computer Science, Technical University of Dortmund, Germany;Institute of Informatics, University of Warsaw, Poland
Venue:
Logic and Program Semantics
Year:
2012

Citing 12
Cited 0

Intersection types for combinatory logic

Theoretical Computer Science
Lambda calculi with types

Handbook of logic in computer science (vol. 2)
Alternation

Journal of the ACM (JACM)
Polymorphic type inference

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Inhabitation in Typed Lambda-Calculi (A Syntactic Approach)

TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
The simple semantics for Coppe-Dezani-Sallé types

Proceedings of the 5th Colloquium on International Symposium on Programming
Decidable Properties of Intersection Type Systems

TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Recognizability in the Simply Typed Lambda-Calculus

WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Inhabitation of Low-Rank Intersection Types

TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
The inhabitation problem for rank two intersection types

TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
The Logic of Persistent Intersection

Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
Finite combinatory logic with intersection types

TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.