Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials
- 1 January 2006
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 438-452
- https://doi.org/10.1007/11814771_37
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Quantifier Elimination over Algebraically Closed Fields in a Proof Assistant using a Computer Algebra SystemElectronic Notes in Theoretical Computer Science, 2006
- A Purely Functional Library for Modular Arithmetic and Its Application to Certifying Large Prime NumbersLecture Notes in Computer Science, 2006
- Proving Equalities in a Commutative Ring Done Right in CoqLecture Notes in Computer Science, 2005
- Interactive Theorem Proving and Program DevelopmentTexts in Theoretical Computer Science. An EATCS Series, 2004
- Setoids in type theoryJournal of Functional Programming, 2003
- Algorithms in Real Algebraic GeometryPublished by Springer Science and Business Media LLC ,2003
- A Skeptic's Approach to Combining HOL and MapleJournal of Automated Reasoning, 1998
- Algorithms for Computer AlgebraPublished by Springer Science and Business Media LLC ,1992
- On Euclid's Algorithm and the Theory of SubresultantsJournal of the ACM, 1971
- Subresultants and Reduced Polynomial Remainder SequencesJournal of the ACM, 1967