On Confluence of Infinitary Combinatory Reduction Systems

DOI10.1007/11591191_15MaRDI QIDQ5387840zbMATH OpenOpenAlexFDO

Authors Jeroen Ketema, Jakob Grue Simonsen

Publication date 27 May 2008

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11591191_15

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Infinitary combinatory reduction systems: confluence
• Term Rewriting and Applications
• Infinitary combinatory reduction systems
• Confluence of nearly orthogonal infinitary term rewriting systems
• Rewriting Techniques and Applications

Cited in

(10)

• Counterexamples in infinitary rewriting with non-fully-extended rules
• Infinitary combinatory reduction systems: confluence
• On Normalisation of Infinitary Combinatory Reduction Systems
• Infinitary combinatory reduction systems: normalising reduction strategies
• Comparing Böhm-Like Trees
• Confluence and superdevelopments
• A coinductive confluence proof for infinitary lambda-calculus
• Confluence of nearly orthogonal infinitary term rewriting systems
• Infinitary combinatory reduction systems
• Term Rewriting and Applications

Describes a project that uses

Uses Software

• CDuce

This page was built for publication: On Confluence of Infinitary Combinatory Reduction Systems

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