Modes of convergence for term graph rewriting

DOI10.2168/LMCS-8(2:6)2012MaRDI QIDQ2888507zbMATH OpenOpenAlexWikidataFDO

Authors Patrick Bahr

Publication date 1 June 2012

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/lmcs-8(2:6)2012

zbMATH Keywords

graph rewritinginfinitary rewritingmetricpartial orderterm graphs

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Modes of convergence for term graph rewriting
• Convergence in infinitary term graph rewriting systems is simple
• Infinitary term graph rewriting is simple, sound and complete
• scientific article; zbMATH DE number 7344705
• Term graph rewriting and parallel term rewriting

Cited in

(7)

• scientific article; zbMATH DE number 7344705 (Why is no real title available?)
• scientific article; zbMATH DE number 1231589 (Why is no real title available?)
• Convergence in infinitary term graph rewriting systems is simple
• Term graph rewriting and parallel term rewriting
• Böhm Reduction in Infinitary Term Graph Rewriting Systems
• Infinitary term graph rewriting is simple, sound and complete
• Modes of convergence for term graph rewriting

This page was built for publication: Modes of convergence for term graph rewriting

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