Strong Normalization of the Typed lambda_ws-calculus

René David 1 Bruno Guillaume 2
2 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : The lambda_ws-calculus is a lambda-calculus with explicit substitutions that satisfies the desired properties of such a calculus: step by step simulation of beta, confluence on terms with meta-variables and preservation of the strong normalization. It was conjectured that simply typed terms of lambda_ws are strongly normalizable. This was proved in by Di Cosmo & al. by using a translation of lambda_ws into the proof nets of linear logic. We give here a direct and elementary proof of this result. The strong normalization is also proved for terms typable with second order types (the extension of Girard's system~F). This is a new result.
Type de document :
Communication dans un congrès
Matthias Baaz and Johann A. Makowsky. Computer Science Logic'03, Aug 2003, Vienna, Austria. Springer, 2803, pp.155-168, 2003, Lecture Notes in Computer Science
Liste complète des métadonnées

Littérature citée [7 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/inria-00099580
Contributeur : René David <>
Soumis le : lundi 18 mai 2009 - 15:51:24
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48
Document(s) archivé(s) le : jeudi 10 juin 2010 - 23:22:36

Fichiers

csl_17.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00099580, version 2

Collections

Citation

René David, Bruno Guillaume. Strong Normalization of the Typed lambda_ws-calculus. Matthias Baaz and Johann A. Makowsky. Computer Science Logic'03, Aug 2003, Vienna, Austria. Springer, 2803, pp.155-168, 2003, Lecture Notes in Computer Science. 〈inria-00099580v2〉

Partager

Métriques

Consultations de la notice

425

Téléchargements de fichiers

135