This paper presents an extension to standard Hindley-Milner type checking that allows constructors in data types to have non-uniform result types. We use Haskell as the sample language, [Hud92], but it should work for any language using H-M. It starts with some motivating examples and then shows the type rules for a simple language. Finally, it contains a sketch of how type deduction could be done.
AbstractThis paper describes a general theory of overloading based on a system of qualified types. T...
AbstractThis article explores the use of types constrained by the definition of functions of given t...
Type classes in Haskell are used to implement ad-hoc polymorphism, i.e. a way to ensure both to the ...
Haskell has a rich type system with various complementary, interacting and overlapping features. In ...
We study the type inference problem for a system with type classes as in the functional programming ...
We study the type inference problem for a system with type classes as in the functional programming ...
We describe the implementation of a type checker for the functional programming language Haskell tha...
Type classes and type families are key ingredients in Haskell pro-gramming. Type classes were introd...
Qualified types provide a general framework for constrained type systems, with applications includin...
This article presents a type system based on the Damas-Milner system [DM82], that supports overloadi...
Abstract. The more expressive a type system, the more type information has to be provided in a progr...
Qualified types provide a general framework for constrained type systems, with applications includin...
John Hughes presents a new method for performing partial evaluation in [Hug96b]. The method is calle...
Static typing is one of the most prominent techniques in the design of programming languages for mak...
The type class system in the Haskell Programming language provides a useful abstraction for a wide r...
AbstractThis paper describes a general theory of overloading based on a system of qualified types. T...
AbstractThis article explores the use of types constrained by the definition of functions of given t...
Type classes in Haskell are used to implement ad-hoc polymorphism, i.e. a way to ensure both to the ...
Haskell has a rich type system with various complementary, interacting and overlapping features. In ...
We study the type inference problem for a system with type classes as in the functional programming ...
We study the type inference problem for a system with type classes as in the functional programming ...
We describe the implementation of a type checker for the functional programming language Haskell tha...
Type classes and type families are key ingredients in Haskell pro-gramming. Type classes were introd...
Qualified types provide a general framework for constrained type systems, with applications includin...
This article presents a type system based on the Damas-Milner system [DM82], that supports overloadi...
Abstract. The more expressive a type system, the more type information has to be provided in a progr...
Qualified types provide a general framework for constrained type systems, with applications includin...
John Hughes presents a new method for performing partial evaluation in [Hug96b]. The method is calle...
Static typing is one of the most prominent techniques in the design of programming languages for mak...
The type class system in the Haskell Programming language provides a useful abstraction for a wide r...
AbstractThis paper describes a general theory of overloading based on a system of qualified types. T...
AbstractThis article explores the use of types constrained by the definition of functions of given t...
Type classes in Haskell are used to implement ad-hoc polymorphism, i.e. a way to ensure both to the ...