Name
Abstract | ||
|---|---|---|
The type system of Haskell and some related systems are based on an open world approach for overloading. In an open world, the principal type of each overloaded symbol must be explicitly annotated ( in Haskell, annotations occur in type class declarations) and a definition of an overloaded symbol is required to exist only when overloading is resolved. In a closed world, on the other hand, each principal type is determined according to the types of definitions that exist in the relevant context and, furthermore, overloading resolution for an expression considers only the context of the definition of its constituent symbols. In this paper we formally characterize open and closed worlds, and discuss their relative advantages. We present a type system that supports both approaches together, and compare the defined system with Haskell type classes extended with multi-parameter type classes and functional dependencies. We show in particular that functional dependencies are not necessary in order to support multi-parameter type classes, and present an alternative route. |
Year | Venue | Keywords |
|---|---|---|
2007 | JOURNAL OF UNIVERSAL COMPUTER SCIENCE | type system,type inference,constrained polymorphism,closed and open world approaches for overloading |
Field | DocType | Volume |
Data mining,Unit type,Computer science,Principal type,Functional dependency,Theoretical computer science,Algebraic data type,Haskell,Type family,Recursive data type,Distributed computing,Type class | Journal | 13 |
Issue | ISSN | Citations |
6 | 0948-695X | 0 |
PageRank | References | Authors |
0.34 | 17 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carlos Camarão | 1 | 17 | 5.74 |
| Cristiano Vasconcellos | 2 | 7 | 1.91 |
| Lucília Figueiredo | 3 | 15 | 4.33 |
| João Nicola | 4 | 0 | 0.34 |