首页    期刊浏览 2024年11月05日 星期二
登录注册

文章基本信息

  • 标题:Computing Critical Pairs in 2-Dimensional Rewriting Systems
  • 本地全文:下载
  • 作者:Samuel Mimram
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2010
  • 卷号:6
  • 页码:227-242
  • DOI:10.4230/LIPIcs.RTA.2010.227
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even better, when the presentation is confluent and terminating, they provide one with a notion of canonical representative for the elements of the presented monoid. Polygraphs are a higher-dimensional generalization of this notion of presentation, from the setting of monoids to the much more general setting of n-categories. Here, we are interested in proving confluence for polygraphs presenting 2-categories, which can be seen as a generalization of term rewriting systems. For this purpose, we propose an adaptation of the usual algorithm for computing critical pairs. Interestingly, this framework is much richer than term rewriting systems and requires the elaboration of a new theoretical framework for representing critical pairs, based on contexts in compact 2-categories.
  • 关键词:Rewriting system; polygraph; presentation of a category; critical pair; unification; confluence; compact 2-category; context
国家哲学社会科学文献中心版权所有