The following pages link to Refinements for Free! (Q2938045):
Displayed 20 items.
- Formalisation of the computation of the echelon form of a matrix in Isabelle/HOL (Q333325) (← links)
- Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques (Q1640636) (← links)
- Distant decimals of \(\pi \): formal proofs of some algorithms computing them and guarantees of exact computation (Q1663216) (← links)
- Graph theory in Coq: minors, treewidth, and isomorphisms (Q2209536) (← links)
- Formally verified certificate checkers for hardest-to-round computation (Q2352500) (← 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)
- Automatic refinement to efficient data structures: a comparison of two approaches (Q2417948) (← links)
- From Sets to Bits in Coq (Q2798253) (← links)
- Foundations of dependent interoperability (Q4577812) (← links)
- Cubical Agda: A dependently typed programming language with univalence and higher inductive types (Q5016211) (← links)
- (Q5028480) (← links)
- Quotients of Bounded Natural Functors (Q5048992) (← links)
- Formalizing the Face Lattice of Polyhedra (Q5049001) (← links)
- Continuous and monotone machines (Q5089226) (← links)
- Formalisation in higher-order logic and code generation to functional languages of the Gauss-Jordan algorithm (Q5371950) (← links)
- Primitive Floats in Coq (Q5875413) (← links)
- A formalization of convex polyhedra based on the simplex method (Q5915783) (← links)
- Enabling floating-point arithmetic in the Coq proof assistant (Q6053846) (← links)
- A Formal Proof of the Computation of Hermite Normal Form in a General Setting (Q6108811) (← links)
- Flexible Correct-by-Construction Programming (Q6135766) (← links)