Skip to main content
SpringerLink
Log in

On the semantics of polymorphism

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

A semantic characterization is given of the terms of a simple applicative language which it can be assigned a (monomorphic or polymorphic) type. Moreover a strong completeness result is proved for a (nontrivial) subset of terms (corresponding to the normal forms of a lambda-calculus plus constants). Completeness does not hold in general.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Barendregt, H.: The lambda-calculus: its syntax and semantics. Amsterdam: North-Holland 1981

    Google Scholar 

  2. Barendregt, H., Coppo, M, Dezani-Ciancaglini, M.: A filter lambda model and the completeness of type assignment. (to appear in J. Symbolic Logic)

  3. Ben-Yelles, C.: Type assignment in the lambda-calculus: syntax and semantics. P.h.D. Thesis, University of Wales, Swansea, September 1979

    Google Scholar 

  4. Coppo, M.: An extended polymorphic type system for applicative languages. Proceedings of MFCS '80, Lecture Notes in Computer Science, Vol. 88, pp. 194–204. Berlin, Heidelberg, New York: Springer 1980

    Google Scholar 

  5. Curry, H.B., Feys, R.: Combinatory Logic I. Amsterdam: North-Holland 1958

    Google Scholar 

  6. Curry, H.B.: Modified basic functionality in Combinatory Logic. Dialectica 23, 83–92 (1969)

    Google Scholar 

  7. Damas, L., Milner, R.: Principal type schemes for functional programs. Proceedings of ninth ACM Symposium on Principles of Programming Languages, Albuquerque, N.M. 1982

  8. Donahue, J.: On the semantics of Data Types. SIAM J. Comput. 8, 546–560 (1979)

    Google Scholar 

  9. Gordon, M.J., Milner, A.J., Wadsworth, C.P.: Edinburgh LCF. Lecture Notes in Computer Science, Vol. 78. Berlin, Heidelberg, New York: Springer 1979

    Google Scholar 

  10. Hindley, J.R.: The principal type schema of an object in Combinatory Logic. Trans. Am. Math. Soc. 146, 22–60 (1969)

    Google Scholar 

  11. Hindley, J.R.: The completeness theorem for typing lambda-terms. Theor. Comput. Sci. 23, 1–17 (1983)

    Google Scholar 

  12. Hindley, J.R., Lercher, B., Seldin, J.P.: Introduction to Combinatory Logic. Cambridge: University Press 1972

    Google Scholar 

  13. Milner, R.: A theory of type polymorphism in programming. J. Comput. System Sci. 17, 348–375 (1978)

    Google Scholar 

  14. Plotkin, G.: LCF considered as a programming language. Theor. Comput. Sci. 5, 522–537 (1977)

    Google Scholar 

  15. Plotkin, G.: 170-01 as a universal domain. J. Comput. System Sci. 17, 209–236 (1978)

    Google Scholar 

  16. Stoy, J.: Denotational Semantics. Cambridge (MA), London: MIT Press 1977

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. I.S.I., Corso M. D'Azeglio, 42, I-10125, Torino, Italy

    Mario Coppo

Authors
  1. Mario Coppo
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported by M.P.I. (comitato per la Matematica, fondi 40%)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Coppo, M. On the semantics of polymorphism. Acta Informatica 20, 159–170 (1983). https://doi.org/10.1007/BF00289413

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation