Abstract
The 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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics, revised edn. North-Holland, Amsterdam (1984)
Ben-Yelles, C.: Type-assignment in the lambda-calculus; syntax and semantics. PhD thesis, University of Wales Swansea (1979)
Bernadet, A., Lengrand, S.: Non-idempotent intersection types and strong normalisation. Logical Methods in Computer Science 9(4) (2013)
Bunder, M.W.: The inhabitation problem for intersection types. In: CATS. CRPIT, vol. 77, pp. 7–14. Australian Computer Society (2008)
Carvalho, D.D.: Sèmantique de la logique linéaire et temps de calcul. PhD thesis, Université de la Mediterranée Aix-Marseille 2 (2007)
Coppo, M., Dezani-Ciancaglini, M.: An extension of the basic functionality theory for the λ-calculus. Notre Dame J. Form. Log. 21(4), 685–693 (1980)
De Benedetti, E., Ronchi Della Rocca, S.: Bounding normalization time through intersection types. In: Proc. of ITRS 2012. EPTCS, pp. 48–57 (2013)
Di Gianantonio, P., Honsell, F., Lenisa, M.: A type assignment system for game semantics. Theor. Comput. Sci. 398, 150–169 (2008)
Ehrhard, T.: The Scott model of linear logic is the extensional collapse of its relational model. Theor. Comput. Sci. 424, 20–45 (2012)
Hindley, J.R.: Basic Simple Type Theory. Cambridge Tracts in Theoretical Comp. Scie. Cambridge University Press, Amsterdam (2008)
Jay, C.B., Kesner, D.: First-class patterns. Journal of Functional Programming 19(2), 191–225 (2009)
Kesner, D., Ventura, D.: Quantitative types for the linear substitution calculus. In: Diaz, J., Lanese, I., Sangiorgi, D. (eds.) TCS 2014. LNCS, vol. 8705, pp. 296–310. Springer, Heidelberg (2014)
Kfoury, A.J.: A Linearization of the Lambda-Calculus and Consequences. J. Logic Comp. 10(3), 411–436 (2000)
Kfoury, A.J., Wells, J.B.: Principality and type inference for intersection types using expansion variables. Theor. Comput. Sci. 311(1-3), 1–70 (2004)
Krivine, J.L.: Lambda-Calculus, Types and Models. Ellis Horwood, Hemel Hempstead, Masson, Paris (1993)
Kurata, T., Takahashi, M.: Decidable properties of intersection type systems. In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol. 902, pp. 297–311. Springer, Heidelberg (1995)
Mairson, H., Neergaard, P.M.: Types, potency, and idempotency: why nonlinearity and amnesia make a type system work. In: Proc. of ICFP 2004, pp. 138–149 (2004)
Pagani, M., Ronchi Della Rocca, S.: Linearity, non-determinism and solvability. Fundamenta Informaticae 103, 358–373 (2010)
Pagani, M., della Rocca, S.R.: Solvability in resource lambda-calculus. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 358–373. Springer, Heidelberg (2010)
Paolini, L., Piccolo, M., Ronchi Della Rocca, S.: Logical relational lambda-models. Accepted for publication in MSCS (2013)
Urzyczyn, P.: The emptiness problem for intersection types. Journal of Symbolic Logic 64(3), 1195–1215 (1999)
Urzyczyn, P.: personal communication (2014)
van Bakel, S.: Complete restrictions of the intersection type discipline. Theor. Comput. Sci. 102, 135–163 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 IFIP International Federation for Information Processing
About this paper
Cite this paper
Bucciarelli, A., Kesner, D., Ronchi Della Rocca, S. (2014). The Inhabitation Problem for Non-idempotent Intersection Types. In: Diaz, J., Lanese, I., Sangiorgi, D. (eds) Theoretical Computer Science. TCS 2014. Lecture Notes in Computer Science, vol 8705. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44602-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-662-44602-7_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44601-0
Online ISBN: 978-3-662-44602-7
eBook Packages: Computer ScienceComputer Science (R0)