scientific article

From MaRDI portal
Revision as of 21:48, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3075246

zbMath1211.68368MaRDI QIDQ3075246

Georges Gonthier, Assia Mahboubi

Publication date: 10 February 2011

Full work available at URL: http://jfr.cib.unibo.it/article/view/1979

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (34)

Proof mining with dependent typesEisbach: a proof method language for IsabelleUnnamed ItemAn intuitionistic proof of a discrete form of the Jordan curve theorem formalized in Coq with combinatorial hypermapsPackaging Mathematical StructuresTrace-Based Coinductive Operational Semantics for WhileProof-relevant Horn Clauses for Dependent Type Inference and Term SynthesisHammer for Coq: automation for dependent type theoryFoundations of dependent interoperabilityProof-Producing Reflection for HOLFoundational Property-Based TestingA Certified Reduction Strategy for Homological Image ProcessingComputational Complexity Via Finite TypesFormalising Mathematics in Simple Type TheoryUnnamed ItemCertifying assembly with formal security proofs: the case of BBSDesigning and proving correct a convex hull algorithm with hypermaps in CoqA Short Presentation of CoqCanonical Big OperatorsRecycling proof patterns in Coq: case studiesFormalization of the Domination Chain with Weighted Parameters (Short Paper)Partiality, State and Dependent TypesFrom LCF to Isabelle/HOLIncidence Simplicial Matrices Formalized in Coq/SSReflectFrom Sets to Bits in CoqA formalization of multi-tape Turing machinesPoint-Free, Set-Free Concrete Linear AlgebraSome Wellfounded Trees in UniMathFinite Groups Representation Theory with CoqA Decision Procedure for Regular Expression Equivalence in Type TheoryCoquet: A Coq Library for Verifying HardwareImplementation of Bourbaki's Elements of Mathematics in Coq: Part Two, From Natural Numbers to Real NumbersTheorem of three circles in CoqFormally verified certificate checkers for hardest-to-round computation


Uses Software






This page was built for publication: