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% similarPartially VerifiedLean is an interactive theorem prover developed by Leonardo de Moura at Microsoft Research, based on dependent type theory.77% similarUnverifiedThe 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% similarVerifiedTheorem provers such as Lean, Coq, and Isabelle require every reasoning step to be translated into strict logical notation and automatically checked for compliance.66% similarVerifiedInteractive theorem provers such as Lean, Coq, and Isabelle allow proof steps to be encoded in machine-verifiable formal languages65% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/526071API
curl https://kongchang.com/api/v1/knowledge/claims/526071MCP
get_claim(id=526071)