Term-graph Rewriting in Tom Using Relative Positions

DOI10.1016/j.entcs.2008.03.030zbMath1279.68112OpenAlexW1985354101MaRDI QIDQ2870309

Paul Brauner, Emilie Balland

Publication date: 17 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.030

zbMATH Keywords

rewritingstrategic programmingterm-graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Related Items (1)

Term-Graph Rewriting Via Explicit Paths

Cites Work

• Algebraic approach to single-pushout graph transformation
• On ``On graph rewritings
• Canonical Abstract Syntax Trees
• Narrowing Data-Structures with Pointers
• Addressed term rewriting systems: application to a typed object calculus
• Anti-pattern Matching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Term-graph Rewriting in Tom Using Relative Positions