The following pages link to Handling algebraic effects (Q2871476):
Displaying 35 items.
- Programming with algebraic effects and handlers (Q478396) (← links)
- Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation (Q831147) (← links)
- Combining algebraic effects with continuations (Q879352) (← links)
- Generic weakest precondition semantics from monads enriched with order (Q890376) (← links)
- PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control (Q1726305) (← links)
- Graded algebraic theories (Q2200837) (← links)
- Mac Lane's comparison theorem for the Kleisli construction formalized in Coq (Q2209259) (← links)
- Stateful runners of effectful computations (Q2520704) (← links)
- Dependent Types and Fibred Computational Effects (Q2811331) (← links)
- A duality between exceptions and states (Q2909735) (← links)
- Inferring algebraic effects (Q2921118) (← links)
- Notions of Bidirectional Computation and Entangled State Monads (Q2941175) (← links)
- Fusion for Free (Q2941182) (← links)
- (Q4585073) (← links)
- Tabling as a library with delimited control (Q4592987) (← links)
- Efficient algebraic effect handlers for Prolog (Q4593065) (← links)
- Runners in Action (Q5041086) (← links)
- (Q5089033) (← links)
- (Q5094148) (← links)
- Effect handlers via generalised continuations (Q5110928) (← links)
- Effekt: Capability-passing style for type- and effect-safe, extensible effect handlers in Scala (Q5110932) (← links)
- Doo bee doo bee doo (Q5110934) (← links)
- Continuation passing style for effect handlers (Q5111314) (← links)
- Local algebraic effect theories (Q5120228) (← links)
- Explicit effect subtyping (Q5120231) (← links)
- No value restriction is needed for algebraic effects and handlers (Q5372003) (← links)
- Backtracking with cut via a distributive law and left-zero monoids (Q5372012) (← links)
- An introduction to algebraic effects and handlers (invited tutorial paper) (Q5971390) (← links)
- Reversible monadic computing (Q5971401) (← links)
- Protocol choice and iteration for the free cornering (Q6151626) (← links)
- Modal crash types for intermittent computing (Q6535235) (← links)
- Asymptotic speedup via effect handlers (Q6561531) (← links)
- Signature restriction for polymorphic algebraic effects (Q6594243) (← links)
- Higher-order asynchronous effects (Q6635509) (← links)
- Inductive and coinductive predicate liftings for effectful programs (Q6653761) (← links)
