Why the usual candidates of reducibility do not work for the symmetric $λμ$-calculus
Abstract
Description
The symmetric $λmu$-calculus is the $λμ$-calculus introduced by Parigot in which the reduction rule $μ'$, which is the symmetric of $μ$, 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.
Second Workshop on Computational Logic and Applications (CLA 2004), France (2004)
Second Workshop on Computational Logic and Applications (CLA 2004), France (2004)