Retrofitting effect handlers onto OCaml

Sivaramakrishnan, KC; Dolan, Stephen K.; White, Leo; Kelly, Tom; Jaffer, Sadiq; Madhavapeddy, Anil

doi:10.1145/3453483.3454039

Cited by 26 publications

(9 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Effect handlers were originally studied as a theoretical means to provide a semantics for exception handling in the setting of algebraic effects (Plotkin & Power, 2001;Plotkin & Pretnar, 2013). Subsequently, they have emerged as a practical programming abstraction for modular effectful programming (Convent et al, 2020;Kammar et al, 2013;Kiselyov et al, 2013;Bauer & Pretnar, 2015;Leijen, 2017;Sivaramakrishnan et al, 2021). In this section, we give a short introduction to effect handlers.…”

Section: Effect Handlers Primermentioning

confidence: 99%

Asymptotic speedup via effect handlers

HILLERSTRÖM,

LINDLEY,

LONGLEY

2024

J. Funct. Prog.

View full text Add to dashboard Cite

We study a fundamental efficiency benefit afforded by delimited control, showing that for certain higher-order functions, a language with advanced control features offers an asymptotic improvement in runtime over a language without them. Specifically, we consider the generic count problem in the context of a pure functional base language ${\lambda_{\textrm{b}}}$ and an extension ${\lambda_{\textrm{h}}}$ with general effect handlers. We prove that ${\lambda_{\textrm{h}}}$ admits an asymptotically more efficient implementation of generic count than any implementation in ${\lambda_{\textrm{b}}}$ . We also show that this gap remains even when ${\lambda_{\textrm{b}}}$ is extended to a language ${{{{{{\lambda_{\textrm{a}}}}}}}}$ with affine effect handlers, which is strong enough to encode exceptions, local state, coroutines and single-shot continuations. This locates the efficiency difference in the gap between ‘single-shot’ and ‘multi-shot’ versions of delimited control. To our knowledge, these results are the first of their kind for control operators.

show abstract

Section: Effect Handlers Primermentioning

confidence: 99%

Asymptotic speedup via effect handlers

HILLERSTRÖM,

LINDLEY,

LONGLEY

2024

J. Funct. Prog.

View full text Add to dashboard Cite

show abstract

“…Recently, effect handlers are found in several research programming languages, such as Eff [1], Frank [2], Links [3], Multicore OCaml [4], and Scala [5], etc. There is a growing need for programmers and researchers to reason about the combination of primitive effects and user-defined handlers.…”

Section: Introductionmentioning

confidence: 99%

“…The coexistence of zero-shot, one-shot and multi-shot continuations. The design decisions of various implementations [4,6] and verification solutions [7,8] diverge upon the question that, should it be permitted or forbidden to invoke a captured continuation more than once? In this paper, our forward inference rules shows the generality to incorporate both one-shot and multi-shot continuations.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Automated Temporal Verification for Algebraic Effects

Song

Foo

Chin

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Although effect handlers offer a versatile abstraction for userdefined effects, they produce complex and less restricted execution traces due to the composable non-local control flow mechanisms. This paper is interested in the temporal behaviors of effect sequences, such as unhandled effects, termination of the communication, safety, fairness, etc. Specifically, we propose a novel effects logic ContEffs, to write precise and modular specifications for programs in the presence of user-defined effect handlers and primitive effects. As a second contribution, we devise a forward verifier together with a fixpoint calculator to infer the behaviors of such programs. Lastly, our automated verification framework provides a purely algebraic term-rewriting system (TRS) as the back-end solver, efficiently checking the entailments between ContEffs assertions. To demonstrate the feasibility of our proposals, we prototype a verification system where zero-shot, one-shot, and multi-shot continuations coexist; prove its correctness; present experimental results; and report on case studies.

show abstract

“…Since introduced, they have been studied extensively in the community, supported in languages including Koka [4], Eff [11], Frank [6] and Links [5]. Recent work has implemented effect handlers in Multicore OCaml [12] to support asynchronous I/O for concurrent programming.…”

Section: Introductionmentioning

confidence: 99%

Parallel Algebraic Effect Handlers

Xie,

Johnson,

Maclaurin

et al. 2021

Preprint

View full text Add to dashboard Cite

Algebraic effects and handlers support composable and structured control-flow abstraction. However, existing designs of algebraic effects often require effects to be executed sequentially. This paper studies parallel algebraic effect handlers. In particular, we formalize , an untyped lambda calculus which models two key features, effect handlers and parallelizable computations, the latter of which takes the form of a for expression as inspired by the Dex programming language. We present various interesting examples expressible in our calculus, and provide a Haskell implementation. We hope this paper provides a basis for future designs and implementations of parallel algebraic effect handlers.

show abstract

Retrofitting effect handlers onto OCaml

Cited by 26 publications

References 37 publications

Asymptotic speedup via effect handlers

Asymptotic speedup via effect handlers

Automated Temporal Verification for Algebraic Effects

Parallel Algebraic Effect Handlers

Contact Info

Product

Resources

About