Equivalence of reductions in higher-order rewriting

Utrecht (2008), 153 S.
Dissertation / Fach: Informatik
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

Dieser Eintrag ist freigegeben.