Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies

From MaRDI portal

Revision as of 02:27, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3575299

Jump to:navigation, search

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)

zbMATH Keywords

normal forms term rewriting lambda-calculus higher-order computation combinatory reduction systems infinite computation reduction strategies

Mathematics Subject Classification ID

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

Related Items (5)

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

This page was built for publication: Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3575299&oldid=16974021"