Canonical Big Operators

Abstract : 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.
Liste complète des métadonnées

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/inria-00331193
Contributor : Ioana Pasca <>
Submitted on : Wednesday, October 15, 2008 - 4:04:12 PM
Last modification on : Wednesday, September 12, 2018 - 1:16:37 AM
Document(s) archivé(s) le : Tuesday, October 9, 2012 - 1:50:08 PM

File

main.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

787

Files downloads

633