scientific article; zbMATH DE number 7438169
From MaRDI portal
Publication:5013826
zbMath1477.18013arXiv1604.01184MaRDI QIDQ5013826
Publication date: 2 December 2021
Full work available at URL: https://arxiv.org/abs/1604.01184
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semantics in the theory of computing (68Q55) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Monoidal categories, symmetric monoidal categories (18M05)
Related Items (3)
Backtracking with cut via a distributive law and left-zero monoids ⋮ Unnamed Item ⋮ List Objects with Algebraic Structure
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The coinductive resumption monad
- Monad transformers as monoid transformers
- Discrete Lawvere theories and computational effects
- Infinite trees and completely iterative theories: A coalgebraic view
- Algebraic operations and generic effects
- Combining effects: sum and tensor
- Monads and monoids on symmetric monoidal closed categories
- Codensity and the ultrafilter monad
- An Equational Metalogic for Monadic Equational Systems
- Fibrational Induction Meets Effects
- Kan Extensions for Program Optimisation Or: Art and Dan Explain an Old Trick
- Backtracking, interleaving, and terminating monad transformers
- Deriving backtracking monad transformers
- A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on
- Notions of computation as monoids
- Categorical fixed point calculus
- Inductive reasoning about effectful data types
- Relating models of backtracking
- Elgot Algebras
- Interleaving data and effects
- Closed categories generated by commutative monads
This page was built for publication:
