Infinitary Combinatory Reduction Systems: Confluence

DOI10.2168/LMCS-5(4:3)2009zbMath1187.68277MaRDI QIDQ3401138

Jakob Grue Simonsen, Jeroen Ketema

Publication date: 28 January 2010

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

zbMATH Keywords

normal formsconfluenceterm rewritinglambda-calculushigher-order computationcombinatory reduction systemsinfinite computation

Mathematics Subject Classification ID

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

Related Items

Unnamed Item ⋮ Highlights in infinitary rewriting and lambda calculus ⋮ Counterexamples in infinitary rewriting with non-fully-extended rules ⋮ Clocks for Functional Programs ⋮ Infinitary combinatory reduction systems ⋮ Unnamed Item ⋮ Clocked lambda calculus

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