On Term-Graph Rewrite Strategies

DOI10.1016/j.entcs.2008.03.056zbMath1279.68115OpenAlexW1983495369MaRDI QIDQ2873679

Rachid Echahed

Publication date: 24 January 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.03.056

zbMATH Keywords

graph rewrite systemsrewrite strategiesterm-graphs

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (max. 100)

Workshop on Graph Computation Models

Uses Software

• DACTL

Cites Work

• Implementing term rewrite languages in DACTL
• Computing in systems described by equations
• Sequentiality in orthogonal term rewriting systems
• LEAN: An intermediate language based on graph rewriting
• Transfinite reductions in orthogonal term rewriting systems
• Double-pushout graph transformation revisited
• Lazy Context Cloning for Non-Deterministic Graph Rewriting
• Modeling Pointer Redirection as Cyclic Term-graph Rewriting
• Handbook of Graph Grammars and Computing by Graph Transformation
• Handbook of Graph Grammars and Computing by Graph Transformation
• Non Strict Confluent Rewrite Systems for Data-Structures with Pointers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Term-Graph Rewrite Strategies