Infinitary term graph rewriting is simple, sound and complete

DOI10.4230/LIPICS.RTA.2012.69zbMATH Open1437.68075MaRDI QIDQ5111897FDOQ5111897

Authors Patrick Bahr 

Publication date 27 May 2020

zbMATH Keywords

metricpartial orderinfinitary rewritinggraph rewritingterm 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
• Böhm Reduction in Infinitary Term Graph Rewriting Systems

Cited In (7)

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

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)