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.
Unable to display preview. Download preview PDF.
- /BEN/.C. Ben-Yelles, Type Assignment in the Lambda-Calculus: Syntax and Semantics, Ph.D. Thesis, University of Wales, Swansea, 1979.Google Scholar
- /COP/.M. Coppo, On the semantics of Polymorphism, Internal Report of I.S.I., University of Turin, 1982 (to appear in Acta Informatica).Google Scholar
- /DM/.L. Damas and R. Milner, Principal Type-Schemes for Functional Programs, Proc. 9th ACM Symposium on Principles of Programming Languages, Albuquerque, 1982.Google Scholar
- /GMW/.M.J. Gordon, A. J. Milner and C.P. Wadsworth, Edinburgh LCF, LNCS 78, Springer-Verlag, 1979.Google Scholar
- /STO/.J. Stoy, Denotational Semantics, MIT Press, 1977.Google Scholar