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 …

Haskell's deriving mechanism supports the automatic generation of instances for a number
of functions. The Haskell 98 Report only specifies how to generate instances for the Eq, Ord …

We present a closed dependent type theory whose inductive types are given not by a
scheme for generative declarations, but by encoding in a universe. Each inductive datatype …

Generic programming aims to increase the flexibility of programming languages, by
expanding the possibilities for parametrization—ideally, without also expanding the …

Datatype-generic programming is defining functions that depend on the structure, or"
shape", of datatypes. It has been around for more than 10 years, and a lot of progress has …

Strategies specify how a wide range of exercises can be solved incrementally, such as
bringing a logic proposition to disjunctive normal form, reducing a matrix, or calculating with …

Abstract Stream Runtime Verification (SRV) is a formal dynamic analysis technique that
generalizes runtime verification algorithms from temporal logics like LTL to stream …

We document an operational method to construct reduction-free normalization functions.
Starting from a reduction-based normalization function from a reduction semantics, ie, the …

Programming with dependent types is a blessing and a curse. It is a blessing to be able to
bake invariants into the definition of datatypes: we can finally write correct-by-construction …

Programming languages with an expressive language for defining data types often suffer
from an excess in boiler-plate code and lack of re-usable, extendible libraries. Dependently …