Generic models for computational effects
DOI10.1016/J.TCS.2006.08.006zbMATH Open1123.18005OpenAlexW2158242393MaRDI QIDQ860841FDOQ860841
Authors: John Power
Publication date: 9 January 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.08.006
Recommendations
Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Eilenberg-Moore and Kleisli constructions for monads (18C20) Categorical semantics of formal languages (18C50) Foundations, relations to logic and deductive systems (18A15)
Cites Work
- Modelling environments in call-by-value programming languages.
- Algebraic operations and generic effects
- Combining effects: sum and tensor
- Title not available (Why is that?)
- Premonoidal categories and notions of computation
- 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?)
- A universal property of the convolution monoidal structure
- Two-dimensional monad theory
- Introduction to extensive and distributive categories
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semantics for algebraic operations
- Countable Lawvere theories and computational effects
- Premonoidal categories as categories with algebraic structure
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Foundations of Software Science and Computation Structures
Cited In (18)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Promonads and String Diagrams for Effectful Categories
- Foundations of Software Science and Computation Structures
- Freyd categories are enriched Lawvere theories
- Graded Hoare logic and its categorical semantics
- Commutative semantics for probabilistic programming
- Modelling environments in call-by-value programming languages.
- Parameterised notions of computation
- Algebraic operations and generic effects
- Instances of computational effects: an algebraic perspective
- What is a categorical model of arrows?
- Axiomatics for data refinement in call by value programming languages
- Title not available (Why is that?)
- The category theoretic understanding of universal algebra: Lawvere theories and monads
- From semantics to types: the case of the imperative \(\lambda\)-calculus
- From semantics to types: the case of the imperative \(\lambda\)-calculus
- Cartesian effect categories are Freyd-categories
This page was built for publication: Generic models for computational effects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860841)