Termination of context-sensitive rewriting

DOI10.1007/3-540-62950-5_69zbMath1379.68207OpenAlexW2114745030MaRDI QIDQ4594226

Hans Zantema

Publication date: 17 November 2017

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/18721

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (17)

Relaxing monotonicity for innermost termination ⋮ mu-term: Verify Termination Properties Automatically (System Description) ⋮ Termination of \(\{aa\rightarrow bc,bb\rightarrow ac,cc\rightarrow ab\}\) ⋮ Proving termination of context-sensitive rewriting by transformation ⋮ Polynomials over the reals in proofs of termination : from theory to practice ⋮ On tree automata that certify termination of left-linear term rewriting systems ⋮ Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting ⋮ Lazy productivity via termination ⋮ Proving operational termination of membership equational programs ⋮ Context-sensitive dependency pairs ⋮ Derivational complexity and context-sensitive Rewriting ⋮ Induction for termination with local strategies ⋮ Lazy Rewriting and Context-Sensitive Rewriting ⋮ Context-sensitive rewriting strategies ⋮ Improving the Context-sensitive Dependency Graph ⋮ Proving Termination of Context-Sensitive Rewriting with MU-TERM ⋮ Towards an algebraic theory of typed mobile processes

This page was built for publication: Termination of context-sensitive rewriting