A direct proof of the confluence of combinatory strong reduction

Mathematics – Logic

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-524454

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.