Exact real computer arithmetic with continued fractions
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Theorems and algorithms: an interface between Isabelle and Maple
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Multiple-valued complex functions and computer algebra
ACM SIGSAM Bulletin
Enhancing the NUPRL proof development system and applying it to computational abstract algebra
Enhancing the NUPRL proof development system and applying it to computational abstract algebra
REDLOG: computer algebra meets computer logic
ACM SIGSAM Bulletin
A pragmatic approach to extending provers by computer algebra — with applications to coding theory
Fundamenta Informaticae - Special issue on symbolic computation and artificial intelligence
Specification and integration of theorem provers and computer algebra systems
Fundamenta Informaticae - Special issue on symbolic computation and artificial intelligence
Computer algebra systems: a practical guide
Computer algebra systems: a practical guide
The TH ∃ OREM ∀ project: a progress report
Symbolic computation and automated reasoning
Journal of Symbolic Computation - Special issue on computer algebra and mechanized reasoning: selected St. Andrews' ISSAC/Calculemus 2000 contributions
A Skeptic’s Approach to Combining HOL and Maple
Journal of Automated Reasoning
Analytica – An Experiment in Combining Theorem Proving and Symbolic Computation
Journal of Automated Reasoning
HOL Light: A Tutorial Introduction
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
The design of maple: A compact, portable and powerful computer algebra system
EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra
Non-Trivial Symbolic Computations in Proof Planning
FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
ARITH '01 Proceedings of the 15th IEEE Symposium on Computer Arithmetic
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Automating Side Conditions in Formalized Partial Functions
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Combining Isabelle and QEPCAD-B in the Prover's Palette
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
CTP-based programming languages?: considerations about an experimental design
ACM Communications in Computer Algebra
Proof assistant decision procedures for formalizing origami
MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
View of computer algebra data from Coq
MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
Hi-index | 0.00 |
We present a prototype of a computer algebra system that is built on top of a proof assistant, HOL Light. This architecture guarantees that one can be certain that the system will make no mistakes. All expressions in the system will have precise semantics, and the proof assistant will check the correctness of all simplifications according to this semantics. The system actually proveseach simplification performed by the computer algebra system.Although our system is built on top of a proof assistant, we designed the user interface to be very close in spirit to the interface of systems like Maple and Mathematica. The system, therefore, allows the user to easily probe the underlying automation of the proof assistant for strengths and weaknesses with respect to the automation of mainstream computer algebra systems. The system that we present is a prototype, but can be straightforwardly scaled up to a practical computer algebra system.