Making proofs in a hierarchy of mathematical structures - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

Making proofs in a hierarchy of mathematical structures

Mathieu Jaume
  • Fonction : Auteur
  • PersonId : 901267

Résumé

The FoC language is dedicated to the development of certified computer algebra libraries. These libraries are based on a hierarchy of implementations of mathematical structures. A FoC structure, called a species, contains the declarations of primitive operations and axioms, the definitions of derived operations, and theorems with their proofs. It is built through inheritance steps from previously existing structures, which includes in particular the redefinition of an operation. In this paper, we show that such a redefinition may have an huge impact on some of the proofs of the species, and may even invalidate some of them. We also describe what information the FoC system can give to the user about the proofs he is doing. As a conclusion, we propose a coding style to minimize the number of proofs that must be redone after a redefinition.
Fichier non déposé

Dates et versions

hal-01531083 , version 1 (01-06-2017)

Identifiants

  • HAL Id : hal-01531083 , version 1

Citer

Virgile Prévosto, Mathieu Jaume. Making proofs in a hierarchy of mathematical structures. Calculemus 2003 - 11th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, Sep 2003, Rome, Italy. pp.89-100. ⟨hal-01531083⟩
34 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More