Termination orders for 3-dimensional rewriting
<|reference_start|>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 resource 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.<|reference_end|>
@article{guiraud2006termination,
    title={Termination orders for 3-dimensional rewriting},
    author={Yves Guiraud},
    journal={Journal of Pure and Applied Algebra, Volume 207, Issue 2, October
  2006, Pages 341-371},
    year={2006},
    doi={10.1016/j.jpaa.2005.10.011},
    archivePrefix={arXiv},
    eprint={math/0612083},
    primaryClass={math.CT cs.LO}
}