Combining semilattices and semimodules

DOI10.1007/978-3-030-71995-1_6MaRDI QIDQ2233397zbMATH OpenOpenAlexFDO

Authors Filippo Bonchi, Alessio Santamaria

Publication date 18 October 2021

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2012.14778

zbMATH Keywords

monadsalgebraic theoriesweak distributive laws

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3549200 (Why is no real title available?)
• scientific article; zbMATH DE number 1304993 (Why is no real title available?)
• A category theoretic formulation for Engeler-style models of the untyped \(\lambda\)-calculus
• A coalgebraic perspective on linear weighted automata
• A tutorial on coinductive stream calculus and signal flow graphs
• Automata Learning
• Bialgebras for structural operational semantics: an introduction
• Coalgebra learning via duality
• Coalgebraic Trace Semantics via Forgetful Logics
• Coalgebraic trace semantics for combined possibilitistic and probabilistic systems
• Coinduction up-to in a fibrational setting
• Combining effects: sum and tensor
• Combining probabilistic and non-deterministic choice via weak distributive laws
• Combining semilattices and semimodules
• Distributing probability over non-determinism
• Generalizing determinization from automata to coalgebras
• Generic Trace Semantics via Coinduction
• Generic weakest precondition semantics from monads enriched with order
• Handbook of weighted automata
• Iterated covariant powerset is not a monad
• Lattice-theoretic progress measures and coalgebraic model checking
• Learning weighted automata over principal ideal domains
• Monad compositions. I: General constructions and recursive distributive laws
• Monoid-labeled transition systems
• Notions of computation and monads
• Relation lifting, a survey
• Reports of the Midwest category seminar. IV
• Sound up-to techniques and complete abstract domains
• The Vietoris monad and weak distributive laws
• The monads of classical algebra are seldom weakly Cartesian
• The weak theory of monads
• Up-to techniques for behavioural metrics via fibrations
• Up-to techniques for branching bisimilarity
• Weak distributive laws

Cited in

(7)

• Algebraic presentation of semifree monads
• Combining semilattices and semimodules
• Sum and tensor of quantitative effects
• Preservation and reflection of bisimilarity via invertible steps
• Combining Semilattices and Semimodules
• Semialgebras and weak distributive laws
• Convexity via Weak Distributive Laws

This page was built for publication: Combining semilattices and semimodules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233397)