Unverified60% confidenceFactExact time
The Curry–Howard correspondence reveals the structural correspondence in which propositions correspond to types, proofs correspond to programs, and proof normalization corresponds to program execution, and was gradually discovered between 1934 and 1969
2
Sources
60%
Confidence
Long-term
Relevance
7/15/2026
First Seen
Sources
Related Claims
Unverified1969年Manna和Waldinger提出了基于形式化规范和定理证明的演绎合成方法73% similarUnverifiedIn Lean, types and propositions, programs and proofs are isomorphic at the system level; this idea is called the Curry-Howard correspondence.68% similarUnverifiedIn 1931, Gödel proved that formal mathematical systems can encode propositions about themselves and their own provability.68% similarVerifiedThe history of automated theorem proving dates back to 1956, when Logic Theorist, developed by Allen Newell and Herbert Simon, is considered the first automated reasoning program.66% similarUnverified恩德尔·图尔文在1972年提出编码特异性原则，即记忆提取效率取决于提取时与编码时情境线索的匹配程度66% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/523975API
curl https://kongchang.com/api/v1/knowledge/claims/523975MCP
get_claim(id=523975)