Proving Equalities in a Commutative Ring Done Right in Coq - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2005

Proving Equalities in a Commutative Ring Done Right in Coq

Benjamin Gregoire
Assia Mahboubi
  • Function : Correspondent author

Abstract

We present a new implementation of a reflexive tactic which solves equalities in a ring structure inside the Coq system. The efficiency is improved to a point that we can now prove equalities that were previously beyond reach. A special care has been taken to implement efficient algorithms while keeping the complexity of the correctness proofs low. This leads to a single tool, with a single implementation, which can be addressed for a ring or for a semi-ring, abstract or not, using the Leibniz equality or a setoid equality. This example shows that such reflective methods can be effectively used in symbolic computation.

Dates and versions

hal-00819484 , version 1 (01-05-2013)

Identifiers

Cite

Benjamin Gregoire, Assia Mahboubi. Proving Equalities in a Commutative Ring Done Right in Coq. TPHOLs 2005, Aug 2005, Oxford, United Kingdom. pp.98-113, ⟨10.1007/11541868_7⟩. ⟨hal-00819484⟩

Collections

INRIA INRIA2
310 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More