| | |
Summary: Electronic Notes in Theoretical Computer Science 67 (2002)
URL: http://www.elsevier.nl/locate/entcs/volume67.html 20 pages
Comparing Calculi of Explicit Substitutions
with Eta-reduction 1
Mauricio Ayala-Rincon, Flavio L. C. de Moura 2;3
Departamento de Matematica
Universidade de Braslia
Braslia D.F., Brasil
Fairouz Kamareddine 4
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, Scotland
Abstract
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 and the s e which have proved useful for solving practical problems like
higher order uni cation, and the suspension calculus related to the implementation
of the language Prolog. We enlarge the suspension calculus with an adequate eta-
|
