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

Tom Hirschowitz (CNRS; Universit\'e de Savoie)

arxiv: 1307.6318 · v3 · pith:BL23SLAMnew · submitted 2013-07-24 · 💻 cs.LO · cs.PL· math.CT

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

Tom Hirschowitz (CNRS , Universit\'e de Savoie) This is my paper

classification 💻 cs.LO cs.PLmath.CT

keywords cartesiancategoriesclosedequivalencehigher-orderpermutationrewritingsemantics

0 comments

read the original 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.

This paper has not been read by Pith yet.

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

discussion (0)