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 …

Static type systems strive to be richly expressive while still being simple enough for
programmers to use. We describe an experiment that enriches Haskell's kind system with …

Cαml is a tool that turns a so-called “binding specification” into an Objective Caml
compilation unit. A binding specification resembles an algebraic data type declaration, but …

Advanced type system features, such as GADTs, type classes and type families, have
proven to be invaluable language extensions for ensuring data invariants and program …

Type classes were originally developed in Haskell as a disciplined alternative to ad-hoc
polymorphism. Type classes have been shown to provide a type-safe solution to important …

We describe internal test-case reduction, the method of test-case reduction employed by
Hypothesis, a widely-used property-based testing library for Python. The key idea of internal …

We present instance arguments: an alternative to type classes and related features in the
dependently typed, purely functional programming language/proof assistant Agda. They are …

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 …

Typeclasses provide an elegant and effective way of managing ad-hoc polymorphism in
both programming languages and interactive proof assistants. However, the increasingly …

Implementors of compilers, program refactorers, theorem provers, proof checkers, and other
systems that manipulate syntax know that dealing with name binding is difficult to do well …