Monads, partial evaluations, and rewriting

DOI10.1016/j.entcs.2020.09.007OpenAlexW2896200016WikidataQ113317302 ScholiaQ113317302MaRDI QIDQ2133473

Tobias Fritz, Paolo Perrone

Publication date: 29 April 2022

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

zbMATH Keywords

simplicial setsrewritingbar constructionstochastic dominancemonadshigher dimensional rewriting

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Kan extensions are partial colimits, Representable Markov categories and comparison of statistical experiments in categorical probability, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Higher-dimensional word problems with applications to equational logic
• Choquet order and simplices with applications in probabilistic models
• From probability monads to commutative effectuses
• The monads of classical algebra are seldom weakly Cartesian
• The monad of probability measures over compact ordered spaces and its Eilenberg-Moore algebras
• Classifying spaces and spectral sequences
• The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads
• Stochastic Dominance and Moments of Distributions
• A Probability Monad as the Colimit of Spaces of Finite Samples
• Towards 3-Dimensional Rewriting Theory