Laboratoire de l'informatique du parallélisme; Lang, Frédéric; Lescanne, Pierre
(1999-08)
(eng) In this paper, we present an attempt to build a calculus of explicit substitution expected to be confluent on open terms, to preserve strong normalisation and to simulate one step `b-reduction. We show why our attempt ...