Name
Abstract | ||
|---|---|---|
We propose a modest conservative extension to ML that allows semi-explicit first-class polymorphismwhile preserving the essential properties of type inference. In our proposal, theintroduction of polymorphic types is fully explicit, that is, both introduction points and exactpolymorphic types are to be specified. However, the elimination of polymorphic types issemi-implicit: only elimination points are to be specified as polymorphic types themselves areinferred. This extension is... |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1006/inco.1999.2830 | Inf. Comput. |
Keywords | Field | DocType |
semi-explicit first-class polymorphism,polymorphism,type inference | Existence theorem,Discrete mathematics,Lambda calculus,Combinatorics,Type inference,Polymorphism (computer science),First class,Conservative extension,Subtyping,Mathematics | Journal |
Volume | Issue | ISSN |
155 | 1-2 | Information and Computation |
Citations | PageRank | References |
17 | 0.90 | 20 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jacques Garrigue | 1 | 96 | 14.45 |
| Didier Rémy | 2 | 682 | 49.82 |