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.
Liste complète des métadonnées

Cited literature [7 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/inria-00099580
Contributor : René David <>
Submitted on : Monday, May 18, 2009 - 3:51:24 PM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM
Document(s) archivé(s) le : Thursday, June 10, 2010 - 11:22:36 PM

Files

csl_17.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00099580, version 2

Collections

Citation

René David, Bruno Guillaume. Strong Normalization of the Typed lambda_ws-calculus. Computer Science Logic'03, Aug 2003, Vienna, Austria. pp.155-168. ⟨inria-00099580v2⟩

Share

Metrics

Record views

429

Files downloads

139