A syntactical proof of the operational equivalence of two $λ$-terms

Details A syntactical proof of the operational equivalence of two $λ$-terms A syntactical proof of the operational equivalence of two $λ$-terms

2009-05-06

arxiv.org/abs/0905.0769v1

Journal of Theoretical Computer Science (TCS) 180 (1997) 371-375

Mathematics

Logic

Scientific paper

In this paper we present a purely syntactical proof of the operational
equivalence of $I=\lambda xx$ and the $\lambda$-term $J$ that is the
$\eta$-infinite expansion of $I$.

Affiliated with

Also associated with

No associations

Rating

A syntactical proof of the operational equivalence of two $λ$-terms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A syntactical proof of the operational equivalence of two $λ$-terms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A syntactical proof of the operational equivalence of two $λ$-terms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-541556