Versatile event correlation with algebraic effects

Bračevac, Oliver; Amin, Nada; Salvaneschi, Guido; Erdweg, Sebastian; Eugster, Patrick; Mezini, Mira

doi:10.1145/3236762

Cited by 14 publications

(21 citation statements)

References 70 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the type system does not ensure that accidental handling is avoided or that exceptions are handled at all. Bračevac et al [2018] observe the need to disambiguate handlers for invocations of the same algebraic effect operation. Compared with their proposed solution of generative effect signatures, tunneling addresses the issue straightforwardly: handlers can be specified explicitly for each invocation of the effect operation.…”

Section: Related Workmentioning

confidence: 99%

Abstraction-safe effect handlers via tunneling

Zhang

Myers

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Algebraic effect handlers offer a unified approach to expressing control-flow transfer idioms such as exceptions, iteration, and async/await. Unfortunately, previous attempts to make these handlers type-safe have failed to support the fundamental principle of modular reasoning for higher-order abstractions. We demonstrate that abstraction-safe algebraic effect handlers are possible by giving them a new semantics. The key insight is that code should only handle effects it is aware of. In our approach, the type system guarantees all effects are handled, but it is impossible for higher-order, effect-polymorphic code to accidentally handle effects raised by functions passed in; such effects tunnel through the higher-order, calling procedures polymorphic to them. By contrast, the possibility of accidental handling threatens previous designs for algebraic effect handlers. We prove that our design is not only type-safe, but also abstraction-safe. Using a logical-relations model that we prove sound with respect to contextual equivalence, we derive previously unattainable program equivalence results. Our mechanism offers a viable approach for future language designs aiming for effect handlers with strong abstraction guarantees. CCS Concepts: • Software and its engineering → Control structures;

show abstract

Section: Related Workmentioning

confidence: 99%

Abstraction-safe effect handlers via tunneling

Zhang

Myers

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…We would like to apply our methodology to study the relative expressiveness of these alternative formulations. Inspired by the suggestion of Bračevac et al (2018) to associate effect handlers with implicits, Brachthauser & Leijen (2019) have recently proposed another basis for userdefined effects. They extend a calculus of dynamic binding with implicit functions and implicit control.…”

Section: Conclusion and Further Workmentioning

confidence: 99%

On the expressive power of user-defined effects: Effect handlers, monadic reflection, delimited control

Forster

Kammar²,

Lindley

et al. 2019

J. Funct. Prog.

View full text Add to dashboard Cite

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 delimited control. This comparison allows a precise discussion about the relative expressiveness of each programming abstraction. It also demonstrates the sensitivity of the relative expressiveness of user-defined effects to seemingly orthogonal language features. We present three calculi, one per abstraction, extending Levy’s call-by-push-value. For each calculus, we present syntax, operational semantics, a natural type-and-effect system, and, for effect handlers and monadic reflection, a set-theoretic denotational semantics. We establish their basic metatheoretic properties: safety, termination, and, where applicable, soundness and adequacy. Using Felleisen’s notion of a macro translation, we show that these abstractions can macro express each other, and show which translations preserve typeability. We use the adequate finitary set-theoretic denotational semantics for the monadic calculus to show that effect handlers cannot be macro expressed while preserving typeability either by monadic reflection or by delimited control. Our argument fails with simple changes to the type system such as polymorphism and inductive types. We supplement our development with a mechanised Abella formalisation.

show abstract

“…Effect handlers Pretnar 2009, 2013] offer high-level control-flow abstractions that are user definable and composable. They have been used successfully to develop libraries for asynchronous programming, libraries for concurrent system programming, programming with coroutines, stream processing, and many more [Bračevac et al 2018;Dolan et al 2017Dolan et al , 2015Hillerström and Lindley 2016;Kammar et al 2013;Leijen 2017b;Piróg et al 2018]. Effect handlers naturally allow users to combine these libraries and the corresponding domain-specific abstractions in one program.…”

Section: Introductionmentioning

confidence: 99%

Compiling effect handlers in capability-passing style

Schuster

Brachthäuser

Ostermann

2020

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

In this paper, we aim to achieve abstraction without regret for effect handlers. We present a language for effect handlers in capability-passing style (λ Cap) and an implementation of this language as a translation to simply-typed lambda calculus in iterated continuation-passing style. A suite of benchmarks indicates that the novel combination of capability-passing style and iterated CPS enables significant speedups over existing languages with effect handlers or control operators. Our implementation technique is general and allows us to generate code in any language that supports first-class functions. We then identify a subset of programs for which we can further improve the performance and guarantee full elimination of the effect handler abstraction. To formally capture this subset, we refine λ Cap to λ λ Cap with a more restrictive type system. We present a type-directed translation for λ λ Cap that inserts staging annotations and prove that no abstractions or applications related to effect handlers occur in the translated program. Using this second translation we observe additional speedups in some of the benchmarks.

show abstract

Versatile event correlation with algebraic effects

Cited by 14 publications

References 70 publications

Abstraction-safe effect handlers via tunneling

Abstraction-safe effect handlers via tunneling

On the expressive power of user-defined effects: Effect handlers, monadic reflection, delimited control

Compiling effect handlers in capability-passing style

Contact Info

Product

Resources

About