A proof of the leftmost reduction theorem for \(\lambda\beta\eta\)-calculus

DOI10.1016/J.TCS.2018.06.003zbMath1436.03105OpenAlexW2807891740MaRDI QIDQ1786610

Katsumasa Ishii

Publication date: 24 September 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.06.003

zbMATH Keywords

parallel reduction\(\lambda\beta\eta\)-calculusleftmost reduction theorem

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites Work

• Parallel reductions in \(\lambda\)-calculus
• Unnamed Item
• Unnamed Item

This page was built for publication: A proof of the leftmost reduction theorem for \(\lambda\beta\eta\)-calculus