Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
From MaRDI portal
Publication:3575299
DOI10.2168/LMCS-6(1:7)2010zbMath1191.68365MaRDI QIDQ3575299
Jakob Grue Simonsen, Jeroen Ketema
Publication date: 27 July 2010
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
normal forms; term rewriting; lambda-calculus; higher-order computation; combinatory reduction systems; infinite computation; reduction strategies
68N18: Functional programming and lambda calculus
68Q42: Grammars and rewriting systems
03B40: Combinatory logic and lambda calculus
Related Items
Unnamed Item, Unnamed Item, Infinitary combinatory reduction systems, Highlights in infinitary rewriting and lambda calculus, Counterexamples in infinitary rewriting with non-fully-extended rules