Projects per year
Persistent homology is one of the most active branches of computational algebraic topology with applications in several contexts such as optical character recognition or analysis of point cloud data. In this article, we report on the formal development of certified programs to compute persistent Betti numbers, an instrumental tool of persistent homology, using the COQ proof assistant together with the SSREFLECT extension. To this aim it has been necessary to formalize the underlying mathematical theory of these algorithms. This is another example showing that interactive theorem provers have reached a point where they are mature enough to tackle the formalization of nontrivial mathematical theories.
|Journal||ACM Transactions on Computational Logic|
|Publication status||Published - 1 Nov 2013|
FingerprintDive into the research topics of 'Computing persistent homology within Coq/SSReflect'. Together they form a unique fingerprint.
- 1 Finished
Coalgebraic Logic Programming for Type Inference: Parallelism and Corecursion for New Generation of Programming Languages (Joint with the University of Bath)
Engineering and Physical Sciences Research Council
1/09/13 → 31/01/17