Name
Abstract | ||
|---|---|---|
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type inference in both ML or MLF. We show that this constraint system is a small extension of the formalism of graphic types, originally introduced to represent MLF types. We give a few semantic preserving transformations on constraints and propose a strategy for applying them to solve constraints. We show that the resulting algorithm has optimal complexity for MLF type inference, and argue that, as for ML, this complexity is linear under reasonable assumptions. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1145/1411204.1411216 | ICFP |
Keywords | Field | DocType |
System-F polymorphism,MLF type inference,reasonable assumption,constraint system,type inference,MLF type,graphic type,graphic type constraint,seamlessly merges ML-style type,optimal complexity,efficient type inference,type system | Graphics,Type generalization,Computer science,Unification,System F,Algorithm,Type theory,Type inference,Theoretical computer science,Formalism (philosophy),Semantics | Conference |
Volume | Issue | ISSN |
43 | 9 | 0362-1340 |
Citations | PageRank | References |
2 | 0.41 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Didier Rémy | 1 | 682 | 49.82 |
| Boris Yakobowski | 2 | 199 | 10.77 |