Rewriting Techniques and Applications

DOI10.1007/b98160zbMath1187.68275OpenAlexW2661706449MaRDI QIDQ5901572

Nao Hirokawa, Aart Middeldorp

Publication date: 30 April 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98160

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (22)

Relative termination via dependency pairs ⋮ A combination framework for complexity ⋮ The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors ⋮ Reducing Relative Termination to Dependency Pair Problems ⋮ Termination of string rewriting proved automatically ⋮ Proving termination of context-sensitive rewriting by transformation ⋮ Polynomials over the reals in proofs of termination : from theory to practice ⋮ Dependency pairs for proving termination properties of conditional term rewriting systems ⋮ Tyrolean termination tool: techniques and features ⋮ Mechanizing and improving dependency pairs ⋮ Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting ⋮ Matrix interpretations for proving termination of term rewriting ⋮ The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques ⋮ Enhancing dependency pair method using strong computability in simply-typed term rewriting ⋮ Automating the dependency pair method ⋮ Context-sensitive dependency pairs ⋮ Multi-dimensional interpretations for termination of term rewriting ⋮ Local Termination ⋮ Termination of Narrowing Using Dependency Pairs ⋮ Increasing Interpretations ⋮ The size-change principle and dependency pairs for termination of term rewriting ⋮ Tuple interpretations for termination of term rewriting

This page was built for publication: Rewriting Techniques and Applications