Outermost ground termination - Extended version - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Rapport Année : 2002

Outermost ground termination - Extended version

Résumé

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.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : inria-00101079 , version 1

Citer

Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Outermost ground termination - Extended version. [Intern report] A02-R-493 || fissore02d, 2002, 38 p. ⟨inria-00101079⟩
57 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More