Why the usual candidates of reducibility do not work for the symmetric $λμ$-calculus

Details Why the usual candidates of reducibility do not work for the symmetric $λμ$-calculus Why the usual candidates of reducibility do not work for the symmetric $λμ$-calculus

2009-05-11

arxiv.org/abs/0905.1554v1

Mathematics

Logic

Second Workshop on Computational Logic and Applications (CLA 2004), France (2004)

Scientific paper

The symmetric $\lambda mu$-calculus is the $\lambda\mu$-calculus introduced
by Parigot in which the reduction rule $\mu'$, which is the symmetric of $\mu$,
is added. We give examples explaining why the technique using the usual
candidates of reducibility does not work. We also prove a standardization
theorem for this calculus.

Affiliated with

Also associated with

No associations

Rating

Why the usual candidates of reducibility do not work for the symmetric $λμ$-calculus 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 Why the usual candidates of reducibility do not work for the symmetric $λμ$-calculus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Why the usual candidates of reducibility do not work for the symmetric $λμ$-calculus will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-700902