Induction for termination with local strategies - Archive ouverte HAL Access content directly
Journal Articles Electronic Notes in Theoretical Computer Science Year : 2001

Induction for termination with local strategies

(1) , (1) , (1)
1

Abstract

In this paper, we propose a method for specifically proving termination of rewriting with particular strategies: local strategies on operators. An inductive proof procedure is proposed, based on an explicit induction on the termination property. Given a term, the proof principle relies on alternatively applying the induction hypothesis on its subterms, by abstracting the subterms with induction variables, and narrowing the obtained terms in one step, according to the strategy. The induction relation, an F-stable ordering having the subterm property, is not given a priori, but its existence is checked along the proof, by testing satisfiability of ordering constraints.

Dates and versions

inria-00100418 , version 1 (26-09-2006)

Identifiers

Cite

Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Induction for termination with local strategies. Electronic Notes in Theoretical Computer Science, 2001, 58 (2), pp.155-188. ⟨10.1016/S1571-0661(04)00284-1⟩. ⟨inria-00100418⟩
105 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More