Term-Graph Rewriting Via Explicit Paths

DOI10.1007/978-3-540-70590-1_3zbMATH Open1145.68440OpenAlexW1517691308MaRDI QIDQ3522007FDOQ3522007

Authors: Emilie Balland, Pierre-Etienne Moreau 

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

Recommendations

• scientific article; zbMATH DE number 234035
• scientific article; zbMATH DE number 919844
• Essentials of term graph rewriting
• Term-graph rewriting in \textsc{Tom} using relative positions
• On term-graph rewrite strategies

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Title not available (Why is that?)
• Implementing term rewriting by jungle evaluation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On ``On graph rewritings
• Title not available (Why is that?)
• Narrowing Data-Structures with Pointers
• CPO models for infinite term rewriting
• Title not available (Why is that?)
• Strategic rewriting
• Term-graph rewriting in \textsc{Tom} using relative positions
• Term-Graph Rewriting Via Explicit Paths
• Addressed term rewriting systems: application to a typed object calculus

Cited In (4)

• Term-Graph Rewriting Via Explicit Paths
• Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models
• Foreword: special issue on term and graph rewriting
• Term-graph rewriting in \textsc{Tom} using relative positions

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

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