Introducing , a -calculus for effectful computation
From MaRDI portal
Publication:831147
DOI10.1016/J.TCS.2021.02.038zbMATH Open1497.68095OpenAlexW3135073116MaRDI QIDQ831147FDOQ831147
Authors: Jirka Maršík, Maxime Amblard, Philippe de Groote
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Programming with algebraic effects and handlers
- Title not available (Why is that?)
- 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
- Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
- Handlers of Algebraic Effects
- Handlers in action
- Notions of computation and monads
- Combinatory reduction systems: Introduction and survey
- Computational effects and operations: an overview
- Title not available (Why is that?)
- Dynamic predicate logic
- Intensional interpretations of functionals of finite type I
- Title not available (Why is that?)
- An introduction to algebraic effects and handlers (invited tutorial paper)
- Applicative programming with effects
- Title not available (Why is that?)
- Title not available (Why is that?)
- One-shot algebraic effects as coroutines
- A sound and complete logic for algebraic effects
- Handling algebraic effects
- Data types à la carte
- 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
- Programming and reasoning with algebraic effects and dependent types
- Title not available (Why is that?)
- Inductive-data-type systems
- Shallow effect handlers
Cited In (5)
- Safe operators: Brackets closed forever. Optimizing optimal \(\lambda\)-calculus implementations
- Algebraic effects for extensible dynamic semantics
- Introducing a calculus of effects and handlers for natural language semantics
- Programming in the λ-Calculus: From Church to Scott and Back
- Equational programming in \(\lambda\)-calculus via SL-systems. Part 1
Uses Software
This page was built for publication: Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831147)