Partial order infinitary term rewriting and Böhm trees

DOI10.4230/LIPICS.RTA.2010.67zbMATH Open1236.68122OpenAlexW2108750304MaRDI QIDQ5389136FDOQ5389136

Authors: Patrick Bahr 

Publication date: 25 April 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_1d54.html

Recommendations

• Partial Order Infinitary Term Rewriting
• Böhm Reduction in Infinitary Term Graph Rewriting Systems
• Infinitary rewriting: closure operators, equivalences and models
• Infinitary rewriting: meta-theory and convergence
• Infinitary lambda calculus

zbMATH Keywords

partial orderconfluencenormalisationinfinitary term rewritingBöhm trees

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (11)

• On infinite \(\eta\)-expansion
• Rewriting Techniques and Applications
• Partial Order Infinitary Term Rewriting
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Böhm Reduction in Infinitary Term Graph Rewriting Systems
• Title not available (Why is that?)
• Abstract models of transfinite reductions
• Strict ideal completions of the lambda calculus
• Coinductive foundations of infinitary rewriting and infinitary equational logic
• Infinitary rewriting: closure operators, equivalences and models
• Comparing Böhm-Like Trees

This page was built for publication: Partial order infinitary term rewriting and Böhm trees

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