Article ID Journal Published Year Pages File Type
10225747 Theoretical Computer Science 2018 7 Pages PDF
Abstract
A new proof of the leftmost reduction theorem for βη-reduction is presented. The proof is carried out directly by using the notion of parallel reduction and without fundamental theorems for λ-calculus.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
A proof of the leftmost reduction theorem for λβη-calculus
Authors
,