In the last ten years the study of meta-programming systems, as formal systems worthy of
study in their own right, has vastly accelerated. In that time a lot has been accomplished, yet …

Program analysis concerns static techniques for computing reliable approximate information
about the dynamic behaviour of programs. Applications include compilers (for code …

Programming is hard. Building a large program is like constructing a steam locomotive
through a hole the size of a postage stamp. An artefact that is the fruit of hundreds of person …

A history of Haskell Page 1 A History of Haskell: Being Lazy With Class Paul Hudak Yale
University paul.hudak@yale.edu John Hughes Chalmers University rjmh@cs.chalmers.se …

We describe a framework for adding type qualifiers to a language. Type qualifiers encode a
simple but highly useful form of subtyping. Our framework extends standard type rules to …

This article defines a set of type inference rules for resolving overloading introduced by type
classes, as used in the functional programming language Haskell. Programs including type …

We propose a programming model where effects are treated in a disciplined way, and where
the potential side-effects of a function are apparent in its type signature. The type and effect …

Haskell programmers often use a multi-parameter type class in which one or more type
parameters are functionally dependent on the first. Although such functional dependencies …

A heterogeneous collection is a datatype that is capable of storing data of different types,
while providing operations for look-up, update, iteration, and others. There are various kinds …

Qualified types can be viewed as a generalization of type classes in the functional language
Haskell and the theorem prover Isabelle. These in turn are extensions of equality types in …