Skip to main content
SpringerLink
Log in

Completeness results for a polymorphic type system

  • Contributed Papers
  • Conference paper
  • First Online:
Book cover CAAP'83 (CAAP 1983)

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

Included in the following conference series:

Abstract

An interesting notion of polymorphism is the one introduced in the language ML (/GMW/). Its soundness has been proved in /MIL/ for a subset of ML based on λ-calculus plus constants. A partial completeness result for the same language has been given in /COP/. The aim of this paper is to extend the above results to a language including also Cartesian product and disjoint sum. The extension is not trivial, owing to difficulties introduced mainly by disjoint sum. Moreover a semantic characterization of typed terms is given.

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. C. Ben-Yelles, Type Assignment in the Lambda-Calculus: Syntax and Semantics, Ph.D. Thesis, University of Wales, Swansea, 1979.

    Google Scholar 

  2. M. Coppo, On the semantics of Polymorphism, Internal Report of I.S.I., University of Turin, 1982 (to appear in Acta Informatica).

    Google Scholar 

  3. L. Damas and R. Milner, Principal Type-Schemes for Functional Programs, Proc. 9th ACM Symposium on Principles of Programming Languages, Albuquerque, 1982.

    Google Scholar 

  4. M.J. Gordon, A. J. Milner and C.P. Wadsworth, Edinburgh LCF, LNCS 78, Springer-Verlag, 1979.

    Google Scholar 

  5. R. Milner, A Theory of Type Polymorphism in Programming, J. Comput. Sys. Sci. 17 (1978), 348–375.

    Article  Google Scholar 

  6. G. Plotkin, Tω as a Universal Domain, J. Comput. Sys. Sci. 17 (1978), 209–236.

    Article  Google Scholar 

  7. J. Stoy, Denotational Semantics, MIT Press, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. I.S.I. — Università di Torino, c. M. D'Azeglio, 42, Torino

    M. Coppo

  2. CSELT, v. G. Reiss Romoli, 274, Torino

    E. Giovannetti

Authors
  1. M. Coppo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Giovannetti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Marco Protasi

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Coppo, M., Giovannetti, E. (1983). Completeness results for a polymorphic type system. In: Ausiello, G., Protasi, M. (eds) CAAP'83. CAAP 1983. Lecture Notes in Computer Science, vol 159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12727-5_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-12727-5_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12727-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation