Outermost ground termination - Archive ouverte HAL Access content directly
Conference Papers Year : 2002

Outermost ground termination

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

Abstract

We propose a semi-automatic inductive process to prove termination of outermost rewriting on ground term algebras. The method is based on an abstraction mechanism, schematizing normalisation of subterms, and on narrowing, schematizing reductions on ground terms. Our method applies in particular to non-terminating systems which are terminating with an outermost 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.
Not file

Dates and versions

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

Identifiers

  • HAL Id : inria-00100755 , version 1

Cite

Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Outermost ground termination. 4th International Workshop on Rewriting Logic and its Applications - WRLA' 02, 2002, Pisa, Italy, 16 p. ⟨inria-00100755⟩
61 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More