Equivalence of reductions in higher-order rewriting
Utrecht, 2008
2008Dissertation
Informatik
Titel:
Equivalence of reductions in higher-order rewriting
Autor*in:
Bruggink, SanderUDE
- LSF ID
- 47885
- Sonstiges
- der Hochschule zugeordnete*r Autor*in
Erscheinungsort:
Utrecht
Erscheinungsjahr:
2008
Umfang:
153
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