A Transformational Approach to Prove Outermost Termination Automatically

DOI10.1016/j.entcs.2009.03.032zbMath1294.68099OpenAlexW2133910448MaRDI QIDQ5170158

Matthias Raffelsieper, Hans Zantema

Publication date: 22 July 2014

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.03.032

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (6)

Lazy productivity via termination ⋮ From Outermost Termination to Innermost Termination ⋮ Applications and extensions of context-sensitive rewriting ⋮ Loops under Strategies ⋮ Local Termination ⋮ From Outermost to Context-Sensitive Rewriting

Uses Software

• Haskell
• CafeOBJ
• Maude
• Tyrolean
• AProVE
• Jambox

Cites Work

• Explicit representation of terms defined by counter examples
• Termination of rewriting under strategies
• Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Transformation techniques for context-sensitive rewrite systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Transformational Approach to Prove Outermost Termination Automatically