Termination of rewriting under strategies

DOI10.1145/1462179.1462182zbMath1351.68129OpenAlexW2090652385MaRDI QIDQ2946568

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

zbMATH Keywords

local strategyinductionterminationabstractionnarrowingordering constraintinnermostoutermost

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (9)

Rewriting Strategies and Strategic Rewrite Programs ⋮ Twenty years of rewriting logic ⋮ Proving termination by dependency pairs and inductive theorem proving ⋮ A Transformational Approach to Prove Outermost Termination Automatically ⋮ Proving weak properties of rewriting ⋮ From Outermost Termination to Innermost Termination ⋮ Termination Analysis by Dependency Pairs and Inductive Theorem Proving ⋮ Termination of Priority Rewriting ⋮ Applications and extensions of context-sensitive rewriting

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