Algebraic presentation of semifree monads
From MaRDI portal
Publication:2104481
DOI10.1007/978-3-031-10736-8_6OpenAlexW4286599961MaRDI QIDQ2104481
Jörg Endrullis, Helle Hvid Hansen, Aloïs Rosset
Publication date: 7 December 2022
Full work available at URL: https://arxiv.org/abs/2205.05392
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Notions of computation and monads
- The weak theory of monads
- On the algebraic structure of rooted trees
- Semantics of weakening and contraction
- Infinite trees and completely iterative theories: A coalgebraic view
- Iterated covariant powerset is not a monad
- Learning automata with side-effects
- Combining semilattices and semimodules
- The Vietoris monad and weak distributive laws
- Trace semantics via determinization
- Combining effects: sum and tensor
- Coproducts of Monads on Set
- Convexity, Duality and Effects
- Modular Monad Transformers
- Coproducts of Ideal Monads
- The linear-non-linear substitution 2-monad
- Monads and Quantitative Equational Theories for Nondeterminism and Probability
- Combining probabilistic and non-deterministic choice via weak distributive laws
- Interaction Laws of Monads and Comonads
- Generic Trace Semantics and Graded Monads.
- Lattice Automata
- Distributing probability over non-determinism
- Category Theory
- Algebra and Coalgebra in Computer Science
This page was built for publication: Algebraic presentation of semifree monads
