Proving the genericity lemma by leftmost reduction is simple

DOI10.1007/3-540-59200-8_63zbMATH Open1503.03027OpenAlexW1551154663MaRDI QIDQ5055836FDOQ5055836

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

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 \(\lambda\beta\eta\)-calculus
• No solvable lambda-value term left behind

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites Work

• The lambda calculus, its syntax and semantics
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• 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)