Computable analysis and notions of continuity in Coq von Steinberg, Florian, Théry, Laurent, Thies, Holger

Volltext

A computational approach to pocklington certificates in type theory von GREGOIRE, Benjamin, THERY, Laurent, WERNER, Benjamin

Volltext

A Machine-Checked Proof of the Odd Order Theorem von Gonthier, Georges, Asperti, Andrea, Avigad, Jeremy, Bertot, Yves, Cohen, Cyril, Garillot, François, Le Roux, Stéphane, Mahboubi, Assia, O’Connor, Russell, Ould Biha, Sidi, Pasca, Ioana, Rideau, Laurence, Solovyev, Alexey, Tassi, Enrico, Théry, Laurent

Volltext

Implementing Geometric Algebra Products with Binary Trees von Fuchs, Laurent, Théry, Laurent

Volltext

A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses von Armand, Michael, Faure, Germain, Grégoire, Benjamin, Keller, Chantal, Théry, Laurent, Werner, Benjamin

Volltext

Proving Pearl: Knuth’s Algorithm for Prime Numbers von THERY, Laurent

Volltext

Foreword to the Special Focus on Formal Proofs for Mathematics and Computer Science von Théry, Laurent, Wiedijk, Freek

Volltext

Formally Verified Certificate Checkers for Hardest-to-Round Computation von Martin-Dorel, Érik, Hanrot, Guillaume, Mayero, Micaela, Théry, Laurent

Volltext

A Purely Functional Library for Modular Arithmetic and Its Application to Certifying Large Prime Numbers von GREGOIRE, Benjamin, THERY, Laurent

Volltext

A Generic Library for Floating-Point Numbers and Its Application to Exact Computing von Daumas, Marc, Rideau, Laurence, Théry, Laurent

Volltext

Theorem proving in Higher Order Logics von Bertot, Yves, Dowek, Gilles, Hirschowitz, Andre, Paulin, Christine, Thery, Laurent

Volltext

Formal Correctness of Comparison Algorithms Between Binary64 and Decimal64 Floating-Point Numbers von Blot, Arthur, Muller, Jean-Michel, Théry, Laurent

Volltext

Theorem Proving in Higher Order Logics: 12th International Conference, TPHOLs’ 99 Nice, France, September 14–17, 1999 Proceedings von Bertot, Yves, Dowek, Gilles, Théry, Laurent, Hirschowitz, André, Paulin, Christine

Volltext

Isar – A Generic Interpretative Approach to Readable Formal Proof Documents von Wenzel, Markus

Volltext

A Formalization of Grassmann-Cayley Algebra in Coq and Its Application to Theorem Proving in Projective Geometry von Fuchs, Laurent, Théry, Laurent

Volltext

A Machine-Checked Implementation of Buchberger's Algorithm von Thery, Laurent

Volltext

Extending Coq with Imperative Features and Its Application to SAT Verification von Armand, Michaël, Grégoire, Benjamin, Spiwack, Arnaud, Théry, Laurent

Volltext

Electrical rotating machine with power interconnecting part von DUBUC, Cyril, THERY, Laurent

Volltext bestellen

Proof Pearl: Revisiting the Mini-rubik in Coq von Théry, Laurent

Volltext

Distant Decimals of π: Formal Proofs of Some Algorithms Computing Them and Guarantees of Exact Computation von Bertot, Yves, Rideau, Laurence, Théry, Laurent

Volltext