The following pages link to Laurent Théry (Q742366):
Displaying 26 items.
- Implementing geometric algebra products with binary trees (Q742367) (← links)
- Interactive theorem proving with temporal logic (Q1355780) (← links)
- A machine-checked implementation of Buchberger's algorithm (Q1595926) (← links)
- Distant decimals of \(\pi \): formal proofs of some algorithms computing them and guarantees of exact computation (Q1663216) (← links)
- Formally verified certificate checkers for hardest-to-round computation (Q2352500) (← links)
- (Q2754056) (← links)
- Proof Certificates for Algebra and Their Application to Automatic Geometry Theorem Proving (Q3003228) (← links)
- (Q3024829) (← links)
- A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses (Q3100209) (← links)
- A Formalization of Grassmann-Cayley Algebra in COQ and Its Application to Theorem Proving in Projective Geometry (Q3102734) (← links)
- A Computational Approach to Pocklington Certificates in Type Theory (Q3434628) (← links)
- A Modular Formalisation of Finite Group Theory (Q3523168) (← links)
- Primality Proving with Elliptic Curves (Q3523185) (← links)
- Proof Pearl: Revisiting the Mini-rubik in Coq (Q3543668) (← links)
- Proving Pearl: Knuth’s Algorithm for Prime Numbers (Q3559771) (← links)
- A Purely Functional Library for Modular Arithmetic and Its Application to Certifying Large Prime Numbers (Q3613425) (← links)
- (Q4249903) (← links)
- (Q4490725) (← links)
- (Q4790659) (← links)
- (Q4989411) (← links)
- Formal Correctness of Comparison Algorithms Between Binary64 and Decimal64 Floating-Point Numbers (Q5086229) (← links)
- A Machine-Checked Proof of the Odd Order Theorem (Q5327343) (← links)
- Extending Coq with Imperative Features and Its Application to SAT Verification (Q5747643) (← links)
- (Q5875421) (← links)
- Quantitative continuity and Computable Analysis in Coq (Q5875440) (← links)
- Proof Pearl : Playing with the Tower of Hanoi Formally (Q6099627) (← links)
