Skip to main content
Article thumbnail
Location of Repository

The Inhabitation Problem for Non-idempotent Intersection Types

By Antonio Bucciarelli, Delia Kesner and Simona Ronchi Della Rocca


Part 2: Track B: Logic, Semantics, Specification and VerificationInternational audienceThe inhabitation problem for intersection types is known to be undecidable. We study the problem in the case of non-idempotent intersection, and we prove decidability through a sound and complete algorithm. We then consider the inhabitation problem for an extended system typing the λ-calculus with pairs, and we prove the decidability in this case too. The extended system is interesting in its own, since it allows to characterize solvable terms in the λ-calculus with pairs

Topics: [ INFO ] Computer Science [cs]
Publisher: Springer
Year: 2014
DOI identifier: 10.1007/978-3-662-44602-7_26
OAI identifier: oai:HAL:hal-01402082v1
Provided by: Hal-Diderot
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • (external link)
  • (external link)
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.