Name
Abstract | ||
|---|---|---|
This article explores the use of types constrained by the definition of functions of given types. This notion supports both overloading and a form of subtyping, and is related to Haskell type classes and System O. We study an extension of the Damas-Milner system, in which overloaded functions can be defined. The inference system presented uses a context-independent overloading policy, specified by means of a predicate used in a single inference rule. The treatment of overloading is less restrictive than in similar systems. Type annotations are not required, but can be used to simplify inferred types. The work motivates the use of constrained types as parameters of other, higher-order types. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1016/S1571-0661(05)80228-2 | Electr. Notes Theor. Comput. Sci. |
Keywords | Field | DocType |
inference rule,higher order | Discrete mathematics,Computer science,Theoretical computer science,Haskell,Order type,Predicate (grammar),Subtyping,Type family,Rule of inference,Inference system | Journal |
Volume | ISSN | Citations |
14 | Electronic Notes in Theoretical Computer Science | 0 |
PageRank | References | Authors |
0.34 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carlos Camarão | 1 | 17 | 5.74 |
| Lucília Figueiredo | 2 | 15 | 4.33 |