Monads, partial evaluations, and rewriting

DOI10.1016/J.ENTCS.2020.09.007MaRDI QIDQ2133473zbMATH OpenOpenAlexWikidataFDO

Authors Tobias Fritz, Paolo Perrone

Publication date 29 April 2022

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

zbMATH Keywords

bar constructionhigher dimensional rewritingmonadsrewritingsimplicial setsstochastic dominance

Mathematics Subject Classification ID

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

Cites work

• A probability monad as the colimit of spaces of finite samples
• Choquet order and simplices with applications in probabilistic models
• Classifying spaces and spectral sequences
• Directed algebraic topology. Models of non-reversible worlds
• From probability monads to commutative effectuses
• Higher-dimensional word problems with applications to equational logic
• scientific article; zbMATH DE number 2125667 (Why is no real title available?)
• scientific article; zbMATH DE number 2134022 (Why is no real title available?)
• scientific article; zbMATH DE number 3764843 (Why is no real title available?)
• scientific article; zbMATH DE number 3434546 (Why is no real title available?)
• scientific article; zbMATH DE number 789389 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• Stochastic Dominance and Moments of Distributions
• The category theoretic understanding of universal algebra: Lawvere theories and monads
• The monad of probability measures over compact ordered spaces and its Eilenberg-Moore algebras
• The monads of classical algebra are seldom weakly Cartesian
• Towards 3-dimensional rewriting theory

Cited in

(26)

• Monads for the formalization of a pattern matching procedure
• Kan extensions are partial colimits
• Tackling the awkward squad: Monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell
• Adaptable software -- modular extensible monadic entry-pointless type checker in Haskell
• Monadic augment and generalised short cut fusion
• Partiality, Revisited
• scientific article; zbMATH DE number 5944670 (Why is no real title available?)
• scientific article; zbMATH DE number 5598380 (Why is no real title available?)
• Synthesizing Monadic Predicates
• Iterative reflections of monads
• Comprehending monads
• scientific article; zbMATH DE number 7362470 (Why is no real title available?)
• scientific article; zbMATH DE number 7533352 (Why is no real title available?)
• Operational semantics using the partiality monad
• Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code
• Monadic augment and generalised short cut fusion
• Affine Monads and Side-Effect-Freeness
• Modules over relative monads for syntax and semantics
• Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot
• Representable Markov categories and comparison of statistical experiments in categorical probability
• Smart Choices and the Selection Monad
• scientific article; zbMATH DE number 7692241 (Why is no real title available?)
• Monads, partial evaluations, and rewriting
• Monadic monadic second order logic
• Probability monads with submonads of deterministic states
• Probabilistic predicate transformers. II: Partially observable probability

This page was built for publication: Monads, partial evaluations, and rewriting

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