The HOL Multivariate Analysis Library (HMA) of Isabelle/HOL is focused on concrete types such as ℝ, ℂ and ℝ n and on algebraic structures such as real vector spaces and Euclidean spaces, represented by means of type classes. The generalization of HMA to more abstract algebraic structures is something desirable but it has not been tackled yet. Using that library, we were able to prove the Gauss-Jordan algorithm over real matrices, but our interest lied on generating verified code for matrices over arbitrary fields, greatly increasing the range of applications of such an algorithm. This short paper presents the steps that we did and the methodology that we devised to generalize such a library, which were successful to generalize the Gauss-Jordan algorithm to matrices over arbitrary fields.
CITATION STYLE
Aransay, J., & Divasón, J. (2015). Generalizing a mathematical analysis library in Isabelle/HOL. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9058, pp. 415–421). Springer Verlag. https://doi.org/10.1007/978-3-319-17524-9_30
Mendeley helps you to discover research relevant for your work.