Mathematical Structures in Computer Science · 2001 · 42 citations · 9 references
ComputingComputer ScienceAlgebraProgramming LanguagesSyntaxModel TheoryType SystemsLambda CalculusNormalizationSubstitutionsTyped Lambda Calculus
Since Melliès showed that λσ (a calculus of explicit substitutions) does not preserve the strong normalization of the β-reduction, it has become a challenge to find a calculus satisfying the following properties: step-by-step simulation of the β-reduction, confluence on terms with metavariables, strong normalization of the calculus of substitutions and preservation of the strong normalization of the λ-calculus. We present here such a calculus. The main novelty of this 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.
9
Jan Willem Klop · Data Archiving and Networked Services (DANS) · 1990 · 783 citations
M. Abadi, Luca Cardelli, Pierre-Louis Curien et al. · Journal of Functional Programming · 1991 · 366 citations · Full text