Inhabitation for Non-idempotent Intersection Types [article]

Antonio Bucciarelli and Delia Kesner and Simona Ronchi Della Rocca
2018 arXiv   pre-print
The inhabitation problem for intersection types in the lambda-calculus is known to be undecidable. We study the problem in the case of non-idempotent intersection, considering several type assignment systems, which characterize the solvable or the strongly normalizing lambda-terms. We prove the decidability of the inhabitation problem for all the systems considered, by providing sound and complete inhabitation algorithms for them.
arXiv:1712.03829v4 fatcat:bki7a4ktorgjpjzg4ytubzct3i