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)

zbMATH Keywords

normal formslambda-calculusterm rewritinghigher-order computationcombinatory reduction systemsinfinite computationreduction strategies

Mathematics Subject Classification ID

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

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)

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

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)