Inhabitation of Low-Rank Intersection Types

Authors:
Paweł Urzyczyn
Affiliations:
Institute of Informatics, University of Warsaw,
Venue:
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Year:
2009

Citing 14
Cited 3

Embedding a second-order type system into an intersection type system

Information and Computation
Automata and Computability

Automata and Computability
Polymorphic type inference

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Branching Types

ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Intersection Logic

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Decidable Properties of Intersection Type Systems

TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Principality and type inference for intersection types using expansion variables

Theoretical Computer Science
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work

Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Theory of Computation (Texts in Computer Science)

Theory of Computation (Texts in Computer Science)
Intersection types and lambda models

Theoretical Computer Science - Logic, language, information and computation
Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics)

Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics)
Intersection-types à la Church

Information and Computation
The inhabitation problem for intersection types

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
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
The complexity of inhabitation with explicit intersection

Logic and Program Semantics

Quantified Score

Hi-index	0.00

Visualization

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.