Combining algebraic effects with continuations
DOI10.1016/J.TCS.2006.12.026zbMATH Open1111.68067OpenAlexW2072351525MaRDI QIDQ879352FDOQ879352
Gordon D. Plotkin, Paul Blain Levy, Martin Hyland, 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
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theories (e.g., algebraic theories), structure, and semantics (18C10) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Eilenberg-Moore and Kleisli constructions for monads (18C20) Semantics in the theory of computing (68Q55)
Cites Work
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Modelling environments in call-by-value programming languages.
- Algebraic operations and generic effects
- Combining effects: sum and tensor
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Notions of computation and monads
- Computational effects and operations: an overview
- Title not available (Why is that?)
- From comodels to coalgebras: state and arrays
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some Varieties of Equational Logic
- Monads on symmetric monoidal closed categories
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Kan extensions in enriched category theory
- The duality of computation
- A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on
- Pseudo-commutative monads and pseudo-closed 2-categories
- Definitional interpreters revisited
- Definitional interpreters for higher-order programming languages
- Title not available (Why is that?)
- Revised report on the algorithmic language scheme
- Title not available (Why is that?)
- Theories of Programming Languages
- Composing monads using coproducts
- Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads
- Title not available (Why is that?)
- Comparing control constructs by double-barrelled CPS
- Axioms for recursion in call-by-value
- On the call-by-value CPS transform and its semantics
- Monads and adjunctions for global exceptions
- Semantics of the Domain of Flow Diagrams
- 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
Cited In (17)
- A coinductive calculus for asynchronous side-effecting processes
- Observationally-induced algebras in domain theory
- Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot
- Discrete Lawvere theories and computational effects
- Gabriel–Ulmer duality and Lawvere theories enriched over a general base
- Smart Choices and the Selection Monad
- Commutativity
- Decomposing Comonad Morphisms.
- Sum and tensor of quantitative effects
- Tensors of Comodels and Models for Operational Semantics
- Title not available (Why is that?)
- The category theoretic understanding of universal algebra: Lawvere theories and monads
- Combining control effects and their models: game semantics for a hierarchy of static, dynamic and delimited control effects
- Programming with algebraic effects and handlers
- An algebraic theory for shared-state concurrency
- Stateful runners of effectful computations
- Observationally-induced Effects in Cartesian Closed Categories
This page was built for publication: Combining algebraic effects with continuations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879352)
