A lambda-calculus with explicit weakening and explicit substitution

René David (1) , Bruno Guillaume (2)

1 LAMA - Laboratoire de Mathématiques
2 CALLIGRAMME - Linear logic, proof networks and categorial grammars

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.

Domaines: Logique [math.LO]; Logique en informatique [cs.LO]

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⟩