Lecture Notes in Computer Science Volume 159, 1983, pp 179-190
Date: 29 May 2005

Completeness results for a polymorphic type system

* Final gross prices may vary according to local VAT.

Get Access

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.