Semi-Explicit First-Class Polymorphism for ML

We propose a modest conservative extension to ML that allows semi-explicit first-class polymorphism while preserving the essential properties of type inference. In our proposal, the introduction of polymorphic types is fully explicit, that is, both introduction points and exact polymorphic types are to be specified. However, the elimination of polymorphic types is semi-implicit: only elimination points are to be specified as polymorphic types themselves are inferred. This extension is particularly useful in objective ML where polymorphism replaces subtyping.

Authors

• Jacques Garrigue
• Didier Rémy

Keywords

No keywords are indexed for this paper.