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

文章基本信息

  • 标题:Towards 3-Dimensional Rewriting Theory
  • 本地全文:下载
  • 作者:Samuel Mimram
  • 期刊名称:Logical Methods in Computer Science
  • 印刷版ISSN:1860-5974
  • 电子版ISSN:1860-5974
  • 出版年度:2014
  • 卷号:10
  • 期号:2
  • 页码:1
  • DOI:10.2168/LMCS-10(2:1)2014
  • 出版社:Technical University of Braunschweig
  • 摘要:String rewriting systems have proved very useful to study monoids. In good cases, they give finite presentations of monoids, allowing computations on those and their manipulation by a computer. Even better, when the presentation is confluent and terminating, they provide one with a notion of canonical representative of 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. One of the main purposes of this article is to give a progressive introduction to the notion of higher-dimensional rewriting system provided by polygraphs, and describe its links with classical rewriting theory, string and term rewriting systems in particular. After introducing the general setting, we will be interested in proving local confluence for polygraphs presenting 2-categories and introduce a framework in which a finite 3-dimensional rewriting system admits a finite number of critical pairs.
  • 其他关键词:higher-dimensional rewriting system, polygraph, presentation, string diagram, compact 2-category, critical pair, unification
国家哲学社会科学文献中心版权所有