On graph rewritings
From MaRDI portal
Publication:800736
DOI10.1016/0304-3975(84)90021-5zbMath0551.68065OpenAlexW2092445638MaRDI QIDQ800736
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(84)90021-5
Related Items (37)
Term graph rewriting and garbage collection using opfibrations ⋮ Term rewriting in CTΣ ⋮ Redex capturing in term graph rewriting (concise version) ⋮ On ``On graph rewritings ⋮ Comparison of two graph-rewrite systems ⋮ Implementing term rewriting by jungle evaluation ⋮ Lambda calculus with explicit recursion ⋮ Relating graph and term rewriting via Böhm models ⋮ Relational structures and their partial morphisms in view of single pushout rewriting ⋮ Parallelism in single-pushout graph rewriting ⋮ Set-theoretic graph rewriting ⋮ On relating rewriting systems and graph grammars to event structures ⋮ A decade of TAPSOFT ⋮ Single Pushout Rewriting in Comprehensive Systems ⋮ Drags: a compositional algebraic framework for graph rewriting ⋮ Unification of drags and confluence of drag rewriting ⋮ Multilevel graph grammars ⋮ Graph expressions and graph rewritings ⋮ Properties of graphs preserved by relational graph rewritings ⋮ Incremental Update for Graph Rewriting ⋮ Strategic port graph rewriting: an interactive modelling framework ⋮ Confluence for graph transformations ⋮ Relational graph rewritings ⋮ Conditional rewriting logic as a unified model of concurrency ⋮ On categorical graph grammars integrating structural transformations and operations on labels ⋮ Algebraic approach to single-pushout graph transformation ⋮ Parallel and distributed derivations in the single-pushout approach ⋮ Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming ⋮ Categorical principles, techniques and results for high-level-replacement systems in computer science ⋮ On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems ⋮ Single pushout rewriting in comprehensive systems of graph-like structures ⋮ A categorical manifesto ⋮ A Heterogeneous Pushout Approach to Term-Graph Transformation ⋮ Unnamed Item ⋮ Algebraic transformation of unary partial algebras II: Single-pushout approach ⋮ Generating irregular partitionable data structures ⋮ A small final coalgebra theorem
Cites Work
This page was built for publication: On graph rewritings
