The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the implementation of typed functional programming languages and higher order proof assistants. Three styles of explicit substitutions are treated in this paper: the ?s and the ?se which have proved useful for solving practical problems like higher order unification, and the suspension calculus related to the implementation of the language ?-Prolog. We enlarge the suspension calculus with an adequate eta-reduction which we show to preserve termination and confluence of the associated substitution calculus and to correspond to the eta-reductions of the other two calculi. Additionally, we prove that ?s and ?se as well as ?s and the suspension calculus are non comparable while ?se is more adequate than the suspension calculus. ©2002 Published by Elsevier Science B.V.
|Number of pages||20|
|Journal||Electronic Notes in Theoretical Computer Science|
|Publication status||Published - Oct 2002|
|Event||9th Workshop on Logic, Language, Information and Computation - Rio de Janeiro, Brazil|
Duration: 30 Jul 2002 → 2 Aug 2002
- Calculi of explicit substitutions
- Eta reduction