Bruggink, Sander:
Equivalence of reductions in higher-order rewriting
Utrecht, 2008
Dissertation / Fach: Informatik
Titel:
Equivalence of reductions in higher-order rewriting
Autor(in):
Bruggink, Sander im Online-Personal- und -Vorlesungsverzeichnis LSF anzeigen
Erscheinungsort:
Utrecht
Erscheinungsjahr:
2008
Umfang:
153
Link URL:
Notiz:
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