Computing Constructor Forms with Non Terminating Rewrite Programs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Computing Constructor Forms with Non Terminating Rewrite Programs


In the context of the study of rule-based programming, we focus in this paper on the property of C-reducibility, expressing that every term reduces to a constructor term on at least one of its rewriting derivations. This property implies completeness of function definitions, and enables to stop evaluations of a program on a constructor form, even if the program is not terminating. We propose an inductive procedure proving C-reducibility of rewriting. The rewriting relation on ground terms is simulated through an abstraction mechanism and narrowing. The induction hypothesis allows assuming that terms smaller than the starting terms rewrite into a constructor term. The existence of the induction ordering is checked during the proof process, by ensuring satisfiability of ordering constraints. The proof is constructive, in the sense that the branch leading to a constructor term can be computed from the proof trees establishing C-reducibility for every term.
Fichier principal
Vignette du fichier
ppdp51-gnaedig-pour-hal.pdf (266.68 Ko) Télécharger le fichier

Dates and versions

inria-00112083 , version 1 (07-11-2006)


  • HAL Id : inria-00112083 , version 1


Isabelle Gnaedig, Hélène Kirchner. Computing Constructor Forms with Non Terminating Rewrite Programs. Symposium on Principles and Practice of Declarative Programming - PPDP'06, Jul 2006, Venise/Italie. ⟨inria-00112083⟩
209 View
121 Download


Gmail Facebook X LinkedIn More