Cartesian closed 2-categories and permutation equivalence in higher-order rewriting
arXiv:1307.6318 · doi:10.2168/LMCS-9(3:10)2013
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.