Name
Abstract | ||
|---|---|---|
This paper describes a practical type inference algorithm for typing polymorphic and possibly mutually recursive definitions, using Haskell to provide a high-level implementation of the algorithm. |
Year | Venue | Keywords |
|---|---|---|
2003 | JOURNAL OF UNIVERSAL COMPUTER SCIENCE | programming languages,type inference,polymorphic recursion |
Field | DocType | Volume |
Hindley–Milner type system,Programming language,Computer science,Parametric polymorphism,Type inference,Theoretical computer science,Haskell,Polymorphic recursion,Recursive data type,Recursion,Type class | Journal | 9 |
Issue | ISSN | Citations |
8 | 0948-695X | 2 |
PageRank | References | Authors |
0.37 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cristiano Vasconcellos | 1 | 7 | 1.91 |
| Lucília Figueiredo | 2 | 15 | 4.33 |
| Carlos Camarão | 3 | 17 | 5.74 |