Canonical Big Operators - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Canonical Big Operators


In this paper, we present an approach to describe uniformly iterated “big” operations and to provide lemmas that encapsulate all the commonly used reasoning steps on these constructs. We show that these iterated operations can be handled generically using the syntactic notation and canonical structure facilities provided by the Coq system. We then show how these canonical big operations played a crucial enabling role in the study of various parts of linear algebra and multi-dimensional real analysis, as illustrated by the formal proofs of the properties of determinants, of the Cayley-Hamilton theorem and of Kantorovitch's theorem.
Fichier principal
Vignette du fichier
main.pdf (180.27 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00331193 , version 1 (15-10-2008)



Yves Bertot, Georges Gonthier, Sidi Ould Biha, Ioana Pasca. Canonical Big Operators. Theorem Proving in Higher Order Logics, Aug 2008, Montreal, Canada. ⟨10.1007/978-3-540-71067-7⟩. ⟨inria-00331193⟩


471 View
1041 Download



Gmail Facebook Twitter LinkedIn More