文章基本信息

标题：Cartesian closed 2-categories and permutation equivalence in higher-order rewriting
本地全文：下载
作者：Tom Hirschowitz
期刊名称：Logical Methods in Computer Science
印刷版ISSN：1860-5974
电子版ISSN：1860-5974
出版年度：2013
卷号：9
期号：3
页码：1
DOI：10.2168/LMCS-9(3:10)2013
出版社：Technical University of Braunschweig
摘要：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.
其他关键词：Cartesian closed 2-categories, lambda calculus, higher-order rewriting, combinatory reduction systems, categorical semantics