Sharing implementations of graph rewriting systems

MaRDI QIDQ2848122zbMATH OpenFDO

Authors Stefano Guerrini

Publication date 25 September 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066105050164

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 1523048
• A general theory of sharing graphs
• Is the Optimal Implementation Inefficient? Elementarily Not
• Sharing in the graph rewriting calculus
• scientific article; zbMATH DE number 1547155

Cited in

(13)

• Comparison of two graph-rewrite systems
• Introducing symmetry to graph rewriting systems with process abstraction
• An abstract concept of optimal implementation
• Implementing \(\mathcal{X}\)
• Towards a sharing strategy for the graph rewriting calculus
• Sharing in the graph rewriting calculus
• scientific article; zbMATH DE number 1231498 (Why is no real title available?)
• scientific article; zbMATH DE number 1523048 (Why is no real title available?)
• Optimal reductions in interaction systems
• Paths, computations and labels in the λ-calculus
• Relating graph and term rewriting via Böhm models
• Extending graph rewriting with copying
• Is the Optimal Implementation Inefficient? Elementarily Not

This page was built for publication: Sharing implementations of graph rewriting systems

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