Reduction Orderings and Completion for Rewrite Systems with Binding

Abstract

We generalise the recursive path ordering (rpo) in order to deal with alpha-equivalence classes of terms, using the nominal approach. We then use the nominal rpo to check termination, and to design a completion procedure, for nominal rewriting systems. Nominal rewriting generalises first-order rewriting by providing support for the specification of binding operators — alpha-equivalence is axiomatised, then higher-order reduction schemes can be smoothly represented. Completion of rewriting systems with binding is a notably difficult problem; the completion procedure presented in this paper is the first one that can deal with binders in rewrite rules.

Cite this paper

@inproceedings{Fernndez2010ReductionOA, title={Reduction Orderings and Completion for Rewrite Systems with Binding}, author={Maribel Fern{\'a}ndez and Albert Rubio}, year={2010} }