Infinitary combinatory reduction systems: normalising reduction strategies

DOI10.2168/LMCS-6(1:7)2010MaRDI QIDQ3575299zbMATH OpenFDO

Authors Jeroen Ketema, Jakob Grue Simonsen

Publication date 27 July 2010

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

Full work available at URL https://doi.org/10.2168/LMCS-6(1:7)2010

zbMATH Keywords

combinatory reduction systemshigher-order computationinfinite computationlambda-calculusnormal formsreduction strategiesterm rewriting

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(8)

• Highlights in infinitary rewriting and lambda calculus
• Counterexamples in infinitary rewriting with non-fully-extended rules
• Infinitary combinatory reduction systems: confluence
• On Normalisation of Infinitary Combinatory Reduction Systems
• A new coinductive confluence proof for infinitary lambda calculus
• scientific article; zbMATH DE number 7168147 (Why is no real title available?)
• Infinitary combinatory reduction systems
• Term Rewriting and Applications

This page was built for publication: Infinitary combinatory reduction systems: normalising reduction strategies

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