2019/03/15 by Basaldella, Michele
#03B40 #68N18 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)
paper · doi:10.48550/arxiv.1903.06775
In this work we provide alternative formulations of the concepts of lambda theory and extensional theory without introducing the notion of substitution and the sets of all, free and bound variables occurring in a term. We also clarify the actual role of α-renaming and η-extensionality in the lambda calculus: both of them can be described as properties of extensionality for certain classes of terms.