Equivalence of reductions in higher-order rewriting
Reference
H.J. Sander Bruggink. Equivalence of reductions in higher-order rewriting. PhD thesis, Utrecht University, 2008.
Abstract
Three formalizations of equivalence of reductions in higher-order rewriting are given, permutation equivalence, standardization equivalence and projection equivalence, and show that the three formalizations are equivalent for local, orthogonal higher-order rewriting systems.
Suggested BibTeX entry:
@phdthesis{bruggink:phd2008,
author = {H.J. Sander Bruggink},
school = {Utrecht University},
title = {Equivalence of reductions in higher-order rewriting},
year = {2008}
}
