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

Autor:	Tom Hirschowitz
Jazyk:	angličtina
Rok vydání:	2013
Předmět:	computer science - logic in computer science computer science - programming languages mathematics - category theory Logic BC1-199 Electronic computers. Computer science QA75.5-76.95
Zdroj:	Logical Methods in Computer Science, Vol Volume 9, Issue 3 (2013)
Druh dokumentu:	article
ISSN:	1860-5974
DOI:	10.2168/LMCS-9(3:10)2013
Popis:	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.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/f375fc2860724c7482516f11c721e4af Zobrazit plný text záznamu View record in DOAJ