Coq
A formal proof assistant developed by the French National Institute for Research in Computer Science and Automation (INRIA), used for constructing and verifying mathematical proofs and program logic.
Core Facts
Formal verification tools such as Lean and Coq can be used to verify complete mathematical proofs generated by AI, thereby guaranteeing their correctness in a mathematical sense.
Formal proof systems (such as Lean, Coq, and Isabelle) require every reasoning step to conform to a predefined axiomatic system and be mechanically verified by computer
The core principle of formal verification tools is type theory or higher-order logic, which transforms mathematical correctness into a mechanically checkable computational problem.
Timeline (last 90 days)
Representative formal proof tools include Lean, Coq, and Isabelle, and their accompanying mathematical libraries (such as Lean's mathlib) have accumulated a vast number of formalized theorems.
Rocq is the name of the Coq proof assistant after its renaming in 2025, and is an interactive theorem prover based on dependent type theory.
The quality of specification drafts generated by LLMs on TLA+ is usually higher than on Coq/Isabelle, because TLA+ has simple syntax and abundant examples in the training corpus.
Theorem provers (such as Coq, Isabelle, Lean) are based on deductive reasoning and require manual guidance of proof steps; they can handle infinite state spaces, but their degree of automation is low and the learning curve is steep.
The core work of mathematicians intervening in AI mathematical results includes translating natural-language proofs into formal languages (such as Lean and Coq) and checking the logical validity of each step of reasoning.
Lean was initiated by Microsoft Research and has since developed the vast mathematics library mathlib; Coq is widely used for program correctness proofs.
A Hacker News comment points out that the verified kernel gives Lean a differentiating advantage in comparison with competitors such as Coq and Isabelle.
Proof assistants are software systems that support formal mathematics, with common representatives including Lean, Coq, Isabelle/HOL, Agda and others.
Lean was initiated by Microsoft Research and in recent years has become a mainstream choice thanks to the rapid expansion of the Mathlib mathematics library; Coq has a long history and is widely used in the field of formal verification.
Proof assistants such as Lean and Coq were originally designed to assist human mathematicians.
32 more timeline events
All Facts (20)
Formal verification tools such as Lean and Coq can be used to verify complete mathematical proofs generated by AI, thereby guaranteeing their correctness in a mathematical sense.
90%VerifiedFormal proof systems (such as Lean, Coq, and Isabelle) require every reasoning step to conform to a predefined axiomatic system and be mechanically verified by computer
80%VerifiedThe core principle of formal verification tools is type theory or higher-order logic, which transforms mathematical correctness into a mechanically checkable computational problem.
80%VerifiedLarge language models are demonstrating increasingly strong capabilities in mathematical reasoning, theorem proving, and formal verification.
75%VerifiedLean is both a programming language and an interactive theorem prover, in which users write mathematical propositions in a formal language and have them verified step by step by the machine.
75%VerifiedTheorem provers such as Lean, Coq, and Isabelle require every reasoning step to be translated into strict logical notation and automatically checked for compliance.
75%VerifiedTest cases provide AI with a machine-verifiable objective function, converting vague natural language requirements into precise pass/fail signals.
75%VerifiedFormal verification is a technique that uses mathematical methods to rigorously prove that system behavior conforms to a predetermined specification, attempting to prove the absence of errors, whereas testing can only detect the presence of errors.
70%VerifiedInteractive theorem provers such as Lean, Coq, and Isabelle allow proof steps to be encoded in machine-verifiable formal languages
70%VerifiedCompCert is a fully formally verified C compiler developed by France's INRIA, which used the Coq proof assistant to prove the semantic preservation of the compilation process.
70%VerifiedMechanized verification refers to the use of formal proof assistants such as Lean, Coq, and Isabelle to convert mathematical proofs into a formal language that can be automatically checked by a computer.
65%VerifiedIn theorem proving, AI primarily serves as a proof assistant recommending the next tactic step, or as an automated prover searching for complete proof paths.
65%VerifiedLean and Coq are interactive theorem provers (ITPs) that require users to translate mathematical proofs into machine-verifiable formal languages, where every step of reasoning must conform to strict type-theoretic rules.
65%VerifiedFormal proof verification systems such as Lean, Coq, and Isabelle can convert mathematical proofs into formal languages that are machine-checkable
65%VerifiedThe Lean formal proof assistant operates on the basis of type theory and the Curry–Howard correspondence, and every proof step must be verified by the kernel's type checker
65%VerifiedCoq originated from France's INRIA, is based on the Calculus of Inductive Constructions, and has been used to verify the proof of the Four Color Theorem
65%VerifiedCoq has been used to verify industrial safety-critical software such as the CompCert C compiler.
65%VerifiedCoq系统在2005年被Gonthier团队用于形式化验证四色定理
65%VerifiedFormal proof systems (such as Lean, Coq, and Isabelle) require proofs to be written as code that can be verified step by step by a computer, where any logical leap triggers a compilation error.
65%UnverifiedThe field of formal verification is exploring integration with LLMs, having AI generate code while simultaneously generating formal specifications, which are then verified by theorem provers such as Coq, Lean, and Isabelle
60%