Extending graph rewriting with copying

DOI10.1007/3-540-57787-4_4MaRDI QIDQ5096274zbMATH OpenOpenAlexFDO

Authors Erik Barendsen, Sjaak Smetsers

Publication date 16 August 2022

Published in Graph Transformations in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57787-4_4

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Graph Transformations
• On graph rewritings
• scientific article; zbMATH DE number 3878382
• Efficient graph rewriting and its implementation
• Sharing implementations of graph rewriting systems
• Graph expressions and graph rewritings
• scientific article; zbMATH DE number 4049096
• Graph Rewriting Components
• Concurrent graph and term graph rewriting
• Concurrent Rewriting for Graphs with Equivalences

Cites work

• scientific article; zbMATH DE number 4030948 (Why is no real title available?)
• Parallel graph rewriting on loosely coupled machine architectures
• PARLE '91. Parallel architectures and languages Europe. Vol. 1: Parallel architectures and algorithms. Eindhoven, The Netherlands, June 10--13, 1991. Proceedings
• Tree-Manipulating Systems and Church-Rosser Theorems

Cited in

(6)

• Lazy context cloning for non-deterministic graph rewriting
• scientific article; zbMATH DE number 919844 (Why is no real title available?)
• Copy-on-write in the PHP language
• Constructions of copy rules
• Parallel graph rewriting on loosely coupled machine architectures
• Linearity and uniqueness: an entente cordiale

This page was built for publication: Extending graph rewriting with copying

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096274)