On the public citation graph

Graph rewriting in some categories of partial morphisms

https://doi.org/10.1007/bfb0017408
0 signed · 60 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-18771-5_72openalex-snapshot
Graph rewriting with unification and composition
inferredcites →https://doi.org/10.1007/3-540-50667-5_71openalex-snapshot
Jungle evaluation for efficient term rewriting
inferredcites →https://doi.org/10.1007/3-540-53832-1_52openalex-snapshot
Algebraic approach to graph transformation based on single pushout derivations
inferredcites →https://doi.org/10.1007/3-540-53904-2_81openalex-snapshot
Transfinite reductions in orthogonal term rewriting systems
inferredcites →https://doi.org/10.1007/bfb0017401openalex-snapshot
Dactl: An experimental graph rewriting language
inferredcites →https://doi.org/10.1016/0304-3975(80)90016-xopenalex-snapshot
Parallelism and concurrency of graph manipulations
inferredcites →https://doi.org/10.1016/0304-3975(84)90021-5openalex-snapshot
On graph rewritings
inferredcites →https://doi.org/10.1016/0304-3975(87)90079-xopenalex-snapshot
On “on graph rewritings”
inferredcites →https://doi.org/10.1016/0890-5401(88)90034-xopenalex-snapshot
Categories of partial maps
inferredcites →https://doi.org/10.1109/swat.1973.11openalex-snapshot
Graph-grammars: An algebraic approach
inferredcites →https://doi.org/10.1145/77606.77612openalex-snapshot
A correctness proof for combinator reduction with cycles
inferredcites →https://doi.org/10.1515/9783112620267-020openalex-snapshot
Jungle Evaluation for Efficient Term Rewriting

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.1997.2651openalex-snapshot
Lambda Calculus with Explicit Recursion
inferred← citeshttps://doi.org/10.1007/11841883_4openalex-snapshot
Sesqui-Pushout Rewriting
inferred← citeshttps://doi.org/10.1007/3-540-36280-0_1openalex-snapshot
A Relation-Algebraic Approach to Graph Structure Transformation
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_16openalex-snapshot
Logic programming as hypergraph Rewriting
inferred← citeshttps://doi.org/10.1007/3-540-56402-0_52openalex-snapshot
Single vs. double pushout derivations of graphs
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_14openalex-snapshot
Relational structures and their partial morphisms in view of single pushout rewriting
inferred← citeshttps://doi.org/10.1007/3-540-62559-3_19openalex-snapshot
Algebraic graph derivations for graphical calculi
inferred← citeshttps://doi.org/10.1007/978-3-030-23611-3_3openalex-snapshot
Adhesive Subcategories of Functor Categories with Instantiation to Partial Triple Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-51372-6_6openalex-snapshot
Single Pushout Rewriting in Comprehensive Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-09843-7_9openalex-snapshot
Computational Category-Theoretic Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-319-09108-2_12openalex-snapshot
On Pushouts of Partial Maps
inferred← citeshttps://doi.org/10.1007/978-3-319-21145-9_1openalex-snapshot
Polymorphic Sesqui-Pushout Graph Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-319-40530-8_2openalex-snapshot
Sesqui-Pushout Rewriting with Type Refinements
inferred← citeshttps://doi.org/10.1007/978-3-319-50230-4_10openalex-snapshot
SPO-Rewriting of Constrained Partial Algebras
inferred← citeshttps://doi.org/10.1007/978-3-319-92991-0_8openalex-snapshot
Characterisation of Parallel Independence in AGREE-Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-540-87405-8_43openalex-snapshot
Grammar Morphisms and Weakly Adhesive Categories
inferred← citeshttps://doi.org/10.1007/978-3-642-15928-2_15openalex-snapshot
Graph Rewriting in Span-Categories
inferred← citeshttps://doi.org/10.1007/978-3-642-15928-2_17openalex-snapshot
Hereditary Pushouts Reconsidered
inferred← citeshttps://doi.org/10.1007/978-3-642-33654-6_8openalex-snapshot
Refined Graph Rewriting in Span-Categories
inferred← citeshttps://doi.org/10.1007/978-3-642-54804-8_25openalex-snapshot
Polymorphic Single-Pushout Graph Transformation
inferred← citeshttps://doi.org/10.1007/bf00872984openalex-snapshot
Categorical principles, techniques and results for high-level-replacement systems in computer science
inferred← citeshttps://doi.org/10.1007/bfb0013469openalex-snapshot
An algebra of graphs and graph rewriting
inferred← citeshttps://doi.org/10.1007/bfb0017392openalex-snapshot
Graph grammars and logic programming
inferred← citeshttps://doi.org/10.1007/s00165-021-00555-2openalex-snapshot
Comprehensive Systems: A formal foundation for Multi-Model Consistency Management
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/0304-3975(93)90063-yopenalex-snapshot
Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00301-4openalex-snapshot
Locating the contractum in the double pushout approach
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90090-6openalex-snapshot
Term graph rewriting and garbage collection using opfibrations
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.06.041openalex-snapshot
Towards Secrecy for Rewriting in Weakly Adhesive Categories
inferred← citeshttps://doi.org/10.1016/j.jlamp.2020.100565openalex-snapshot
Double-pushout-rewriting in S-Cartesian functor categories: Rewriting theory and application to partial triple graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.04.006openalex-snapshot
Partial pullback complement rewriting
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.03.021openalex-snapshot
Partial pushout semantics of generics in DOL
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.07.002openalex-snapshot
Single pushout rewriting in comprehensive systems of graph-like structures
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.11.007openalex-snapshot
Partial pullback complement rewriting along admissible matches
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00282-xopenalex-snapshot
Algebraic transformation of unary partial algebras II: Single-pushout approach
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80179-3openalex-snapshot
Some Properties of Non-Orthogonal Term Graph Rewriting
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80198-7openalex-snapshot
Hypergraph Rewriting Using Conformisms
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80205-1openalex-snapshot
Semagraph: the Theory and Practice of Term Graph Rewriting
inferred← citeshttps://doi.org/10.1017/s0960129500001353openalex-snapshot
Parallelism and concurrency in high-level replacement systems
inferred← citeshttps://doi.org/10.1017/s0960129500070092openalex-snapshot
Event structures and non-orthogonal term graph rewriting
inferred← citeshttps://doi.org/10.1093/jigpal/6.2.259openalex-snapshot
Relational treatment of term graphs with bound variables
inferred← citeshttps://doi.org/10.1109/tsmcb.2008.920227openalex-snapshot
Multihierarchical Interactive Task Planning: Application to Mobile Robotics
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.73.1036openalex-snapshot
On Single-Pushout Rewriting of Partial Algebras
inferred← citeshttps://doi.org/10.3233/fi-1996-263401openalex-snapshot
EQUATIONAL TERM GRAPH REWRITING
inferred← citeshttps://doi.org/10.3233/fi-2012-704openalex-snapshot
Adhesivity with Partial Maps instead of Spans
inferred← citeshttps://doi.org/10.4204/eptcs.309.2openalex-snapshot
Sesqui-Pushout Rewriting: Concurrency, Associativity and Rule Algebra Framework
inferred← citeshttps://doi.org/10.4204/eptcs.48.3openalex-snapshot
Term Graph Rewriting and Parallel Term Rewriting
inferred← citeshttps://doi.org/10.48550/arxiv.0801.1245openalex-snapshot
Matrix Graph Grammars
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.