Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 337-363 |
| Number of pages | 27 |
| Journal | Journal of Automated Reasoning |
| Volume | 29 |
| Issue number | 3-4 |
| DOIs | |
| Publication status | Published - 1 Dec 2002 |
| Externally published | Yes |
Keywords
- Computer algebra
- FOC language
Fingerprint
Dive into the research topics of 'Algorithms and proofs inheritance in the FOC language'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver