Why the usual candidates of reducibility do not work for the symmetric $\lambda\mu$-calculus - Archive ouverte HAL
Communication Dans Un Congrès Année : 2005

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

René David
  • Fonction : Auteur
  • PersonId : 859236
Karim Nour

Résumé

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.
Fichier principal
Vignette du fichier
david_nour.pdf (139.31 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00382686 , version 1 (11-05-2009)

Identifiants

Citer

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, Lyon, France. pp.101-111. ⟨hal-00382686⟩
121 Consultations
58 Téléchargements

Altmetric

Partager

More