Algebraic effects and effect handlers for idioms and arrows

Lindley, Sam

doi:10.1145/2633628.2633636

Cited by 16 publications

(13 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Variations and Applications. Lindley (2014) investigates an adaptation of effect handlers to more restrictive forms of computation based on idioms (McBride & Paterson, 2008) and arrows (Hughes, 2004). Wu et al (2014) study scoped effect handlers.…”

Section: Layered Monads and Monadic Reflection Filinski's Work On Momentioning

confidence: 99%

Doo bee doo bee doo

Convent¹,

Lindley²,

McBride³

et al. 2020

J. Funct. Prog.

Self Cite

View full text Add to dashboard Cite

Abstract We explore the design and implementation of Frank, a strict functional programming language with a bidirectional effect type system designed from the ground up around a novel variant of Plotkin and Pretnar’s effect handler abstraction. Effect handlers provide an abstraction for modular effectful programming: a handler acts as an interpreter for a collection of commands whose interfaces are statically tracked by the type system. However, Frank eliminates the need for an additional effect handling construct by generalising the basic mechanism of functional abstraction itself. A function is but the special case of a Frank operator that interprets no commands. Moreover, Frank’s operators can be multihandlers which simultaneously interpret commands from several sources at once, without disturbing the direct style of functional programming with values. Effect typing in Frank employs a novel form of effect polymorphism which avoids mentioning effect variables in source code. This is achieved by propagating an ambient ability inwards, rather than accumulating unions of potential effects outwards. With the ambient ability describing the effects that are available at a certain point in the code, it can become necessary to reconfigure access to the ambient ability. A primary goal is to be able to encapsulate internal effects, eliminating a phenomenon we call effect pollution. Moreover, it is sometimes desirable to rewire the effect flow between effectful library components. We propose adaptors as a means for supporting both effect encapsulation and more general rewiring. Programming with effects and handlers is in its infancy. We contribute an exploration of future possibilities, particularly in combination with other forms of rich type systems.

show abstract

Section: Layered Monads and Monadic Reflection Filinski's Work On Momentioning

confidence: 99%

Doo bee doo bee doo

Convent¹,

Lindley²,

McBride³

et al. 2020

J. Funct. Prog.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Hence, effects and handlers implement a more structured form of delimited continuation [Bauer and Pretnar 2015;Forster et al 2017;Kammar et al 2013]. Note that λ cart employs deep handlers, i.e., the resumption re-applies the current handler to the rest of the computation, reflecting the intuition that handlers are folds over computation trees [Lindley 2014].…”

Section: Algebraic Effects and Handlersmentioning

confidence: 99%

Versatile event correlation with algebraic effects

Bračevac

Amin

Salvaneschi

et al. 2018

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

We present the first language design to uniformly express variants of n-way joins over asynchronous event streams from different domains, e.g., stream-relational algebra, event processing, reactive and concurrent programming. We model asynchronous reactive programs and joins in direct style, on top of algebraic effects and handlers. Effect handlers act as modular interpreters of event notifications, enabling fine-grained control abstractions and customizable event matching. Join variants can be considered as cartesian product computations with łdegeneratež control flow, such that unnecessary tuples are not materialized a priori. Based on this computational interpretation, we decompose joins into a generic, naïve enumeration procedure of the cartesian product, plus variant-specific extensions, represented in terms of user-supplied effect handlers. Our microbenchmarks validate that this extensible design avoids needless materialization. Alongside a formal semantics for joining and prototypes in Koka and multicore OCaml, we contribute a systematic comparison of the covered domains and features.

show abstract

“…A part of the motivation for our approach to multiple occurrences of the same effect in a row comes from the monadic interpretation of algebraic effects Power 2001b, 2002], used, for example, to embed algebraic effects in a pure language, such as Haskell [Kiselyov et al 2013;Wu and Schrijvers 2015]. In this setting, operations are given in the continuation-passing style (see [Lindley 2014] for a discussion), that is, each operation is specified by the type of its parameter and a generalised arity given by an endofunctor. For example, a direct-style operation ask R : 1 → R σ corresponds to a continuation-passing operation with the arity given by the representable endofunctor (-) σ .…”

Section: Monadic Interpretationmentioning

confidence: 99%

Handle with care: relational interpretation of algebraic effects and handlers

Biernacki

Piróg

Polesiuk

et al. 2017

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Algebraic effects and handlers have received a lot of attention recently, both from the theoretical point of view and in practical language design. This stems from the fact that algebraic effects give the programmer unprecedented freedom to define, combine, and interpret computational effects. This plenty-of-rope, however, demands not only a deep understanding of the underlying semantics, but also access to practical means of reasoning about effectful code, including correctness and program equivalence. In this paper we tackle this problem by constructing a step-indexed relational interpretation of a call-by-value calculus with algebraic effect handlers and a row-based polymorphic type-and-effect system. Our calculus, while striving for simplicity, enjoys desirable theoretical properties, and is close to the cores of programming languages with algebraic effects used in the wild, while the logical relation we build for it can be used to reason about non-trivial properties, such as contextual equivalence and contextual approximation of programs. Our development has been fully formalised in the Coq proof assistant.

show abstract

Algebraic effects and effect handlers for idioms and arrows

Cited by 16 publications

References 25 publications

Doo bee doo bee doo

Doo bee doo bee doo

Versatile event correlation with algebraic effects

Handle with care: relational interpretation of algebraic effects and handlers

Contact Info

Product

Resources

About