A mechanized proof of the Basic Perturbation Lemma
- Aransay, J. 1
- Ballarin, C. 2
- Rubio, J. 1
-
1
Universidad de La Rioja
info
-
2
University of Innsbruck
info
ISSN: 0168-7433
Año de publicación: 2008
Volumen: 40
Número: 4
Páginas: 271-292
Tipo: Artículo
Otras publicaciones en: Journal of Automated Reasoning
Proyectos relacionados
Resumen
We present a complete mechanized proof of the result in homological algebra known as basic perturbation lemma. The proof has been carried out in the proof assistant Isabelle, more concretely, in the implementation of higher-order logic (HOL) available in the system. We report on the difficulties found when dealing with abstract algebra in HOL, and also on the ongoing stages of our project to give a certified version of some of the algorithms present in the Kenzo symbolic computation system. © 2007 Springer Science+Business Media B.V.