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 …

In programming, some data acts as a resource (eg, file handles, channels) subject to usage
constraints. This poses a challenge to software correctness as most languages are agnostic …

A thorough and accessible introduction to a range of key ideas in type systems for
programming language. The study of type systems for programming languages now touches …

Graph rewriting (also called reduction) as defined in Wadsworth [1971] was introduced in
order to be able to give a more efficient implementation of functional programming …

Gradual type systems offer a smooth continuum between static and dynamic ty** by
permitting the free mixture of typed and untyped code. The runtime systems for these …

As functional programmers we always face a dilemma: should we write purely functional
code, or sacrifice purity for efficiency and resort to in-place updates? This paper identifies …

The introduction of first-class type classes in the Coq system calls for a re-examination of the
basic interfaces used for mathematical formalisation in type theory. We present a new set of …

Creating IoT programs for resource-constrained microcontrollers differs significantly from
conventional computer programming. Microcontrollers are traditionally programmed using …

Functional programming languages have banned assignment because of its undesirable
properties. The reward of this rigorous decision is that functional programming languages …