Strong Normalization of the Typed lambda ws-calculus
Résumé
The lambda_ws-calculus is a lambda-calculus with explicit substitutions. This calculus is known to preserve strong normalization of usual lambda-calculus and to be strongly normalizable for simply typed lambda-terms. This article gives an elementary proof of the strong normalization with simply typed terms and a proof of strong normalization for the second-order typed terms which is a new result. || Le lambda ws-calcul est un lambda-calcul avec substitutions explicites. On sait que ce calcul préserve la forte normalisation du labda-calcul usuel et qu'il a la forte normalisation pour les lambda-terme simplement typés. Cet article donne une preuve élém