Cette Note présente la première classe connue d'ordres de terminaison adaptés aux 3-polygraphes, ainsi qu'une application.
This Note presents the first known class of termination orders for 3-polygraphs, together with an application.
Reçu le :
Accepté le :
Publié le :
DOI :
10.1016/j.crma.2005.12.019
Accepté le :
Publié le :
Affiliations des auteurs :
Guiraud, Yves 1
@article{CRMATH_2006__342_4_219_0, author = {Guiraud, Yves}, title = {Termination orders for 3-polygraphs}, journal = {Comptes Rendus. Math\'ematique}, pages = {219--222}, publisher = {Elsevier}, volume = {342}, number = {4}, year = {2006}, doi = {10.1016/j.crma.2005.12.019}, language = {en}, url = {http://www.numdam.org/articles/10.1016/j.crma.2005.12.019/} }
TY - JOUR AU - Guiraud, Yves TI - Termination orders for 3-polygraphs JO - Comptes Rendus. Mathématique PY - 2006 SP - 219 EP - 222 VL - 342 IS - 4 PB - Elsevier UR - http://www.numdam.org/articles/10.1016/j.crma.2005.12.019/ DO - 10.1016/j.crma.2005.12.019 LA - en ID - CRMATH_2006__342_4_219_0 ER -
Guiraud, Yves. Termination orders for 3-polygraphs. Comptes Rendus. Mathématique, Tome 342 (2006) no. 4, pp. 219-222. doi : 10.1016/j.crma.2005.12.019. http://www.numdam.org/articles/10.1016/j.crma.2005.12.019/
[1] Higher-dimensional word problems with applications to equational logic, Theoret. Comput. Sci., Volume 115 (1993)
[2] Y. Guiraud, Termination orders for 3-dimensional rewriting, J. Pure Appl. Algebra (2004), in press
[3] Towards an algebraic theory of boolean circuits, J. Pure Appl. Algebra, Volume 184 (2003)
Cité par Sources :