Towards a certified and efficient computing of gröbner bases

Authors:
J. Santiago Jorge;Víctor M. Gulías;José L. Freire;Juan J. Sánchez
Affiliations:
MADS – LFCIA, Dept. de Computación, Universidade da Coruña, Coruña, Spain;MADS – LFCIA, Dept. de Computación, Universidade da Coruña, Coruña, Spain;MADS – LFCIA, Dept. de Computación, Universidade da Coruña, Coruña, Spain;MADS – LFCIA, Dept. de Computación, Universidade da Coruña, Coruña, Spain
Venue:
EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
Year:
2005

Citing 7
Cited 0

Constructing recursion operators in intuitionistic type theory

Journal of Symbolic Computation
The calculus of constructions

Information and Computation - Semantics of Data Types
Conception, evolution, and application of functional programming languages

ACM Computing Surveys (CSUR)
An introduction to functional programming

An introduction to functional programming
ML for the working programmer (2nd ed.)

ML for the working programmer (2nd ed.)
A Machine-Checked Implementation of Buchberger's Algorithm

Journal of Automated Reasoning
Interactive Theorem Proving and Program Development: Coq'Art The Calculus of Inductive Constructions

Interactive Theorem Proving and Program Development: Coq'Art The Calculus of Inductive Constructions

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an example of the implementation and verification of a functional program. We expose an experience in developing an application in the area of symbolic computation: the computing of Gröbner basis of a set of multivariate polynomials. Our aim is the formal certification of several aspects of the program written in the functional language Caml. In addition, efficient computing of the algorithm is another issue to take into account.