Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation
From MaRDI portal
Publication:831147
DOI10.1016/j.tcs.2021.02.038zbMath1497.68095OpenAlexW3135073116MaRDI QIDQ831147
Philippe de Groote, Jirka Maršík, Maxime Amblard
Publication date: 10 May 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.02.038
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Programming with algebraic effects and handlers
- Notions of computation and monads
- Combinatory reduction systems: Introduction and survey
- One-shot algebraic effects as coroutines
- A sound and complete logic for algebraic effects
- Combining effects: sum and tensor
- General semantics
- A lattice-theoretical fixpoint theorem and its applications
- The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads
- Handling Algebraic Effects
- Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
- Data types à la carte
- Handlers of Algebraic Effects
- Not by equations alone: Reasoning with extensible effects
- Enriched Lawvere Theories for Operational Semantics
- Effect handlers via generalised continuations
- Doo bee doo bee doo
- Continuation passing style for effect handlers
- Local algebraic effect theories
- Dynamic predicate logic
- Programming and reasoning with algebraic effects and dependent types
- Handlers in action
- Applicative programming with effects
- Intensional interpretations of functionals of finite type I
- Inductive-data-type systems
- An introduction to algebraic effects and handlers (invited tutorial paper)
- Shallow effect handlers
This page was built for publication: Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation
