Termination of Rewriting with Strategy Annotations

DOI10.1007/3-540-45653-8_46zbMath1275.68084OpenAlexW2108969240MaRDI QIDQ2996200

Salvador Lucas

Publication date: 6 May 2011

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45653-8_46

zbMATH Keywords

terminationrewriting strategies

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (13)

Relaxing monotonicity for innermost termination ⋮ Proving termination of context-sensitive rewriting by transformation ⋮ Rewriting Strategies and Strategic Rewrite Programs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Semantic foundations for generalized rewrite theories ⋮ Proving Termination Properties with mu-term ⋮ Applications and extensions of context-sensitive rewriting ⋮ Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting ⋮ Just-in-time ⋮ Lazy Rewriting and Context-Sensitive Rewriting ⋮ On-demand strategy annotations revisited: an improved on-demand evaluation strategy ⋮ Context-sensitive rewriting strategies

Uses Software

• OBJ3

This page was built for publication: Termination of Rewriting with Strategy Annotations