Skip to main content

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
Cancel
×
Home
Article
    • Aa
    • Aa
  • Cited by 5
  • Cited by
    Crossref Citations
    Crossref logo
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Bucciarelli, Antonio Kesner, Delia and Ventura, Daniel 2016. Strong Normalization through Intersection Types and Memory. Electronic Notes in Theoretical Computer Science, Vol. 323, p. 75.

    De Benedetti, Erika and Ronchi Della Rocca, Simona 2016. A type assignment for λ-calculus complete both for FPTIME and strong normalization. Information and Computation, Vol. 248, p. 195.

    Dezani-Ciancaglini, Mariangiola Ghilezan, Silvia Jakšić, Svetlana Pantović, Jovanka and Yoshida, Nobuko 2016. Theory and Practice of Formal Methods.

    PAOLINI, LUCA PICCOLO, MAURO and RONCHI DELLA ROCCA, SIMONA 2015. Essential and relational models. Mathematical Structures in Computer Science, p. 1.

    Rehof, Jakob and Urzyczyn, Paweł 2011. Typed Lambda Calculi and Applications.

    ×
  • Get access
    Add to cart $35.00
    Check if you have access via personal or institutional login
    Log in Register Recommend to librarian

The emptiness problem for intersection types

  • Paweł Urzyczyn (a1)
Abstract
Abstract

We study the intersection type assignment system as defined by Barendregt, Coppo and Dezani. For the four essential variants of the system (with and without a universal type and with and without subtyping) we show that the emptiness (inhabitation) problem is recursively unsolvable. That is, there is no effective algorithm to decide if there is a closed term of a given type. It follows that provability in the logic of “strong conjunction” of Mints and Lopez-Escobar is also undecidable.

Copyright
COPYRIGHT: © Association for Symbolic Logic 1999
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[4] M. Coppo and M. Dezani-Ciancaglini , An extension of basic functionality theory for lambda-calculus, Notre Dame Journal of Formal Logic, vol. 21 (1980), pp. 685–693.
[5] M. Coppo , M. Dezani-Ciancaglini , and B. Venneri , Functional character of solvable terms, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 27 (1981), pp. 45–58.
[7] G. Dowek , The undecidability of type assignment in the λII-calculus, Proceedings of Typed Lambda Calculi and Applications ( M. Bezem and J.F. Groote , editors), LNCS 664, Springer-Verlag, Berlin, 1993, pp. 139–145.
[8] D.M. Gabbay , Semantical Investigations in Heyting's Intuitionistic Logic, D. Reidel Publ. Co., 1981.
[10] J.R. Hindley , The principal type-scheme of an object in combinatory logic, Transactions of the American Mathematical Society, vol. 146 (1969), pp. 29–60.
[12] A.J. Kfoury and J. Tiuryn , Type reconstruction in finite-rank fragments of the second-order λ-calculus, Information and Computation, vol. 98 (1989), no. 2, pp. 228–257.
[14] T. Kurata and M. Takahashi , Decidable properties of intersection type systems, Proceedings of Typed Lambda Calculi and Applications ( M. Dezani-Ciancaglini and G. Plotkin , editors), LNCS 902, Springer-Verlag, Berlin, 1995, pp. 297–311.
[17] E.G.K. Lopez-Escobar , Proof Functional Connectives, Proceedings of Methods in Mathematical Logic, 1993, LNMath 1130, Springer-Verlag, Berlin, 1985, pp. 208–221.
[18] R. Milner , A theory of type polymorphism in programming, Journal of Computer and System Sciences, vol. 17 (1978), pp. 348–375.
[19] G.E. Mints , The completeness of provable readability, Notre Dame Journal of Formal Logic, vol. 30 (1989), pp. 420–441.
[21] R. Statman , Intuitionistic propositional logic is polynomial-space complete, Theoretical Computer Science, vol. 9 (1979), pp. 67–72.
[23] P. Urzyczyn , Type inhabitation in typed lambda calculi (a syntactic approach), Proceedings of Typed Lambda Calculi and Applications ( P. de Groote and J.R. Hindley , editors), LNCS 1210, Springer-Verlag, Berlin, 1997, pp. 373–389.
[24] P. Urzyczyn , Type reconstruction in Fomega;, Mathematical Structures in Computer Science, vol. 7 (1997), pp. 329–358, (Preliminary version in Proceedings of TLCA, 1993.).
[25] S. van Bakel , Intersection Type Disciplines in Lambda Calculus and Applicative Term Rewriting Systems, Mathematisch Centrum, Amsterdam, 1993.
[26] B. Venneri , Intersection types as logical formulae, Journal of Logic and Computation, vol. 4 (1994), no. 2, pp. 109–124.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *

CAPTCHA *

Skip to the audio challenge
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 3 *
Loading metrics...

Abstract views

Total abstract views: 73 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 20th August 2017. This data will be updated every 24 hours.

Cancel
Confirm
×