Abstract
In this AFP entry we formalize Dershowitz' theorem that termination of a term
rewrite system (TRS) starting from arbitrary terms is equivalent to termination
starting from terms in the right-forward closures of right-hand sides, provided
that the TRS is right-linear or orthogonal. Our proof deviates from the original
one in that no reorderings of steps in infinite derivations are required, making
it more precise in its argumentation. We also integrate a later result that one
can weaken orthogonality to locally confluent overlay TRSs.
In order to arrive at these statements, we had to formalize two further results: Following Gramlich, we prove that for locally confluent overlay TRSs the notions of termination and innermost termination coincide; and we verify that narrowing with a right-linear TRS preserves linearity of terms.
For further details, we refer to our FSCD 2026 paper.
In order to arrive at these statements, we had to formalize two further results: Following Gramlich, we prove that for locally confluent overlay TRSs the notions of termination and innermost termination coincide; and we verify that narrowing with a right-linear TRS preserves linearity of terms.
For further details, we refer to our FSCD 2026 paper.
License
Topics
Related publications
- Thiemann, R., Hofbauer, D., Le Huitouze, U., & Waldmann, J. (2026). New and Formalized Proofs for Right-Forward Closures and Core Matrix Interpretations. In F. Pfenning (Ed.), LIPIcs, Volume 378, FSCD 2026 (No. 32; Vol. 378, pp. 32:1–32:19). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.FSCD.2026.32
Session Right_Forward_Closures
- Innermost_Rewriting
- Gramlich_Innermost_Switch
- Linear_Unification
- Linear_Narrowing
- Right_Forward_Closure