Verified90% confidenceFactExact time
Lean is based on dependent type theory and expresses proofs and programs in a unified manner.
7
Sources
90%
Confidence
Long-term
Relevance
7/16/2026
First Seen
Sources
Related Claims
VerifiedLean requires that every step of derivation be written in a strict type-theoretic language, with logical completeness automatically verified by a computational kernel.78% similarVerifiedLean is an interactive theorem prover that requires every step of a proof to hold within a strict formal logic framework.78% similarVerifiedLean is an interactive theorem prover developed by Leonardo de Moura at Microsoft Research, based on dependent type theory.77% similarVerifiedThe 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 checker75% similarUnverifiedA proof in Lean is essentially a piece of compilable code; successful compilation means the proof is correct, while a compilation failure indicates a logical flaw.69% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/526071API
curl https://kongchang.com/api/v1/knowledge/claims/526071MCP
get_claim(id=526071)