Monads and modular term rewriting
From MaRDI portal
Recommendations
Cited in
(28)- Monads for the formalization of a pattern matching procedure
- Computing over K-modules
- Coalgebraic monads
- Monadic augment and generalised short cut fusion
- scientific article; zbMATH DE number 431765 (Why is no real title available?)
- Modularity of Confluence
- Modules over Monads and Linearity
- Solving Algebraic Equations Using Coalgebra
- Natural transformations as rewrite rules and monad composition
- Coproducts of Ideal Monads
- scientific article; zbMATH DE number 2086588 (Why is no real title available?)
- scientific article; zbMATH DE number 2111734 (Why is no real title available?)
- Algebras, coalgebras, monads and comonads
- Nested term graphs (work in progress)
- Enriched Lawvere theories for operational semantics
- Problems in rewriting applied to categorical concepts by the example of a computational comonad
- Compositional term rewriting: An algebraic proof of Toyama's theorem
- Modular specification of monads through higher-order presentations
- Modularity and implementation of mathematical operational semantics
- 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
- Monads of coalgebras: rational terms and term graphs
- Modules over relative monads for syntax and semantics
- An initial algebra approach to term rewriting systems with variable binders
- Explicit substitutions and higher-order syntax
- Discrete Lawvere theories and computational effects
- Modules over monads and initial semantics
This page was built for publication: Monads and modular term rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4362961)
