Term-graph rewriting in \textsc{Tom} using relative positions

DOI10.1016/J.ENTCS.2008.03.030MaRDI QIDQ2870309zbMATH OpenOpenAlexFDO

Authors Emilie Balland, Paul Brauner

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

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

Recommendations

• Term graph rewriting
• scientific article; zbMATH DE number 234035
• Term-Graph Rewriting Via Explicit Paths
• Term graph rewriting and parallel term rewriting
• On term-graph rewrite strategies
• Essentials of term graph rewriting
• Transitive term graph rewriting
• Graph reducibility of term rewriting systems
• Inductively Sequential Term-Graph Rewrite Systems
• scientific article; zbMATH DE number 177461

Cites work

• Addressed term rewriting systems: application to a typed object calculus
• Algebraic approach to single-pushout graph transformation
• Anti-pattern Matching
• Canonical abstract syntax trees
• scientific article; zbMATH DE number 1693488 (Why is no real title available?)
• scientific article; zbMATH DE number 1231655 (Why is no real title available?)
• scientific article; zbMATH DE number 1956456 (Why is no real title available?)
• scientific article; zbMATH DE number 919844 (Why is no real title available?)
• scientific article; zbMATH DE number 1437942 (Why is no real title available?)
• Narrowing Data-Structures with Pointers
• On ``On graph rewritings

Cited in

(2)

• Term-Graph Rewriting Via Explicit Paths
• Optimizing term rewriting with creeper trace transducers

This page was built for publication: Term-graph rewriting in \textsc{Tom} using relative positions

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