Bruggink, Sander:
Equivalence of reductions in higher-order rewriting
Utrecht, 2008
2008dissertation
Informatik
Title:
Equivalence of reductions in higher-order rewriting
Author:
Bruggink, SanderLSF
Place of publication
Utrecht
Year of publication
2008
Extent
153
WWW URL
Note:
Utrecht, Univ., Diss., 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. Utrecht University