Böhm Reduction in Infinitary Term Graph Rewriting Systems

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

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

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
• Title not available (Why is that?)

Cited In (1)

• Term Rewriting and Applications

   Recommendations

• PARTIAL ORDER INFINITARY TERM REWRITING AND BÖHM TREES 👍 👎
• Partial Order Infinitary Term Rewriting 👍 👎
• Infinitary lambda calculus 👍 👎
• Title not available (Why is that?) 👍 👎
• Modes of convergence for term graph rewriting 👍 👎

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)