Counterexamples in infinitary rewriting with non-fully-extended rules

DOI10.1016/j.ipl.2011.04.001zbMath1260.68193OpenAlexW1965164466WikidataQ124821979 ScholiaQ124821979MaRDI QIDQ1944100

Jeroen Ketema

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.04.001

zbMATH Keywords

higher-order rewritingprogramming calculiinfinitary rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Combinatory reduction systems: Introduction and survey
• Infinitary lambda calculus
• Transfinite reductions in orthogonal term rewriting systems
• Infinitary Combinatory Reduction Systems: Confluence
• On Normalisation of Infinitary Combinatory Reduction Systems
• Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
• Comparing Böhm-Like Trees
• Higher-order narrowing with definitional trees
• Higher-order families
• On Confluence of Infinitary Combinatory Reduction Systems
• Term Rewriting and Applications

This page was built for publication: Counterexamples in infinitary rewriting with non-fully-extended rules