We design and implement a library that solves the long-standing problem of combining
effects without imposing restrictions on their interactions (such as static ordering). Effects …

Reasoning about the use of external resources is an important aspect of many practical
applications. Effect systems enable tracking such information in types, but at the cost of …

Effect handlers have recently gained popularity amongst programming language
researchers. Existing type-and effect systems for effect handlers are often complicated and …

Effect handlers are a promising way to structure effectful programs in a modular way. We
present the Scala library Effekt, which is centered around capability passing and …

Algebraic effect handlers are a powerful way to incorporate effects in a programming
language. Sometimes perhaps even _too_ powerful. In this article we define a restriction of …

We describe the implementation of first-class polymorphic delimited continuations in the
programming language Scala. We use Scala's pluggable typing architecture to implement a …

Bayesian inference, of posterior knowledge from prior knowledge and observed evidence, is
typically defined by Bayes's rule, which says the posterior multiplied by the probability of an …

This paper studies compilation techniques for algebraic effect handlers. In particular, we
present a sequence of refinements of algebraic effects, going via multi-prompt delimited …

The language Eff is an OCaml-like language serving as a prototype implementation of the
theory of algebraic effects, intended for experimentation with algebraic effects on a large …

We compare the expressive power of three programming abstractions for user-defined
computational effects: Plotkin and Pretnar's effect handlers, Filinski's monadic reflection, and …