Name
Abstract | ||
|---|---|---|
Nowadays the support of generalized algebraic data types GADTs in extensions of Haskell allows functions defined over GADTs to be written without the need for type annotations in some cases and requires type annotations in other cases. In this paper we present a type inference algorithm for GADTs that is based on a closed-world approach to overloading and uses anti-unification and constraint-set satisfiability to infer the relationship between the types of function arguments and result. Through some examples, we show how the proposed algorithm allows more functions defined over GADTs to be written without the need for type annotations. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-24012-1_2 | SBLP |
Field | DocType | Volume |
Anti-unification,Programming language,Satisfiability,Type inference,Algebraic data type,Theoretical computer science,Haskell,Argument of a function,Mathematics | Conference | 9325 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
9 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adelaine Gelain | 1 | 0 | 0.34 |
| Cristiano Vasconcellos | 2 | 0 | 0.34 |
| Carlos Camarão | 3 | 17 | 5.74 |
| Rodrigo Ribeiro | 4 | 1 | 0.69 |