Böhm Reduction in Infinitary Term Graph Rewriting Systems

DOI10.4230/LIPICS.FSCD.2017.8zbMATH Open1434.68216OpenAlexW2760539377MaRDI QIDQ5111303FDOQ5111303

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/

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

zbMATH Keywords

infinitary rewritingterm graphsBöhm trees

Mathematics Subject Classification ID

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

Cites Work

• Theoretical Pearls:Representing ‘undefined’ in lambda calculus
• LEAN: An intermediate language based on graph rewriting
• Infinitary lambda calculus
• Transfinite reductions in orthogonal term rewriting systems
• Title not available (Why is that?)
• Rewriting Techniques and Applications
• Abstract models of transfinite reductions
• Partial order infinitary term rewriting and Böhm trees
• Infinitary term graph rewriting is simple, sound and complete

Cited In (6)

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

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)