Résumé
In this paper, we present the FOC language, dedicated to the development of certified computer algebra libraries (that is sets of programs). These libraries are based on a hierarchy of implementations of mathematical structures. After presenting the core set of features of our language, we describe the static analyses, which reject inconsistent programs. We then show how we translate FOC definitions into OCAML and Coq, our target languages for the computational part and the proof checking, respectively.
| langue originale | Anglais |
|---|---|
| Pages (de - à) | 337-363 |
| Nombre de pages | 27 |
| journal | Journal of Automated Reasoning |
| Volume | 29 |
| Numéro de publication | 3-4 |
| Les DOIs | |
| état | Publié - 1 déc. 2002 |
| Modification externe | Oui |
Empreinte digitale
Examiner les sujets de recherche de « Algorithms and proofs inheritance in the FOC language ». Ensemble, ils forment une empreinte digitale unique.Contient cette citation
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver