On graph rewritings
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3466555 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- scientific article; zbMATH DE number 3388535 (Why is no real title available?)
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- The lambda calculus, its syntax and semantics
Cited in
(55)- On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
- Algebraic approach to single-pushout graph transformation
- Categorical principles, techniques and results for high-level-replacement systems in computer science
- scientific article; zbMATH DE number 1166252 (Why is no real title available?)
- On ``On graph rewritings
- Extending graph rewriting with copying
- Term graph rewriting and garbage collection using opfibrations
- Set-theoretic graph rewriting
- Computing with graph rewriting systems with priorities
- Comparison of two graph-rewrite systems
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
- A categorical manifesto
- The first-order theory of ground tree rewrite graphs
- Confluence of indirection reductions in graph rewrite systems
- Properties of graphs preserved by relational graph rewritings
- Multilevel graph grammars
- On the reachability of a version of graph-rewriting system
- The contractum in algebraic graph rewriting
- Algebraic transformation of unary partial algebras II: Single-pushout approach
- A Heterogeneous Pushout Approach to Term-Graph Transformation
- A small final coalgebra theorem
- On categorical graph grammars integrating structural transformations and operations on labels
- Lambda calculus with explicit recursion
- Parallelism in single-pushout graph rewriting
- Graph rewriting for the π-calculus
- Confluence of graph rewriting with interfaces
- Incremental update for graph rewriting
- Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models
- Single pushout rewriting in comprehensive systems
- Single pushout rewriting in comprehensive systems of graph-like structures
- Graph expressions and graph rewritings
- scientific article; zbMATH DE number 1418367 (Why is no real title available?)
- Strategic port graph rewriting: an interactive modelling framework
- Algebraic properties and transformations of monographs
- Implementing term rewriting by jungle evaluation
- Redex capturing in term graph rewriting (concise version)
- Unification of drags and confluence of drag rewriting
- Note on node-rewriting graph grammars
- Drags: a compositional algebraic framework for graph rewriting
- Relating graph and term rewriting via Böhm models
- On relating rewriting systems and graph grammars to event structures
- Conditional rewriting logic as a unified model of concurrency
- Relational structures and their partial morphisms in view of single pushout rewriting
- scientific article; zbMATH DE number 165003 (Why is no real title available?)
- scientific article; zbMATH DE number 177452 (Why is no real title available?)
- Generating irregular partitionable data structures
- Term rewriting in \(\mathrm{CT}_\Sigma \)
- A local graph-rewriting system for deciding equality in sum-product theories
- scientific article; zbMATH DE number 1638662 (Why is no real title available?)
- scientific article; zbMATH DE number 4049096 (Why is no real title available?)
- A decade of TAPSOFT. Aspects of progress and prospects in theory and practice of software development
- Confluence for graph transformations
- Relational graph rewritings
- Parallel and distributed derivations in the single-pushout approach
- Thermodynamic Graph-Rewriting
This page was built for publication: On graph rewritings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800736)
