Why the usual candidates of reducibility do not work for the symmetric $\lambda\mu$-calculus
David, René ; Nour, Karim
HAL, hal-00382686 / Harvested from HAL
Text on HAL
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.
Publié le : 2004-06-05
Classification:  [MATH.MATH-LO]Mathematics [math]/Logic [math.LO] 
@article{hal-00382686,
     author = {David, Ren\'e and Nour, Karim},
     title = {Why the usual candidates of reducibility do not work for the symmetric $\lambda\mu$-calculus},
     journal = {HAL},
     volume = {2004},
     number = {0},
     year = {2004},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00382686}
}

David, René; Nour, Karim. Why the usual candidates of reducibility do not work for the symmetric $\lambda\mu$-calculus. HAL, Tome 2004 (2004) no. 0, . http://gdmltest.u-ga.fr/item/hal-00382686/