Infinitary term graph rewriting is simple, sound and complete

DOI10.4230/LIPICS.RTA.2012.69MaRDI QIDQ5111897zbMATH OpenFDO

Authors Patrick Bahr

Publication date 27 May 2020

Full work available at URL https://doi.org/10.4230/LIPICS.RTA.2012.69

zbMATH Keywords

graph rewritinginfinitary rewritingmetricpartial orderterm graphs

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Modes of convergence for term graph rewriting
• Modes of convergence for term graph rewriting
• Convergence in infinitary term graph rewriting systems is simple
• scientific article; zbMATH DE number 7344705
• Böhm Reduction in Infinitary Term Graph Rewriting Systems

Cited in

(8)

• Modes of convergence for term graph rewriting
• scientific article; zbMATH DE number 7344705 (Why is no real title available?)
• scientific article; zbMATH DE number 1231494 (Why is no real title available?)
• Convergence in infinitary term graph rewriting systems is simple
• Coinductive foundations of infinitary rewriting and infinitary equational logic
• Strict ideal completions of the lambda calculus
• Böhm Reduction in Infinitary Term Graph Rewriting Systems
• Modes of convergence for term graph rewriting

This page was built for publication: Infinitary term graph rewriting is simple, sound and complete

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