Cartesian closed 2-categories and permutation equivalence in higher-order rewriting
Logic in Computer Science
2015-07-01 v3 Programming Languages
Category Theory
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.
Cite
@article{arxiv.1307.6318,
title = {Cartesian closed 2-categories and permutation equivalence in higher-order rewriting},
author = {Tom Hirschowitz},
journal= {arXiv preprint arXiv:1307.6318},
year = {2015}
}