AXIOM: the scientific computation system
AXIOM: the scientific computation system
Theorems and algorithms: an interface between Isabelle and Maple
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
An OpenMath 1.0 implementation
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
A survey of the Theorema project
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
A Skeptic’s Approach to Combining HOL and Maple
Journal of Automated Reasoning
Algorithms and Proofs Inheritance in the FOC Language
Journal of Automated Reasoning
Exploring Abstract Algebra in Constructive Type Theory
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Algorithms and Proofs Inheritance in the FOC Language
Journal of Automated Reasoning
Parametric Linear Arithmetic over Ordered Fields in Isabelle/HOL
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Proof contexts with late binding
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Proceedings of the 7th Workshop on Programming Languages and Analysis for Security
| Hi-index | 0.00 |
In this paper, we present the FOC langugage, 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.