Cartesian closed 2-categories and permutation equivalence in higher-order rewriting - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Logical Methods in Computer Science Year : 2013

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

Tom Hirschowitz

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.
Fichier principal
Vignette du fichier
macy.pdf (256.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00540205 , version 1 (26-11-2010)
hal-00540205 , version 2 (29-01-2011)

Identifiers

Cite

Tom Hirschowitz. Cartesian closed 2-categories and permutation equivalence in higher-order rewriting. Logical Methods in Computer Science, 2013, 9 (3), pp.10. ⟨10.2168/LMCS-9(3:10)2013⟩. ⟨hal-00540205v2⟩
222 View
488 Download

Altmetric

Share

Gmail Facebook X LinkedIn More