Proving the genericity lemma by leftmost reduction is simple

DOI10.1007/3-540-59200-8_63MaRDI QIDQ5055836zbMATH OpenOpenAlexFDO

Authors Jan Kuper

Publication date 9 December 2022

Published in Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59200-8_63

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• scientific article; zbMATH DE number 2079019
• scientific article; zbMATH DE number 1499090
• scientific article; zbMATH DE number 2044492
• A proof of the leftmost reduction theorem for -calculus
• No solvable lambda-value term left behind

Cites work

• scientific article; zbMATH DE number 3730111 (Why is no real title available?)
• The lambda calculus, its syntax and semantics

Cited in

(2)

• scientific article; zbMATH DE number 2079019 (Why is no real title available?)
• Light genericity

This page was built for publication: Proving the genericity lemma by leftmost reduction is simple

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