QuickCheck: a lightweight tool for random testing of Haskell programs
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
A constructive algebraic hierarchy in Coq
Journal of Symbolic Computation - Integrated reasoning and algebra systems
Using Reflection to Build Efficient and Certified Decision Procedures
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
Implementing the cylindrical algebraic decomposition within the Coq system
Mathematical Structures in Computer Science
A Mechanized Proof of the Basic Perturbation Lemma
Journal of Automated Reasoning
Executing in Common Lisp, Proving in ACL2
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Towards Constructive Homological Algebra in Type Theory
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Extraction in Coq: An Overview
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Modelling Differential Structures in Proof Assistants: The Graded Case
Computer Aided Systems Theory - EUROCAST 2009
Generating certified code from formal proofs: a case study in homological algebra
Formal Aspects of Computing
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
A modular formalisation of finite group theory
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Formalization of a normalization theorem in simplicial topology
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
Computational content encoded into constructive type theory proofs can be used to make computing experiments over concrete data structures. In this paper, we explore this possibility when working in Coq with chain complexes of infinite type (that is to say, generated by infinite sets) as a part of the formalization of a hierarchy of homological algebra structures.