Call-by-value Termination in the Untyped lambda-calculus

DOI10.2168/LMCS-4(1:3)2008zbMath1149.68021OpenAlexW2953374554MaRDI QIDQ3518269

Neil D. Jones, Nina Bohr

Publication date: 7 August 2008

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

Full work available at URL: https://doi.org/10.2168/lmcs-4(1:3)2008

zbMATH Keywords

tree grammarCBV termination

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (2)

Size-based termination of higher-order rewriting ⋮ Unnamed Item

This page was built for publication: Call-by-value Termination in the Untyped lambda-calculus