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

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.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Logical methods in computer science 2013-09, Vol.9, Issue 3 (3)
1. Verfasser:	Hirschowitz, Tom
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science computer science - logic in computer science computer science - programming languages Logic in Computer Science mathematics - category theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	1860-5974 1860-5974
DOI:	10.2168/LMCS-9(3:10)2013