A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
From Linear Term Rewriting to Graph Rewriting with Preservation of Termination
Electronic Proceedings in Theoretical Computer Science
Encodings of term rewriting systems (TRSs) into graph rewriting systems usually lose global termination, meaning the encodings do not terminate on all graphs. A typical encoding of the terminating TRS rule a(b(x)) → b(a(x)), for example, may be indefinitely applicable along a cycle of a's and b's. Recently, we introduced PBPO + , a graph rewriting formalism in which rules employ a type graph to specify transformations and control rule applicability. In the present paper, we show that PBPO +doi:10.4204/eptcs.350.2 fatcat:s5gfmibmgfdhbipn3wqm54eowu