First Class Dynamic Effect Handlers: or, Polymorphic Heaps with Dynamic Effect Handlers
Algebraic effect handlers are a powerful abstraction mechanism that can express many complex control-flow mechanisms. This article extends basic algebraic effect handlers with first class dynamic effects. Dynamic effects add a lot more expressiveness but surprisingly only need minimal changes to the original semantics. As such, dynamic effects are a powerful abstraction but can still be understood and reasoned about as regular effect handlers. We illustrate the expressiveness of dynamic effects with first class event streams in CorrL and also model full polymorphic heap references without requiring any further primitives.
I am a member of the Research In Software Engineering (RISE) group and chair of the Programming Languages working group (PLX). Currently, I am interested in the design and application of strong type systems and declarative programming languages, like Haskell. In particular, I am interested in programming with Effect inference in the Koka project. Furthermore, I work on domain specific embedded languages, language design, and compiler technology.
Thu 27 SepDisplayed time zone: Guadalajara, Mexico City, Monterrey change
14:20 - 15:10 | Effect Handlers & Abstract MachineTyDe at New York Central Chair(s): Niki Vazou University of Maryland, USA | ||
14:20 25mResearch paper | First Class Dynamic Effect Handlers: or, Polymorphic Heaps with Dynamic Effect Handlers TyDe Daan Leijen Microsoft Research, USA DOI | ||
14:45 25mResearch paper | From Algebra to Abstract Machine: A Verified Generic Construction TyDe Carlos Tomé Cortiñas Utrecht University, Netherlands, Wouter Swierstra Utrecht University, Netherlands DOI |