Computing Critical Pairs in 2-Dimensional Rewriting Systems - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Computing Critical Pairs in 2-Dimensional Rewriting Systems

Résumé

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.
Fichier principal
Vignette du fichier
mimram_rta10.pdf (303.06 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00473983 , version 1 (17-04-2010)

Identifiants

Citer

Samuel Mimram. Computing Critical Pairs in 2-Dimensional Rewriting Systems. Rewriting Theory and Applications, 2010, Edinburgh, United Kingdom. pp.227-242, ⟨10.4230/LIPIcs.RTA.2010.227⟩. ⟨inria-00473983⟩
74 Consultations
172 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More