Non Strict Confluent Rewrite Systems for Data-Structures with Pointers

DOI10.1007/978-3-540-73449-9_12MaRDI QIDQ5432338zbMATH OpenOpenAlexFDO

Authors Rachid Echahed, Nicolas Peltier

Publication date 2 January 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73449-9_12

Mathematics Subject Classification ID

Data structures (68P05) Grammars and rewriting systems (68Q42)

Recommendations

• A Needed Rewriting Strategy for Data-Structures with Pointers
• Modeling pointer redirection as cyclic term-graph rewriting
• Narrowing Data-Structures with Pointers
• On term-graph rewrite strategies
• Lazy context cloning for non-deterministic graph rewriting

Cited in

(6)

• Lazy context cloning for non-deterministic graph rewriting
• Modeling pointer redirection as cyclic term-graph rewriting
• On term-graph rewrite strategies
• A Needed Rewriting Strategy for Data-Structures with Pointers
• Inductively Sequential Term-Graph Rewrite Systems
• Narrowing Data-Structures with Pointers

This page was built for publication: Non Strict Confluent Rewrite Systems for Data-Structures with Pointers

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