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 $\lambda^{p}$, an untyped lambda calculus which models two key features, effect handlers and paralleliable computations, the latter of which takes the form of a \textbf{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.
Short paper (paper5.pdf) | 519KiB |
Mon 17 JanDisplayed time zone: Eastern Time (US & Canada) change
Mon 17 Jan
Displayed time zone: Eastern Time (US & Canada) change
11:35 - 12:35 | Contributed Talks 1PEPM at PEPM Chair(s): Antonina Nepeivoda Program Systems Institute of RAS, Russia | ||
11:35 30mTalk | Partially Evaluating Symbolic Interpreters for AllRemote PEPM File Attached | ||
12:05 30mTalk | Parallel Algebraic Effect HandlersRemote PEPM Ningning Xie University of Toronto, Daniel D. Johnson Google Research, Dougal Maclaurin Google Research, Adam Paszke Google Research File Attached |