Why the usual candidates of reducibility do not work for the symmetric $\lambda\mu$-calculus

René David (1) , Karim Nour (1)

1 LAMA - Laboratoire de Mathématiques

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.

Domaines: Logique [math.LO]

René David, Karim Nour. Why the usual candidates of reducibility do not work for the symmetric $\lambda\mu$-calculus. Second Workshop on Computational Logic and Applications (CLA 2004), Jun 2004, France. pp.101-111. ⟨hal-00382686⟩