Verification of the Redecoration Algorithm for Triangular Matrices
Triangular matrices with a dedicated type for the diagonal elements can be profitably represented by a nested datatype, i.e., a heterogeneous family of inductive datatypes. These families are fully supported since the version 8.1 of the Coq theorem proving environment, released in 2007. Redecoration of triangular matrices has a succinct implementation in this representation, thus giving the challenge of proving it correct. This has been achieved within Coq, using also induction with measures. An axiomatic approach allowed a verification in the Isabelle theorem prover, giving insights about the differences of both systems.
KeywordsTriangular Matrix List Length Recursive Call Triangular Matrice Proof Assistant
Unable to display preview. Download preview PDF.
- 1.Abel, A., Matthes, R.: Fixed points of type constructors and primitive recursion. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol. 3210, pp. 190–204. Springer, Heidelberg (2004)Google Scholar
- 10.Coq Development Team: The Coq Proof Assistant Reference Manual Version 8.1. Project LogiCal, INRIA (2006), System available at: http://coq.inria.fr
- 12.Matthes, R., Strecker, M.: Coq and Isabelle development for Verification of the Redecoration Algorithm for Triangular Matrices (2007), http://www.irit.fr/~Ralph.Matthes/CoqIsabelle/TYPES07/
- 15.Uustalu, T., Vene, V.: The dual of substitution is redecoration. In: Hammond, K., Curtis, S. (eds.) Trends in Functional Programming 3, Intellect, Bristol / Portland, OR, pp. 99–110 (2002)Google Scholar