论文信息 - Termination orders for 3-dimensional rewriting

Termination orders for 3-dimensional rewriting

This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resources management is given, and the respective computational properties of each system are studied. Finally, a convergent 3-polygraph for the (commutative) theory of Z/2Z-vector spaces is given. In order to prove these results, it is explained how to craft a class of termination orders for 3-polygraphs.

Yves Guiraud | Yves Guiraud

[1] Y. Lafont. Applications of Categories in Computer Science: Penrose diagrams and 2-dimensional rewriting , 1992 .

[2] Yves Guiraud. Présentations d'opérades et systèmes de réécriture , 2004 .

[3] Yves Lafont,et al. Towards an algebraic theory of Boolean circuits , 2003 .

[4] Albert Burroni,et al. Higher-Dimensional Word Problems with Applications to Equational Logic , 1993, Theor. Comput. Sci..

[5] S. Lane. Categories for the Working Mathematician , 1971 .

[6] Jürgen Giesl,et al. Termination of term rewriting using dependency pairs , 2000, Theor. Comput. Sci..

[7] Yves Lafont. Equational Reasoning with Two-Dimensional Diagrams , 1993, Term Rewriting.

[8] H. E. Kuhn,et al. BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, , 2007 .

[9] Mikhail N. Vyalyi,et al. Classical and quantum codes , 2002 .

[10] Mikhail N. Vyalyi,et al. Classical and Quantum Computation , 2002, Graduate studies in mathematics.

[11] Chang Liu,et al. Term rewriting and all that , 2000, SOEN.

[12] Lutz Straßburger,et al. Non-commutativity and MELL in the Calculus of Structures , 2001, CSL.