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 …

Current GPUs are massively parallel multicore processors optimised for workloads with a
large degree of SIMD parallelism. Good performance requires highly idiomatic programs …

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 …

We present a novel approach to regular, multi-dimensional arrays in Haskell. The main
highlights of our approach are that it (1) is purely functional,(2) supports reuse through …

Purely functional, embedded array programs are a good match for SIMD hardware, such as
GPUs. However, the naive compilation of such programs quickly leads to both code …

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 propose a core semantics for Dependent Haskell, an extension of Haskell with full-
spectrum dependent types. Our semantics consists of two related languages. The first is a …

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 …

Dependent types provide a strong foundation for specifying and verifying rich properties of
programs through type-checking. The earliest implementations combined dependency …