Abstract | ||
---|---|---|
We use Origin functions to describe the notions of descendance and residuals in reduction systems such as the -calculus and linear term rewriting systems. We compare the origin functions for the -calculus and for term rewriting systems that implement this calculus, and Env. We show that the notions of origin do not correspond exactly, but we describe an extension of the notion of origin that permits the correct computation of -calculus origins for derivations of Env. We show that this extension is not sufficient to give the same result for and we give another extension for that system. This work is interesting as it provides a distinction between the two term rewriting systems. This work has applications in the debugging of languages based on the -calculus or environments. |
Year | DOI | Venue |
---|---|---|
1992 | 10.1007/3-540-55251-0_3 | CAAP |
Keywords | DocType | ISBN |
term rewriting systems,origin functions,lambda calculus | Conference | 3-540-55251-0 |
Citations | PageRank | References |
6 | 0.54 | 4 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yves Bertot | 1 | 442 | 40.82 |