Title
Effect handlers in Haskell, evidently
Abstract
Algebraic effect handlers offer an alternative to monads to incorporate effects in Haskell. In recent work Xie _et al._ show how to give semantics to effect handlers in terms of plain polymorphic lambda calculus through _evidence translation_. Besides giving precise semantics, this translation also allows for potentially more efficient implementations. Here we present the first implementation of this technique as a library for effect handlers in Haskell. We show how the design naturally leads to a concise effect interface and how evidence translation enables evaluating _tail resumptive_ operations _in-place_. We give detailed benchmark results where our library performs well with respect to other approaches.
Year
DOI
Venue
2020
10.1145/3406088.3409022
ICFP '20: ACM SIGPLAN International Conference on Functional Programming Virtual Event USA August, 2020
DocType
ISBN
Citations 
Conference
978-1-4503-8050-8
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Ningning Xie100.68
Daan Leijen2101.28