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

Simple item page
dc.creatorDavid, René
dc.creatorNour, Karim
dc.date2009-05-11
dc.date.accessioned2026-07-07T13:13:39Z
dc.date.available2026-07-07T13:13:39Z
dc.descriptionThe 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.
dc.descriptionSecond Workshop on Computational Logic and Applications (CLA 2004), France (2004)
dc.identifierhttps://arxiv.org/abs/0905.1554
dc.identifierhttp://arxiv.org/abs/0905.1554
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/229960
dc.subjectLogic
dc.titleWhy the usual candidates of reducibility do not work for the symmetric $λμ$-calculus
dc.typetext

Files

Collections

arXiv