Dealing with algebraic expressions over a field in Coq using Maple

Authors:
David Delahaye;Micaela Mayero
Affiliations:
CPR, CNAM, Département dInformatique, 292, rue Saint-Martin, 75141 Paris Cedex 03, France;PPS, Université Denis Diderot (Paris 7), 75251 Paris Cedex 05, France
Venue:
Journal of Symbolic Computation
Year:
2005

Citing 10
Cited 6

Theorems and algorithms: an interface between Isabelle and Maple

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Electronic communication of mathematics and the interaction of computer algebra systems and proof assistants

Journal of Symbolic Computation - Special issue on computer algebra and mechanized reasoning: selected St. Andrews' ISSAC/Calculemus 2000 contributions
Proof by computation in the Coq system

Theoretical Computer Science - Special issue on theories of types and proofs
On the role of OpenMath in interactive mathematical documents

Journal of Symbolic Computation - Calculemus-99: integrating computation and deduction
A Skeptic’s Approach to Combining HOL and Maple

Journal of Automated Reasoning
Autarkic Computations in Formal Proofs

Journal of Automated Reasoning
Using Reflection to Build Efficient and Certified Decision Procedures

TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Making Conjectures about Maple Functions

AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Non-Trivial Symbolic Computations in Proof Planning

FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
Omega: Towards a Mathematical Assistant

CADE-14 Proceedings of the 14th International Conference on Automated Deduction

'Galculator': functional prototype of a Galois-connection based proof assistant

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Context Aware Calculation and Deduction

Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Quantifier Elimination over Algebraically Closed Fields in a Proof Assistant using a Computer Algebra System

Electronic Notes in Theoretical Computer Science (ENTCS)
Retargeting openaxiom to poly/ML: towards an integrated proof assistants and computer algebra system framework

MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
A foundational view on integration problems

MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
A universal machine for biform theory graphs

CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe an interface between the Coq proof assistant and the Maple symbolic computation system, which mainly consists in importing, in Coq, Maple computations regarding algebraic expressions over fields. These can either be pure computations, which do not require any validation, or computations used during proofs, which must be proved (to be correct) within Coq. These correctness proofs are completed automatically thanks to the tactic Field, which deals with equalities over fields. This tactic, which may generate side conditions (regarding the denominators) that must be proved by the user, has been implemented in a reflexive way, which ensures both efficiency and certification. The implementation of this interface is quite light and can be very easily extended to get other Maple functions (in addition to the four functions we have imported and used in the examples given here).