Explicit substitutions calculi are formal systems that implement /3-reduction by means of an internal substitution operator In that calculi it is possible to delay the application of a substitution to a term or to consider terms with partially applied substitutions. The X,-calculus of explicit substitutions, proposed by Abadi, Cardelli, Curien and Levy, is a$rst-order rewriting system that implements substitution and renaming mechanism of X-calculus. Howevel; X, does not preserve strong normalisation of X-calculus and it is not a confluent system. Typed variants of X, without composition are strongly normalising but not confluent, while variants with composition are confluent but do not preserve strong normalisation. Neither of them enjoys both properties. In this paper we propose the Xc-calculus. This is, as far as we know, the first conJiuent calculus of explicit substitutions that preserves strong normalisation.
[1]
C. J. Bloo,et al.
Preservation of strong normalisation in named lambda calculi with explicit substitution and garbage collection
,
1995
.
[2]
Pierre Lescanne,et al.
Explicit Substitutions with de Bruijn's Levels
,
1995,
RTA.
[3]
Pierre Lescanne,et al.
λν, a calculus of explicit substitutions which preserves strong normalisation
,
1996,
Journal of Functional Programming.
[4]
Cj Roel Bloo,et al.
Preservation of strong normalisation for explicit substitution
,
1995
.
[5]
Martín Abadi,et al.
Explicit substitutions
,
1989,
POPL '90.
[6]
Henk Barendregt,et al.
The Lambda Calculus: Its Syntax and Semantics
,
1985
.
[7]
Kristoffer Høgsbro Rose,et al.
Explicit Cyclic Substitutions
,
1992,
CTRS.