Completeness results for a polymorphic type system
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.
- Ben-Yelles, C. (1979) Type Assignment in the Lambda-Calculus: Syntax and Semantics. University of Wales, Swansea
- M. Coppo, On the semantics of Polymorphism, Internal Report of I.S.I., University of Turin, 1982 (to appear in Acta Informatica).
- L. Damas and R. Milner, Principal Type-Schemes for Functional Programs, Proc. 9th ACM Symposium on Principles of Programming Languages, Albuquerque, 1982.
- M.J. Gordon, A. J. Milner and C.P. Wadsworth, Edinburgh LCF, LNCS 78, Springer-Verlag, 1979.
- Milner, R. (1978) A Theory of Type Polymorphism in Programming. J. Comput. Sys. Sci. 17: pp. 348-375 CrossRef
- Plotkin, G. (1978) Tω as a Universal Domain. J. Comput. Sys. Sci. 17: pp. 209-236 CrossRef
- J. Stoy, Denotational Semantics, MIT Press, 1977.
- Completeness results for a polymorphic type system
- Book Title
- Book Subtitle
- Trees in Algebra and Programming 8th Colloquium L'Aquila, March 9–11, 1983 Proceedings
- pp 179-190
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.