Termination orders for 3-dimensional rewriting
Yves Guiraud
Abstract
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.
Create a lesson
Related papers
Failure of Higher-Order Truth within Intuitionistic Propositional Logic
Lingyuan Ye, Yiqi Xu
Finitistic dimensions in triangulated categories with a compact silting generator
Xiaoyan Yang
De Morgan's Laws in Tensor-Triangular Geometry
Mark Lyttle
Absolute colimits
Richard Garner, Ross Street
A Categorical Framework for the Direct Integration of Banach Spaces
Daniel Funck, Giacomo Gavelli
The Cofree Functor on G-Sets and Its Approximations
Frank Murphy-Hernandez