Residuals in higher-order rewriting (2003)
| Venue: | Proceedings of Rewriting Techniques and Applications (RTA’03 |
| Citations: | 1 - 0 self |
BibTeX
@INPROCEEDINGS{Bruggink03residualsin,
author = {H. J. Sander Bruggink},
title = {Residuals in higher-order rewriting},
booktitle = {Proceedings of Rewriting Techniques and Applications (RTA’03},
year = {2003},
pages = {123--137},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Residuals have been studied for various forms of rewriting setting. In this article we study residuals in orthogonal Pattern Rewriting Systems (PRSs). First, the rewrite relation is defined by means of a higher-order rewriting logic, and proof terms are defined that witness reductions. Then, we have the formal machinery to define a residual operator for PRSs, and we will prove that an orthogonal PRS together with the residual operator mentioned above, is a residual system. As a side-effect, all results of (abstract) residual theory are inherited by orthogonal PRSs, such as confluence, and the notion of permutation equivalence of reductions. 1
