Combining algebraic effects with continuations

DOI10.1016/j.tcs.2006.12.026zbMath1111.68067OpenAlexW2072351525MaRDI QIDQ879352

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

Publication date: 11 May 2007

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

Full work available at URL: http://opus.bath.ac.uk/5284/1/Power_TCS_2007_375_1%2D3_20.pdf

zbMATH Keywords

modularitymonadLawvere theorycomputational effect

Mathematics Subject Classification ID

Related Items (16)

Observationally-induced algebras in domain theory ⋮ Observationally-induced Effects in Cartesian Closed Categories ⋮ Unnamed Item ⋮ Discrete Lawvere theories and computational effects ⋮ Combining control effects and their models: game semantics for a hierarchy of static, dynamic and delimited control effects ⋮ A coinductive calculus for asynchronous side-effecting processes ⋮ Smart Choices and the Selection Monad ⋮ Commutativity ⋮ An algebraic theory for shared-state concurrency ⋮ Programming with algebraic effects and handlers ⋮ Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot ⋮ Decomposing Comonad Morphisms. ⋮ Tensors of Comodels and Models for Operational Semantics ⋮ Stateful runners of effectful computations ⋮ Gabriel–Ulmer duality and Lawvere theories enriched over a general base ⋮ The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads
• Notions of computation and monads
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Revised report on the algorithmic language scheme
• Definitional interpreters revisited
• Definitional interpreters for higher-order programming languages
• Modelling environments in call-by-value programming languages.
• Algebraic operations and generic effects
• Pseudo-commutative monads and pseudo-closed 2-categories
• Comparing control constructs by double-barrelled CPS
• Axioms for recursion in call-by-value
• On the call-by-value CPS transform and its semantics
• Combining effects: sum and tensor
• Monads on symmetric monoidal closed categories
• Kan extensions in enriched category theory
• The duality of computation
• Composing monads using coproducts
• A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on
• Semantics of the Domain of Flow Diagrams
• Theories of Programming Languages
• Sound and complete axiomatisations of call-by-value control operators
• Pseudo-commutative Monads
• A type-theoretic foundation of continuations and prompts
• GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
• Some Varieties of Equational Logic

This page was built for publication: Combining algebraic effects with continuations