Recursive path orderings can be context-sensitive

DOI10.1007/3-540-45620-1_27MaRDI QIDQ4809069zbMATH OpenFDO

Authors Cristina Borralleras, Salvador Lucas, Albert Rubio

Publication date 12 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2392/23920314.htm

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Proving termination of context-sensitive rewriting by transformation
• Proving termination of context-sensitive rewriting with MU-TERM
• Foundations of Software Science and Computation Structures
• Context-sensitive dependency pairs
• Termination of context-sensitive rewriting

Cited in

(17)

• Context-sensitive rewriting strategies
• Proving operational termination of membership equational programs
• Lazy rewriting and context-sensitive rewriting
• Correct and complete (positive) strategy annotations for \textsf{OBJ}
• Improving the context-sensitive dependency graph
• Proving termination of context-sensitive rewriting with MU-TERM
• A Lambda-Free Higher-Order Recursive Path Order
• Proving termination properties with \textsc{mu-term}
• Polymorphic higher-order recursive path orderings
• Foundations of Software Science and Computation Structures
• Polynomials over the reals in proofs of termination : from theory to practice
• Recursive Path Orderings Can Also Be Incremental
• A Higher-Order Iterative Path Ordering
• Improving associative path orderings
• Relaxing monotonicity for innermost termination
• Proving termination of context-sensitive rewriting by transformation
• Context-sensitive dependency pairs

This page was built for publication: Recursive path orderings can be context-sensitive

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4809069)