Skip to main content
SpringerLink
Log in

Decidable properties of intersection type systems

  • Conference paper
  • First Online:
Typed Lambda Calculi and Applications (TLCA 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 902))

Included in the following conference series:

Abstract

We give positive answers to the following decision problems for the intersection type system λΛ and its variations; (1) the type checking problem of normalizing terms for λΛ, (2) the inhabitation problem for the system λΛ without (ΛI)-rule, and (3) the same problem for a typed counterpart of λΛ (or the intersection type system à la Church). Our result (1) contrasts with the well-known negative answer to the type checking problem (of all terms) for λΛ, while (2) and (3) contrast with Urzyczyn's negative answer to the inhabitation problem for λΛ.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H.P. Barendregt, Lambda calculi with types, in: Handbook of Logic in Computer Science vol.II, ed. S. Abramsky et al., Oxford University Press, 1992.

    Google Scholar 

  2. H.P. Barendregt, M. Coppo and M. Dezani-Ciancaglini, A filter lambda model and the completeness of type assignment, J. Symbolic Logic 48 (1983), pp. 931–940.

    Google Scholar 

  3. F. Cardonne and M. Coppo, Two extensions of Curry's type inference system, in: Logic and Computer Science ed. P. Odifreddi, Academin Press, pp.19–75, 1990.

    Google Scholar 

  4. M. Dezani-Ciancaglini and I. Margaria, A characterisation of F-complete type assignments, Theoretical Computer Science 45 (1986), pp. 121–157.

    Article  Google Scholar 

  5. J.R. Hindley, The simple semantics for Coppo-Dezani-Sallé types, Lecture Notes in Computer Science 137 (1982), pp. 212–226.

    Google Scholar 

  6. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.

    Google Scholar 

  7. J.C. Reynolds, Preliminary design of the Programming Language For-sythe, Report CMU-CS-88-159, Carnegie-Mellon University, 1988.

    Google Scholar 

  8. M. Takahashi, Y. Akama and S. Hirokawa, Normal proofs and their grammar, Lecture Notes in Computer Science 789 (1994), pp. 465–493.

    Google Scholar 

  9. P. Urzyczyn, The emptiness problem for intersection types, Proceedings of Logic in Computer Science, IEEE, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of mathematical and computing sciences, Tokyo institute of technology, Japan

    Toshihiko Kurata & Masako Takahashi

Authors
  1. Toshihiko Kurata
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Masako Takahashi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mariangiola Dezani-Ciancaglini Gordon Plotkin

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kurata, T., Takahashi, M. (1995). Decidable properties of intersection type systems. In: Dezani-Ciancaglini, M., Plotkin, G. (eds) Typed Lambda Calculi and Applications. TLCA 1995. Lecture Notes in Computer Science, vol 902. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014060

Download citation

  • DOI: https://doi.org/10.1007/BFb0014060

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59048-4

  • Online ISBN: 978-3-540-49178-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation