Infinitary combinatory reduction systems: confluence

DOI10.2168/LMCS-5(4:3)2009MaRDI QIDQ3401138zbMATH OpenFDO

Authors Jeroen Ketema, Jakob Grue Simonsen

Publication date 28 January 2010

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/LMCS-5(4:3)2009

zbMATH Keywords

combinatory reduction systemsconfluencehigher-order computationinfinite computationlambda-calculusnormal formsterm rewriting

Mathematics Subject Classification ID

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

Recommendations

• On Confluence of Infinitary Combinatory Reduction Systems
• Term Rewriting and Applications
• Infinitary combinatory reduction systems
• On Normalisation of Infinitary Combinatory Reduction Systems
• Infinitary combinatory reduction systems: normalising reduction strategies

Cited in

(15)

• Combinatory reduction systems: Introduction and survey
• Highlights in infinitary rewriting and lambda calculus
• Counterexamples in infinitary rewriting with non-fully-extended rules
• On Normalisation of Infinitary Combinatory Reduction Systems
• Infinitary combinatory reduction systems: normalising reduction strategies
• Confluence and superdevelopments
• A new coinductive confluence proof for infinitary lambda calculus
• scientific article; zbMATH DE number 7168147 (Why is no real title available?)
• Clocked lambda calculus
• Confluence of nearly orthogonal infinitary term rewriting systems
• On Confluence of Infinitary Combinatory Reduction Systems
• Unique normal forms in infinitary weakly orthogonal rewriting
• Clocks for Functional Programs
• Infinitary combinatory reduction systems
• Term Rewriting and Applications

This page was built for publication: Infinitary combinatory reduction systems: confluence

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