Term-Graph Rewriting Via Explicit Paths

DOI10.1007/978-3-540-70590-1_3zbMath1145.68440OpenAlexW1517691308MaRDI QIDQ3522007

Pierre-Etienne Moreau, Emilie Balland

Publication date: 28 August 2008

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00173535

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Term-Graph Rewriting Via Explicit Paths

Cites Work

• On ``On graph rewritings
• Term-graph Rewriting in Tom Using Relative Positions
• Implementing term rewriting by jungle evaluation
• Term-Graph Rewriting Via Explicit Paths
• Narrowing Data-Structures with Pointers
• CPO models for infinite term rewriting
• Addressed term rewriting systems: application to a typed object calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Term-Graph Rewriting Via Explicit Paths