Searching for authors named "Jeremy Wazny" – sorted by Relevance.
-
Type processing by constraint reasoning
- Abstract. Herbrand constraint solving or unification has long been understood as an efficient mechanism for type checking and inference for programs using Hindley/Milner types. If we step back from the particular solving mechanisms used for Hindley/Milner types, and understand type operations in ter
- Cited by 2 (1 self) – Add To MetaCart
-
The Chameleon System
- We give an overview of the major features of the Chameleon programming language, as well as use of the system, from a Haskell programmer's point of view. Chameleon supports typeclass overloading a la Haskell. The novelty of Chameleon is to allow the programmer to specify almost arbitrary conditions
- Cited by 2 (1 self) – Add To MetaCart
-
A theory of overloading
- Abstract We introduce a novel approach for debugging ill-typed programs in the Hindley/Milner system. We map the typing problem for a program to a system of constraints each attached to program code that generates the constraints. We use reasoning about constraint satisfiability and implication to f
- Cited by 45 (15 self) – Add To MetaCart
-
A framework for extended algebraic data types
- Abstract. There are a number of extended forms of algebraic data types such as type classes with existential types and generalized algebraic data types. Such extensions are highly useful but their interaction has not been studied formally so far. Here, we present a unifying framework for these exten
- Cited by 18 (9 self) – Add To MetaCart

