Proving inductive equalities algorithms and implementation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1987

Proving inductive equalities algorithms and implementation

Azzedine Lazrek
  • Function : Author
Pierre Lescanne
  • Function : Author
Jean-Jacques Thiel
  • Function : Author


The aim of this paper is first to describe an algorithm for testing sufficient completeness and second to present concepts necessary to understand the behavior of an implementation of an automatic prover of inductive properties of functional programs or specifications of abstract data types. These programs or specifications are rewriting systems and relations between constructors are allowed. The method is essentially based on a proof by consistency implemented through a Knuth-Bendix completion, extending the Huet-Hullot approach in many respects. This requires to prove the inductive completeness of the set of relations among the constructors, and the relative (or sufficient) completeness of the definitions of the function. After introducing the concept of inductive completeness, inductively complete theories are presented. On the other hand a test of relative completeness is implemented by an extension of an algorithm that worked only when no relation among constructors existed.
Fichier principal
Vignette du fichier
RR-0682.pdf (1.22 Mo) Télécharger le fichier

Dates and versions

inria-00075871 , version 1 (24-05-2006)


  • HAL Id : inria-00075871 , version 1


Azzedine Lazrek, Pierre Lescanne, Jean-Jacques Thiel. Proving inductive equalities algorithms and implementation. [Research Report] RR-0682, INRIA. 1987. ⟨inria-00075871⟩
59 View
26 Download


Gmail Facebook Twitter LinkedIn More