Computer-Aided Reasoning: An Approach
Computer-Aided Reasoning: An Approach
A Mechanized Proof of the Basic Perturbation Lemma
Journal of Automated Reasoning
Effective homology and spectral sequences
Effective homology and spectral sequences
Towards Constructive Homological Algebra in Type Theory
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
ACL2 Verification of Simplicial Degeneracy Programs in the Kenzo System
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
A verified Common Lisp implementation of Buchberger's algorithm in ACL2
Journal of Symbolic Computation
Generating certified code from formal proofs: a case study in homological algebra
Formal Aspects of Computing
Computing in coq with infinite algebraic data structures
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Triangulations: Structures for Algorithms and Applications
Triangulations: Structures for Algorithms and Applications
Proving with ACL2 the correctness of simplicial sets in the kenzo system
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Applying ACL2 to the formalization of algebraic topology: simplicial polynomials
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Certified symbolic manipulation: bivariate simplicial polynomials
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Hi-index | 0.00 |
In this paper we present a complete formalization of the Normalization Theorem, a result in Algebraic Simplicial Topology stating that there exists a homotopy equivalence between the chain complex of a simplicial set, and a smaller chain complex for the same simplicial set, called the normalized chain complex. Even if the Normalization Theorem is usually stated as a higher-order result (with a Category Theory flavor) we manage to give a first-order proof of it. To this aim it is instrumental the introduction of an algebraic data structure called simplicial polynomial. As a demonstration of the validity of our techniques we developed a formal proof in the ACL2 theorem prover.