Semi-Explicit First-Class Polymorphism for ML

Semi-Explicit First-Class Polymorphism for ML
复制标题

ML 的半显式一流多态性

DOI:
--
复制
发表时间:
1999
影响因子:
1
通讯作者:
Didier Rémy
Didier Rémy
中科院分区:
计算机科学4区
文献类型:
--
作者:
Jacques Garrigue;Didier Rémy

文献摘要

被引文献

相似文献

我们提出了一个适度的保守扩展到ML,该扩展允许半明确的一流多态性,同时保留类型推理的基本特性。在我们的提案中,介绍多态类型是完全明确的,即介绍点和精确的多态类型。但是,消除多态性类型是半幅图:只有在推断出多态性类型本身的情况下,只能指定消除点。在多态性取代亚型的目标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.