A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Extending ML with semi-explicit higher-order polymorphism
[chapter]
1997
Lecture Notes in Computer Science
We propose a modest conservative extension to ML that allows semi-explicit higher-order polymorphism while preserving the essential properties of ML. In our proposal, the introduction of polymorphic types remains fully explicit, that is, both the introduction and the exact polymorphic type must be speci ed. However, the elimination of polymorphic types is now semi-implicit: only the elimination itself must be speci ed as the polymorphic type is inferred. This extension is particularly useful in
doi:10.1007/bfb0014546
fatcat:d4ituiy3z5grjft5eglacmo7wq