Loops under Strategies

DOI10.1007/978-3-642-02348-4_2zbMath1242.68142OpenAlexW1839569401MaRDI QIDQ3636816

René Thiemann, Christian Sternagel

Publication date: 30 June 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-02348-4_2

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Proving Termination Properties with mu-term

Uses Software

• Haskell
• Tyrolean
• Jambox
• Matchbox

Cites Work

• Unnamed Item
• Unnamed Item
• Termination of string rewriting proved automatically
• Loop detection in term rewriting using the eliminating unfoldings
• On Proving Uniform Termination and Restricted Termination of Rewriting Systems
• Deciding Innermost Loops
• Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
• From Outermost Termination to Innermost Termination
• Term Rewriting and All That
• A Transformational Approach to Prove Outermost Termination Automatically
• Frontiers of Combining Systems
• Transformation techniques for context-sensitive rewrite systems

This page was built for publication: Loops under Strategies