Outermost ground termination - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Electronic Notes in Theoretical Computer Science Year : 2003

Outermost ground termination


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. The induction ordering is not needed a priori, but is a solution of constraints set along the proof. Our method applies in particular to systems that are non-terminating for the standard strategy nor even for the lazy strategy.
No file

Dates and versions

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


  • HAL Id : inria-00099654 , version 1


Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Outermost ground termination. Electronic Notes in Theoretical Computer Science, 2003, 71, 20 p. ⟨inria-00099654⟩
63 View
0 Download


Gmail Facebook X LinkedIn More