Cartesian closed 2-categories and permutation equivalence in higher-order rewriting

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.

Keywords

• computer science - logic in computer science
• computer science - programming languages
• mathematics - category theory