Generalizing a mathematical analysis library in Isabelle/HOL

  1. Aransay, J. 1
  2. Divasón, J. 1
  1. 1 Universidad de La Rioja
    info

    Universidad de La Rioja

    Logroño, España

    ROR https://ror.org/0553yr311

Revue:
Lecture Notes in Computer Science

ISSN: 0302-9743

Année de publication: 2015

Volumen: 9058

Pages: 415-421

Type: Article

DOI: 10.1007/978-3-319-17524-9_30 SCOPUS: 2-s2.0-84942607912 WoS: WOS:000361977000030 GOOGLE SCHOLAR

D'autres publications dans: Lecture Notes in Computer Science

Résumé

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. © Springer International Publishing Switzerland 2015.