Curry-Howard同构
数学逻辑与计算机程序之间的深刻对应关系，揭示命题对应类型、证明对应程序、证明化简对应程序执行，是现代依赖类型语言和形式化验证系统的理论基石
Timeline (last 90 days)
The core principle of interactive theorem provers is built on the Curry–Howard correspondence, whereby propositions correspond to types and proofs correspond to programs that satisfy those types.
The Curry-Howard correspondence refers to the deep relationship between mathematical proofs and computer programs: a proposition corresponds to a type, and a proof corresponds to a program that satisfies that type.
All Facts (3)
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
60%UnverifiedThe core principle of interactive theorem provers is built on the Curry–Howard correspondence, whereby propositions correspond to types and proofs correspond to programs that satisfy those types.
50%UnverifiedThe Curry-Howard correspondence refers to the deep relationship between mathematical proofs and computer programs: a proposition corresponds to a type, and a proof corresponds to a program that satisfies that type.
50%