Termination of rewriting under strategies

DOI10.1145/1462179.1462182zbMATH Open1351.68129OpenAlexW2090652385MaRDI QIDQ2946568FDOQ2946568

Authors: Isabelle Gnaedig, Hélène Kirchner 

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00182432/file/version-preli-tocl.pdf

Recommendations

• Induction for termination with local strategies
• Termination of rewriting with strategy annotations
• Outermost ground termination
• Theoretical Aspects of Computing - ICTAC 2004
• scientific article; zbMATH DE number 3930339

zbMATH Keywords

abstractioninductionterminationnarrowinglocal strategyordering constraintinnermostoutermost

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (17)

• Twenty years of rewriting logic
• Termination of Priority Rewriting
• Faithful (meta-)encodings of programmable strategies into term rewriting systems
• A Transformational Approach to Prove Outermost Termination Automatically
• Proving weak properties of rewriting
• Strategic rewriting
• Rewriting strategies and strategic rewrite programs
• Theoretical Aspects of Computing - ICTAC 2004
• Termination Analysis by Dependency Pairs and Inductive Theorem Proving
• Termination of rewriting with strategy annotations
• Proving termination by dependency pairs and inductive theorem proving
• A faithful encoding of programmable strategies into term rewriting systems
• Applications and extensions of context-sensitive rewriting
• Termination and normalisation under strategy proofs in ELAN
• Proving Positive Almost Sure Termination Under Strategies
• Induction for termination with local strategies
• From Outermost Termination to Innermost Termination

This page was built for publication: Termination of rewriting under strategies

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