Combining semilattices and semimodules
From MaRDI portal
Publication:2233397
DOI10.1007/978-3-030-71995-1_6MaRDI QIDQ2233397
Filippo Bonchi, Alessio Santamaria
Publication date: 18 October 2021
Full work available at URL: https://arxiv.org/abs/2012.14778
Related Items
Convexity via Weak Distributive Laws, Preservation and reflection of bisimilarity via invertible steps, Algebraic presentation of semifree monads, Combining semilattices and semimodules
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relation lifting, a survey
- A coalgebraic perspective on linear weighted automata
- Bialgebras for structural operational semantics: an introduction
- Notions of computation and monads
- Handbook of weighted automata
- Generic weakest precondition semantics from monads enriched with order
- The weak theory of monads
- Iterated covariant powerset is not a monad
- Learning weighted automata over principal ideal domains
- Combining semilattices and semimodules
- The monads of classical algebra are seldom weakly Cartesian
- Coalgebra learning via duality
- The Vietoris monad and weak distributive laws
- Combining effects: sum and tensor
- Reports of the Midwest category seminar. IV
- A tutorial on coinductive stream calculus and signal flow graphs
- Lattice-theoretic progress measures and coalgebraic model checking
- Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems
- Coalgebraic Trace Semantics via Forgetful Logics
- Up-to Techniques for Branching Bisimilarity
- Coinduction up-to in a fibrational setting
- Generalizing determinization from automata to coalgebras
- Monoid-labeled transition systems
- Up-To Techniques for Behavioural Metrics via Fibrations
- Sound up-to techniques and Complete abstract domains
- Combining probabilistic and non-deterministic choice via weak distributive laws
- Automata Learning
- Generic Trace Semantics via Coinduction
- Distributing probability over non-determinism
