Böhm Reduction in Infinitary Term Graph Rewriting Systems

DOI10.4230/LIPICS.FSCD.2017.8MaRDI QIDQ5111303zbMATH OpenOpenAlexFDO

Authors Patrick Bahr

Publication date 26 May 2020

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2017/7727/pdf/LIPIcs-FSCD-2017-8.pdf/

zbMATH Keywords

Böhm treesinfinitary rewritingterm graphs

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Grammars and rewriting systems (68Q42)

Recommendations

• Partial order infinitary term rewriting and Böhm trees
• Partial Order Infinitary Term Rewriting
• Infinitary lambda calculus
• Infinitary term graph rewriting is simple, sound and complete
• Modes of convergence for term graph rewriting

Cites work

• Abstract models of transfinite reductions
• scientific article; zbMATH DE number 1332646 (Why is no real title available?)
• Infinitary lambda calculus
• Infinitary term graph rewriting is simple, sound and complete
• LEAN: An intermediate language based on graph rewriting
• Partial order infinitary term rewriting and Böhm trees
• Rewriting Techniques and Applications
• Theoretical Pearls:Representing ‘undefined’ in lambda calculus
• Transfinite reductions in orthogonal term rewriting systems

Cited in

(6)

• Infinitary term graph rewriting is simple, sound and complete
• A coinductive confluence proof for infinitary lambda-calculus
• Partial order infinitary term rewriting and Böhm trees
• Term Rewriting and Applications
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Rewriting Techniques and Applications

This page was built for publication: Böhm Reduction in Infinitary Term Graph Rewriting Systems

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