On the public citation graph
Rational term rewriting
0 signed · 44 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1995.1075openalex-snapshot
Transfinite Reductions in Orthogonal Term Rewriting Systems
inferredcites →https://doi.org/10.1007/3-540-07854-1_169openalex-snapshot
Some fundamentals of order-algebraic semantics
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-53904-2_82openalex-snapshot
Redex capturing in term graph rewriting (concise version)
inferredcites →https://doi.org/10.1007/3-540-58338-6_58openalex-snapshot
Solving polynomial fixed point equations
inferredcites →https://doi.org/10.1007/3-540-60043-4_65openalex-snapshot
CPO models for infinite term rewriting
inferredcites →https://doi.org/10.1007/978-1-4613-8177-8_6openalex-snapshot
Monadic Computation and Iterative Algebraic Theories
inferredcites →https://doi.org/10.1007/978-1-4613-8177-8_7openalex-snapshot
On the Algebraic Structure of Rooted Trees
inferredcites →https://doi.org/10.1007/bfb0013837openalex-snapshot
Axiomatizing permutation equivalence in the λ-calculus
inferredcites →https://doi.org/10.1007/bfb0018358openalex-snapshot
An abstract formulation for rewrite systems
inferredcites →https://doi.org/10.1016/0022-0000(78)90024-7openalex-snapshot
On the algebraic structure of rooted trees
inferredcites →https://doi.org/10.1016/0022-0000(79)90032-1openalex-snapshot
Regular trees and the free iterative theory
inferredcites →https://doi.org/10.1016/0304-3975(92)90087-vopenalex-snapshot
An algebraic semantics for structured transition systems and its application to logic programs
inferredcites →https://doi.org/10.1016/0304-3975(92)90182-fopenalex-snapshot
Conditional rewriting logic as a unified model of concurrency
inferredcites →https://doi.org/10.1016/s0022-0000(76)80030-xopenalex-snapshot
Varieties of ordered algebras
inferredcites →https://doi.org/10.1017/s0960129500000980openalex-snapshot
Axiomatizing permutation equivalence
inferredcites →https://doi.org/10.1073/pnas.50.5.869openalex-snapshot
FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
inferredcites →https://doi.org/10.1142/s0129054190000266openalex-snapshot
REDEX CAPTURING IN TERM GRAPH REWRITING
inferredcites →https://doi.org/10.1145/177492.177577openalex-snapshot
On the adequacy of graph rewriting for simulating term rewriting
inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
inferredcites →https://doi.org/10.1145/75277.75299openalex-snapshot
Rewrite, rewrite, rewrite, rewrite, rewrite...
inferredcites →https://doi.org/10.1145/77606.77612openalex-snapshot
A correctness proof for combinator reduction with cycles
inferredcites →https://doi.org/10.3233/fi-1980-3405openalex-snapshot
The metric space of infinite trees. Algebraic and topological properties
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2002.3176openalex-snapshot
Context-Sensitive Rewriting Strategies
inferred← citeshttps://doi.org/10.1007/3-540-64299-4_36openalex-snapshot
An inductive view of graph transformation
inferred← citeshttps://doi.org/10.1007/978-3-030-68195-1_15openalex-snapshot
Commutative Rational Term Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-540-70590-1_3openalex-snapshot
Term-Graph Rewriting Via Explicit Paths
inferred← citeshttps://doi.org/10.1007/978-3-642-33654-6_12openalex-snapshot
Rational Term Rewriting Revisited: Decidability and Confluence
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00165-7openalex-snapshot
A causal semantics for CCS via rewriting logic
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00191-4openalex-snapshot
GETGRATS A summary of scientific results (with annotated bibliography)
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80195-6openalex-snapshot
Categorical rewriting of term-like structures
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80023-4openalex-snapshot
CCS Semantics via Proved Transition Systems and Rewriting Logic
inferred← citeshttps://doi.org/10.1023/a:1008647417502openalex-snapshot
An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories
inferred← citeshttps://doi.org/10.1051/ita:1999128openalex-snapshot
Rewriting on cyclic structures: Equivalence between the operational and the categorical description
inferred← citeshttps://doi.org/10.25148/etd.fi15101455openalex-snapshot
An integrated framework for ensuring the quality of software design
inferred← citeshttps://doi.org/10.5281/zenodo.26355openalex-snapshot
Ökologisch-Faunistische Studien An Südbrasilianischen Ameisen.
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.