Abstract. We propose a semantics for permutation equivalence in higher-order rewriting. This semantics takes place in cartesian closed 2-categories, and is proved sound and complete.
• T. Hirschowitz REF ] approached higher-order rewriting systems via Cartesian closed 2-categories.
Cartesian closed 2-categories and permutation equivalence in higher-order rewriting
LMCS 9 (3:10) 2013
Computer Science Mathematics