A constructive algebraic hierarchy in Coq
Journal of Symbolic Computation - Integrated reasoning and algebra systems
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
A Mechanized Proof of the Basic Perturbation Lemma
Journal of Automated Reasoning
Towards Constructive Homological Algebra in Type Theory
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
On the correctness of upper layers of automotive systems
Formal Aspects of Computing
Formal verification of a realistic compiler
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
Seamless Model Driven Systems Engineering Based on Formal Models
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Flyspeck II: the basic linear programs
Annals of Mathematics and Artificial Intelligence
Generating certified code from formal proofs: a case study in homological algebra
Formal Aspects of Computing
A modular formalisation of finite group theory
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Diagrammatic logic applied to a parameterisation process
Mathematical Structures in Computer Science
Developing the algebraic hierarchy with type classes in coq
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Incidence simplicial matrices formalized in Coq/SSReflect
MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
A certified module to study digital images with the kenzo system
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Verifying an algorithm computing discrete vector fields for digital imaging
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Certified symbolic manipulation: bivariate simplicial polynomials
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Computing persistent homology within Coq/SSReflect
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 5.23 |
In this paper, we present a complete formalization in the Coq theorem prover of an important algorithm in computational algebra, namely the calculation of the effective homology of a bicomplex. As a necessary tool, we encode a hierarchy of algebraic structures in constructive type theory, including graded and infinite data structures. The experience shows how some limitations of the Coq proof assistant to deal with this kind of algebraic data can be overcome by applying a separation of concerns principle; more concretely, we propose to distinguish in the representation of an algebraic structure (such as a group or a module) a behavioural part, containing operation signatures and axioms, and a structural part determining if the algebraic data is free, of finite type and so on.