Discrete Lawvere theories and computational effects
DOI10.1016/J.TCS.2006.07.007zbMATH Open1112.18006OpenAlexW2044178213MaRDI QIDQ860883FDOQ860883
Authors: Martin Hyland, 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.07.007
Recommendations
- Algebra and Coalgebra in Computer Science
- Countable Lawvere theories and computational effects
- Publication:4939149
- scientific article; zbMATH DE number 4058083
- scientific article; zbMATH DE number 2075224
- scientific article; zbMATH DE number 2054655
- Dispersive computational continua
- Discrete and Continuous Simulation
- Computational Conley theory
- Discrete mathematics, discrete physics and numerical methods
Theories (e.g., algebraic theories), structure, and semantics (18C10) Categorical structures (18D99) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- 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
- Title not available (Why is that?)
- Retracted: Semantic domains for combining probability and non-determinism
- Combining algebraic effects with continuations
- Two-dimensional monad theory
- Title not available (Why is that?)
- A Powerdomain Construction
- Title not available (Why is that?)
- Monads on symmetric monoidal closed categories
- Title not available (Why is that?)
- A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on
- Title not available (Why is that?)
- Pseudo-commutative monads and pseudo-closed 2-categories
- Stable power domains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
- Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads
- Why tricategories?
- Algebra and Coalgebra in Computer Science
- Finite-product-preserving functors, Kan extensions, and strongly-finitary 2-monads
- Varieties of chain-complete algebras
- Sketches
- Foundations of Software Science and Computation Structures
Cited In (18)
- Unguarded recursion on coinductive resumptions
- Backtracking with cut via a distributive law and left-zero monoids
- Unguarded recursion on coinductive resumptions
- Algebra and Coalgebra in Computer Science
- Enriched Lawvere theories for operational semantics
- Gabriel–Ulmer duality and Lawvere theories enriched over a general base
- Eilenberg-Moore monoids and backtracking monad transformers
- Combining effects: sum and tensor
- Sum and tensor of quantitative effects
- Graded algebraic theories
- The category theoretic understanding of universal algebra: Lawvere theories and monads
- From semantics to types: the case of the imperative \(\lambda\)-calculus
- Quasivarieties and varieties of ordered algebras: regularity and exactness
- Computational effects and operations: an overview
- Two guarded recursive powerdomains for applicative simulation
- Towards Effects in Mathematical Operational Semantics
- From semantics to types: the case of the imperative \(\lambda\)-calculus
- Tensors of comodels and models for operational semantics
This page was built for publication: Discrete Lawvere theories and computational effects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860883)