On the public citation graph

An abstract formulation for rewrite systems

https://doi.org/10.1007/bfb0018358
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-15976-2_24openalex-snapshot
Equational systems for category theory and intuitionistic logic
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/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1007/bfb0063101openalex-snapshot
Review of the elements of 2-categories
inferredcites →https://doi.org/10.1007/bfb0074299openalex-snapshot
Introduction to bicategories
inferredcites →https://doi.org/10.1016/0021-8693(90)90229-hopenalex-snapshot
A 2-categorical pasting theorem
inferredcites →https://doi.org/10.1016/0022-4049(76)90013-xopenalex-snapshot
Limits indexed by category-valued 2-functors

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11539452_24openalex-snapshot
Deriving Weak Bisimulation Congruences from Reduction Systems
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_81openalex-snapshot
Conditional rewriting logic: Deduction, models and concurrency
inferred← citeshttps://doi.org/10.1007/3-540-54496-8_14openalex-snapshot
A 2-category approach to critical pair completion
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_2openalex-snapshot
Context rewriting
inferred← citeshttps://doi.org/10.1007/3-540-59200-8_59openalex-snapshot
Relating two categorical models of term rewriting
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_65openalex-snapshot
CPO models for infinite term rewriting
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-45231-5_15openalex-snapshot
Relative Full Completeness for Bicategorical Cartesian Closed Structure
inferred← citeshttps://doi.org/10.1007/978-3-642-02348-4_14openalex-snapshot
A Heterogeneous Pushout Approach to Term-Graph Transformation
inferred← citeshttps://doi.org/10.1007/978-3-642-33475-7_10openalex-snapshot
A Modular LTS for Open Reactive Systems
inferred← citeshttps://doi.org/10.1007/978-3-7091-6604-8_6openalex-snapshot
Towards a Categorical Calculus for Critical-Pair/Completion
inferred← citeshttps://doi.org/10.1007/bfb0026983openalex-snapshot
A 2-categorical presentation of term graph rewriting
inferred← citeshttps://doi.org/10.1007/bfb0053548openalex-snapshot
Rational term rewriting
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90182-fopenalex-snapshot
Conditional rewriting logic as a unified model of concurrency
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00030-1openalex-snapshot
Tiles, Rewriting Rules and CCS
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)80309-3openalex-snapshot
A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting
inferred← citeshttps://doi.org/10.1017/s0960129500001110openalex-snapshot
A formalism for the specification of essentially-algebraic structures in 2-categories
inferred← citeshttps://doi.org/10.1017/s0960129501003498openalex-snapshot
Double categories: a modular model of multiplicative linear 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.1023/a:1008708924144openalex-snapshot
Iteration 2-theories
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.1109/lics.1998.705656openalex-snapshot
Higher dimensional multigraphs
inferred← citeshttps://doi.org/10.1109/lics.2019.8785708openalex-snapshot
A type theory for cartesian closed bicategories (Extended Abstract)
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175807openalex-snapshot
Allegories of Symbolic Manipulations
inferred← citeshttps://doi.org/10.17863/cam.55080openalex-snapshot
Cartesian closed bicategories: type theory and coherence
inferred← citeshttps://doi.org/10.26226/morressier.604907f51a80aac83ca25d68openalex-snapshot
Relative full completeness for bicategorical cartesian closed structure
inferred← citeshttps://doi.org/10.46298/lmcs-21(3:7)2025openalex-snapshot
Rewriting techniques for relative coherence
inferred← citeshttps://doi.org/10.48550/arxiv.0811.3400openalex-snapshot
A Cloning Pushout Approach to Term-Graph Transformation
inferred← citeshttps://doi.org/10.5281/zenodo.26355openalex-snapshot
Ökologisch-Faunistische Studien An Südbrasilianischen Ameisen.
inferred← citeshttps://doi.org/10.5281/zenodo.41648openalex-snapshot
Making Better Biometric Decisions With Quality And Cohort Information : A Case Study In Fingerprint Verification
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.