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

DOI10.2168/LMCS-4(1:3)2008MaRDI QIDQ3518269zbMATH OpenOpenAlexFDO

Authors 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

CBV terminationtree grammar

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Rewriting Techniques and Applications
• Programming Languages and Systems
• A simplifier for untyped lambda expressions
• The size-change principle for program termination
• Termination of combined (rewrite and λ-calculus) systems

Cited in

(8)

• scientific article; zbMATH DE number 2185674 (Why is no real title available?)
• Size-based termination of higher-order rewriting
• The call-by-value λ-calculus: a semantic investigation
• scientific article; zbMATH DE number 7340561 (Why is no real title available?)
• Extensional and intensional semantics of bounded and unbounded nondeterminism
• Programming Languages and Systems
• A simplifier for untyped lambda expressions
• Rewriting Techniques and Applications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3518269)