Extending ML with semi-explicit higher-order polymorphism [chapter]

Jacques Garrigue, Didier Rémy
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
more » ... Objective ML where polymorphism replaces subtyping.
doi:10.1007/bfb0014546 fatcat:d4ituiy3z5grjft5eglacmo7wq