A lambda-calculus with explicit weakening and explicit substitution - Archive ouverte HAL
Article Dans Une Revue Mathematical Structures in Computer Science Année : 2001

A lambda-calculus with explicit weakening and explicit substitution

René David
  • Fonction : Auteur
  • PersonId : 859236

Résumé

Since Melliès has shown that $\lambda\sigma$ (a calculus of explicit substitutions) does not preserve the strong normalization of the $\beta$-reduction, it became a challenge to find a calculus satisfying the following properties: step by step simulation of the beta-reduction, confluence on terms with metavariables, strong normalization of the calculus of substitutions and preservation of the strong normalization of the $\lambda$-calculus. We present here such a calculus. The main novelty of the calculus (given with de Bruijn indices) is the use of labels that represent updating functions and correspond to explicit weakening. A typed version is also presented.
Fichier principal
Vignette du fichier
mscs.pdf (374.36 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00384683 , version 1 (15-05-2009)

Identifiants

Citer

René David, Bruno Guillaume. A lambda-calculus with explicit weakening and explicit substitution. Mathematical Structures in Computer Science, 2001, 11 (1), pp.169-206. ⟨10.1017/S0960129500003224⟩. ⟨hal-00384683⟩
269 Consultations
491 Téléchargements

Altmetric

Partager

More