Combining effects: sum and tensor

DOI10.1016/j.tcs.2006.03.013zbMath1096.68088OpenAlexW1980827618MaRDI QIDQ2500483

Gordon D. Plotkin, A. John Power, J. M. E. Hyland

Publication date: 16 August 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.03.013

zbMATH Keywords

modularity monad Lawvere theory computational effect

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (62)

Normalization by evaluation and algebraic effects ⋮ Monads for behaviour ⋮ Stream processors and comodels ⋮ Kleene Monads: Handling Iteration in a Framework of Generic Effects ⋮ Runners in Action ⋮ The coinductive resumption monad ⋮ Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation ⋮ Quantitative logics for equivalence of effectful programs ⋮ Combining algebraic effect descriptions using the tensor of complete lattices ⋮ Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies ⋮ ``Keep definition, change category -- a practical approach to state-based system calculi ⋮ Lawvere theories enriched over a general base ⋮ Category Theoretic Understandings of Universal Algebra and its Dual: Monads and Lawvere Theories, Comonads and What? ⋮ Convexity via Weak Distributive Laws ⋮ Generic models for computational effects ⋮ Discrete Lawvere theories and computational effects ⋮ Combining algebraic effects with continuations ⋮ Notions of Bidirectional Computation and Entangled State Monads ⋮ Fusion for Free ⋮ A coinductive calculus for asynchronous side-effecting processes ⋮ Monad transformers as monoid transformers ⋮ Generic weakest precondition semantics from monads enriched with order ⋮ When programs have to watch paint dry ⋮ Smart Choices and the Selection Monad ⋮ Monoidal indeterminates and categories of possible worlds ⋮ Structured handling of scoped effects ⋮ Duoidally enriched Freyd categories ⋮ An algebraic theory for shared-state concurrency ⋮ Cartesian effect categories are Freyd-categories ⋮ Graded algebraic theories ⋮ Unnamed Item ⋮ Interleaving data and effects ⋮ No value restriction is needed for algebraic effects and handlers ⋮ Backtracking with cut via a distributive law and left-zero monoids ⋮ An introduction to algebraic effects and handlers (invited tutorial paper) ⋮ Unguarded recursion on coinductive resumptions ⋮ Unnamed Item ⋮ Equational Theories of Abnormal Termination Based on Kleene Algebra ⋮ Programming with algebraic effects and handlers ⋮ Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot ⋮ Combining semilattices and semimodules ⋮ Complete Elgot monads and coalgebraic resumptions ⋮ Free-algebra models for the \(\pi \)-calculus ⋮ Tensors of Comodels and Models for Operational Semantics ⋮ Towards Effects in Mathematical Operational Semantics ⋮ Lawvere Categories as Composed PROPs ⋮ Category theory for operational semantics ⋮ Monads for the formalization of a pattern matching procedure ⋮ Coalgebraic semantics for timed processes ⋮ A computational treatment of anaphora and its algorithmic implementation ⋮ Unnamed Item ⋮ Dependent Types and Fibred Computational Effects ⋮ A New Foundation for Finitary Corecursion ⋮ Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular ⋮ A new foundation for finitary corecursion and iterative algebras ⋮ Gabriel–Ulmer duality and Lawvere theories enriched over a general base ⋮ The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads ⋮ Algebraic presentation of semifree monads ⋮ Probabilistic Completion of Nondeterministic Models ⋮ Bifold algebras and commutants for enriched algebraic theories ⋮ Not by equations alone: Reasoning with extensible effects ⋮ Comonadic Notions of Computation

Uses Software

Haskell

Cites Work

This page was built for publication: Combining effects: sum and tensor