Equivalence of reductions in higher-order rewriting
Utrecht, 2008
2008dissertation
Computer Science
Title:
Equivalence of reductions in higher-order rewriting
Author:
Bruggink, SanderUDE
- LSF ID
- 47885
- Other
- connected with university
Place of publication:
Utrecht
Year of publication:
2008
Extent:
153
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