Differential privacy offers a way to answer queries about sensitive information while
providing strong, provable privacy guarantees, ensuring that the presence or absence of a …

Algebraic effects and effect handlers provide a modular abstraction for effectful
programming. They support user-defined effects, as in Haskell, in conjunction with direct …

Haskell programmers have been experimenting with dependent types for at least a decade,
using clever encodings that push the limits of the Haskell type system. However, the …

Information-Flow Control (IFC) is a well-established approach for allowing untrusted code to
manipulate sensitive data without disclosing it. IFC is typically enforced via type systems and …

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, as implemented in the Glasgow Haskell Compiler (GHC), has been adding new
type-level programming features for some time. Many of these features—generalized …

Open, type-level functions are a recent innovation in Haskell that move Haskell towards the
expressiveness of dependent types, while retaining the look and feel of a practical …

It is well-known that the simply typed lambda-calculus is modeled by any cartesian closed
category (CCC). This correspondence suggests giving typed functional programs a variety of …

Effect and session type systems are two expressive behavioural type systems. The former is
usually developed in the context of the lambda-calculus and its variants, the latter for the pi …

There are two well-known formulations of recursive types: iso-recursive and equi-recursive
types. Abadi and Fiore [LICS 1996] have shown that iso-and equi-recursive types have the …