Pages that link to "Item:Q5371950"
From MaRDI portal
The following pages link to Formalisation in higher-order logic and code generation to functional languages of the Gauss-Jordan algorithm (Q5371950):
Displaying 9 items.
- Formalisation of the computation of the echelon form of a matrix in Isabelle/HOL (Q333325) (← links)
- Generating certified code from formal proofs: a case study in homological algebra (Q968307) (← links)
- Using abstract stobjs in ACL2 to compute matrix normal forms (Q1687754) (← links)
- A formalization of the Smith normal form in higher-order logic (Q2102950) (← links)
- A formalisation in HOL of the fundamental theorem of linear algebra and its application to the solution of the least squares problem (Q2362109) (← links)
- Gaussian elimination: a case study in efficient genericity with MetaOCaml (Q2507767) (← links)
- Formalization and Execution of Linear Algebra: From Theorems to Algorithms (Q3453644) (← links)
- A formal proof of Sasaki-Murao algorithm (Q5195247) (← links)
- A Formal Proof of the Computation of Hermite Normal Form in a General Setting (Q6108811) (← links)