An Effect System for Algebraic Effects and Handlers

Bauer, Andrej; Pretnar, Matija

doi:10.1007/978-3-642-40206-7_1

Cited by 33 publications

(97 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We equip λ coop with a type system akin to type and effect systems for algebraic effects and handlers [3,7,12]. We are experimenting with resource control, so it makes sense for the type system to tightly control resources.…”

Section: Type Systemmentioning

confidence: 99%

“…We provide a coherent denotational semantics for λ coop , and prove it sound with respect to the equational theory given in §4.4. Having eschewed all forms of recursion, we may afford to work simply over the category of sets and functions, while noting that there is no obstacle to incorporating recursion at all levels and switching to domain theory, similarly to the treatment of effect handlers in [3].…”

Section: Denotational Semanticsmentioning

confidence: 99%

See 1 more Smart Citation

Runners in Action

Ahman

Bauer

2020

Programming Languages and Systems

Self Cite

View full text Add to dashboard Cite

Runners of algebraic effects, also known as comodels, provide a mathematical model of resource management. We show that they also give rise to a programming concept that models top-level external resources, as well as allows programmers to modularly define their own intermediate "virtual machines". We capture the core ideas of programming with runners in an equational calculus λcoop, which we equip with a sound and coherent denotational semantics that guarantees the linear use of resources and execution of finalisation code. We accompany λcoop with examples of runners in action, provide a prototype language implementation in OCaml, as well as a Haskell library based on λcoop.

show abstract

Section: Type Systemmentioning

confidence: 99%

Section: Denotational Semanticsmentioning

confidence: 99%

Runners in Action

Ahman

Bauer

2020

Programming Languages and Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…We formalized 2 the calculus and the safety theorem in the Twelf proof assistant (Pfenning & Schürmann, 1999). Our formalization extends Bauer & Pretnar's (2014) existing formalization of Eff's core calculus with type schemes and polymorphism. The code is compatible with version 1.7.1 of Twelf.…”

Section: Well-formed Monomorphic and Polymorphic Contextsmentioning

confidence: 99%

No value restriction is needed for algebraic effects and handlers

Kammar¹,

Pretnar²

2017

J. Funct. Prog.

Self Cite

View full text Add to dashboard Cite

We present a straightforward, sound Hindley-Milner polymorphic type system for algebraic effects and handlers in a call-by-value calculus, which allows type variable generalisation of arbitrary computations, not just values. This result is surprising. On the one hand, the soundness of unrestricted call-by-value Hindley-Milner polymorphism is known to fail in the presence of computational effects such as reference cells and continuations. On the other hand, many programming examples can be recast to use effect handlers instead of these effects. Analysing the expressive power of effect handlers with respect to state effects, we claim handlers cannot express reference cells, and show they can simulate dynamically scoped state.

show abstract

“…Apart from our own libraries, Kiselyov et al [9] has a similar library for Haskell, and Brady [3] has an effect handlers library for his dependently-typed language Idris. Two programming languages that build in algebraic effects and handlers as primitives are Bauer and Pretnar's Eff [1,2] and McBride's Frank [15,16]. None of these systems support algebraic effects or handlers for idioms or arrows.…”

Section: Related Workmentioning

confidence: 99%