We introduce the notion of a Martin-Löf category—a locally cartesian closed category with
disjoint coproducts and initial algebras of container functors (the categorical analogue of W …

“I have no data yet. It is a capital mistake to theorise before one has data.” Sir Arthur Conan
Doyle The Adventures of Sherlock Holmesde Bruijn notation is a coding of lambda terms in …

Dependent types reflect the fact that validity of data is often a relative notion by allowing prior
data to affect the types of subsequent data. Not only does this make for a precise type …

Algebraic effects and handlers is an increasingly popular approach to programming with
effects. An attraction of the approach is its modularity: effectful programs are written against …

This paper describes a new approach to generic functional programming, which allows us to
define functions generically for all datatypes expressible in Haskell. A generic function is …

LNCS 2793 - Chapter 1. Generic Haskell: Practice and Theory Page 1 Generic Haskell:
Practice and Theory Ralf Hinze1 and Johan Jeuring2,3 1 Institut für Informatik III, Universität …

Many datatype-generic functions need access to the recursive positions in the structure of
the datatype, and therefore adopt a fixed point view on datatypes. Examples include variants …

GADTs are at the cutting edge of functional programming and becomemore widely used
every day. Nevertheless, the semantic foundations underlying GADTs are not well …

Algebraic effects offer a versatile framework that covers a wide variety of effects. However,
the family of operations that delimit scopes are not algebraic and are usually modelled as …

This thesis is on termination of computer programs. By termination we mean that the task
given to a computer is processed in a certain amount of time, as opposed to taking infinitely …