A syntactical proof of the operational equivalence of two $\lambda$-terms
Ren\'e David (LAMA), Karim Nour (LAMA)

TL;DR
This paper provides a purely syntactical proof demonstrating the operational equivalence of the identity lambda-term and its eta-infinite expansion, contributing to the theoretical understanding of lambda calculus.
Contribution
It introduces a novel syntactical proof of operational equivalence between two lambda-terms, expanding the theoretical framework of lambda calculus.
Findings
Proves the operational equivalence syntactically
Shows the eta-infinite expansion is equivalent to the identity
Enhances understanding of lambda-term transformations
Abstract
In this paper we present a purely syntactical proof of the operational equivalence of and the -term that is the -infinite expansion of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Logic, Reasoning, and Knowledge · Logic, programming, and type systems
