An Integrated Development of Buchberger's Algorithm in Coq - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2001

An Integrated Development of Buchberger's Algorithm in Coq

Abstract

We present an integrated formal development of Buchberger's algorithm in Coq, that is we prove constructively the existence of Gröbner bases without explicitly writing the algorithm. This formalisation is based on an external formalisation in Coq by Théry, and an integrated abstract development in Agda. We end by discussing some experiences and differences between the two proof-styles and theorem-provers. This report was completed in March 2000.
Fichier principal
Vignette du fichier
RR-4271.pdf (290.19 Ko) Télécharger le fichier

Dates and versions

inria-00072316 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00072316 , version 1

Cite

Henrik Persson. An Integrated Development of Buchberger's Algorithm in Coq. RR-4271, INRIA. 2001. ⟨inria-00072316⟩
73 View
260 Download

Share

Gmail Mastodon Facebook X LinkedIn More