On the public citation graph

Monads and modular term rewriting

https://doi.org/10.1007/bfb0026982
0 signed · 38 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-18508-9_23openalex-snapshot
Foundations of equational deduction: A categorical treatment of equational proofs and unification algorithms
inferredcites →https://doi.org/10.1007/3-540-61464-8_58openalex-snapshot
Compositional term rewriting: An algebraic proof of Toyama's theorem
inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/978-1-4612-9860-1openalex-snapshot
Algebraic Theories
inferredcites →https://doi.org/10.1007/978-1-4899-0021-0openalex-snapshot
Toposes, Triples and Theories
inferredcites →https://doi.org/10.1007/bfb0013819openalex-snapshot
Generalized sufficient conditions for modular termination of rewriting
inferredcites →https://doi.org/10.1016/0020-0190(87)90039-1openalex-snapshot
On termination of the direct sum of term-rewriting systems
inferredcites →https://doi.org/10.1016/0022-4049(93)90092-8openalex-snapshot
Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads
inferredcites →https://doi.org/10.1016/0304-3975(92)90015-8openalex-snapshot
Modularity of simple termination of term rewriting systems with shared constructors
inferredcites →https://doi.org/10.1016/0304-3975(94)00039-lopenalex-snapshot
On the modularity of termination of term rewriting systems
inferredcites →https://doi.org/10.1093/oso/9780198537618.003.0001openalex-snapshot
Term Rewriting Systems
inferredcites →https://doi.org/10.1109/lics.1989.39194openalex-snapshot
A sufficient condition for the termination of the direct sum of term rewriting systems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jsco.1999.0262openalex-snapshot
A Categorical Critical-pair Completion Algorithm
inferred← citeshttps://doi.org/10.1007/11548133_22openalex-snapshot
Discrete Lawvere Theories
inferred← citeshttps://doi.org/10.1007/3-540-45988-x_3openalex-snapshot
Monads and Modularity
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_5openalex-snapshot
Abstract Modularity
inferred← citeshttps://doi.org/10.1007/s10990-006-8747-5openalex-snapshot
An initial algebra approach to term rewriting systems with variable binders
inferred← citeshttps://doi.org/10.1007/s10990-006-8748-4openalex-snapshot
Explicit substitutions and higher-order syntax
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.02.017openalex-snapshot
Modularity and Implementation of Mathematical Operational Semantics
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.007openalex-snapshot
Discrete Lawvere theories and computational effects
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00248-1openalex-snapshot
Combining word problems through rewriting in categories with products
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00304-4openalex-snapshot
Computing over K-modules
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80360-8openalex-snapshot
Coalgebraic Monads
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80905-8openalex-snapshot
Algebras, Coalgebras, Monads and Comonads
inferred← citeshttps://doi.org/10.1017/s0960129502003912openalex-snapshot
Dualising initial algebras
inferred← citeshttps://doi.org/10.1017/s0960129505004743openalex-snapshot
Monads of coalgebras: rational terms and term graphs
inferred← citeshttps://doi.org/10.1051/ita:2003021openalex-snapshot
Solving Algebraic Equations Using Coalgebra
inferred← citeshttps://doi.org/10.1051/ita:2004016openalex-snapshot
Coproducts of Ideal Monads
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470633openalex-snapshot
A Relational Theory of Monadic Rewriting Systems, Part I
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175807openalex-snapshot
Allegories of Symbolic Manipulations
inferred← citeshttps://doi.org/10.1145/3371099openalex-snapshot
Reduction monads and their signatures
inferred← citeshttps://doi.org/10.1145/581478.581492openalex-snapshot
Composing monads using coproducts
inferred← citeshttps://doi.org/10.1145/888251.888266openalex-snapshot
Term rewriting with variable binding
inferred← citeshttps://doi.org/10.1145/976571.976580openalex-snapshot
Explicit substitutions and higher-order syntax
inferred← citeshttps://doi.org/10.4204/eptcs.183.4openalex-snapshot
Nested Term Graphs (Work In Progress)
inferred← citeshttps://doi.org/10.4204/eptcs.323.8openalex-snapshot
Enriched Lawvere Theories for Operational Semantics
inferred← citeshttps://doi.org/10.48550/arxiv.1910.09162openalex-snapshot
Signatures and models for syntax and operational semantics in the presence of variable binding
inferred← citeshttps://doi.org/10.70675/29271e54z880fz42abz8abazc5a5c49735eeopenalex-snapshot
Signatures and models for syntax and operational semantics in the presence of variable binding
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.