Unverified50% confidenceFactExact time
Coq and Lean are theorem-proving languages, while Dafny and F* are languages that support specification annotations, where developers declare preconditions and postconditions that are automatically checked by a verifier.
1
Sources
50%
Confidence
Long-term
Relevance
9/27/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedFormal proof verification systems such as Lean, Coq, and Isabelle can convert mathematical proofs into formal languages that are machine-checkable72% similarUnverifiedSemantic verifiers focus on whether the output meets requirements at the semantic level, rather than just exact string matching.67% similarUnverifiedDSL的语法可用BNF（巴科斯-诺尔范式）或其扩展形式EBNF来形式化描述，并据此自动生成解析器进行确定性语法验证67% similarUnverified微软的Dafny语言用于形式化验证代码正确性65% similarUnverified程序化语义将语言映射为可执行的过程（操作序列），而声明式语义将语言映射为逻辑断言或知识图谱三元组63% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/952912API
curl https://kongchang.com/api/v1/knowledge/claims/952912MCP
get_claim(id=952912)