Mathematics – Logic
Scientific paper
2009-05-15
Mathematics
Logic
To appear in TCS
Scientific paper
I give a proof of the confluence of combinatory strong reduction that does
not use the one of lambda-calculus. I also give simple and direct proofs of a
standardization theorem for this reduction and the strong normalization of
simply typed terms.
No associations
LandOfFree
A direct proof of the confluence of combinatory strong reduction 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 direct proof of the confluence of combinatory strong reduction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A direct proof of the confluence of combinatory strong reduction will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-524454