Skip to main content
SpringerLink
Log in

The simple semantics for Coppo-Dezani-Sallé types

  • Conference paper
  • First Online:
International Symposium on Programming (Programming 1982)

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

Included in the following conference series:

Abstract

The Coppo-Dezani-Sallé type-language has "∩" (intersection) and "∩" (universal type), besides the usual "→" (exponentiation). Coppo, Dezani and Sallé have presented formal rules for assigning types to type-free λ-terms, and have proved metatheorems which give their system significance and interest. (Sallé 1978, Coppo et al. 1981.)

But no precise semantics has been given for their system yet, though the authors have made it fairly obvious informally what semantics they intended.

The present paper defines a precise semantics in an arbitrary model of type-free λ-calculus. The rules of Coppo, Dezani and Sallé turn out to be incomplete with respect to this semantics, but they become complete when three extra rules (two trivial, one not) are added. The completeness proof uses the term-model only.

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

  • BARENDREGT, H. (1977): "The type-free λ-calculus", in "Handbook of Mathematical Logic", edited by J. Barwise, North-Holland Co., 1977.

    Google Scholar 

  • BARENDREGT, H., COPPO, M., DEZANI, M. (198-): "A filter lambda model and the completeness of type assignment", to appear, J. Symbolic Logic.

    Google Scholar 

  • COPPO, M., DEZANI, M. (1978): "A new type-assignment for λ-terms", Archiv. Math. Logik 19, pp.139–156 (1978).

    Google Scholar 

  • COPPO, M., DEZANI, M., VENNERI, B. (1980): "Principal type-schemes and λ-calculus semantics", in "To H.B. Curry", edited by J.P. Seldin and J.R. Hindley, Academic Press 1980.

    Google Scholar 

  • COPPO, M., DEZANI, M., VENNERI, B. (1981): "Functional characters of solvable terms", Z. Math. Logik 27, pp.45–58 (1981).

    Google Scholar 

  • HINDLEY, J.R. (1983): "The completeness theorem for typing λ-terms", to appear, Theoretical Computer Science 22 (1983).

    Google Scholar 

  • HINDLEY, J.R., LONGO, G. (1980): "Lambda-calculus models and extensionality", Z. Math. Logik 26, pp.289–310 (1980).

    Google Scholar 

  • POTTINGER, G. (1980): "A type assignment for the strongly normalizable λ-terms", in "To H.B. Curry", edited by J.P. Seldin and J.R. Hindley, Academic Press 1980.

    Google Scholar 

  • SALLÉ, P. (1978): "Une extension de la théorie des types", Lecture Notes in Computer Science 62, pp.398–410, Springer-Verlag 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University College of Swansea, Wales, U.K.

    J. R. Hindley

Authors
  1. J. R. Hindley
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mariangiola Dezani-Ciancaglini Ugo Montanari

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hindley, J.R. (1982). The simple semantics for Coppo-Dezani-Sallé types. In: Dezani-Ciancaglini, M., Montanari, U. (eds) International Symposium on Programming. Programming 1982. Lecture Notes in Computer Science, vol 137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11494-7_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-11494-7_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11494-9

  • Online ISBN: 978-3-540-39184-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation