What are the most interesting equivalences arising from the Curry-Howard Isomorphism?
I came upon the Curry-Howard Isomorphism relatively late in my programming life, and perhaps this contributes to my being utterly fascinated by it. It implies that for every programming concept there exists a precise analogue in formal logic, and vice versa. Here's a "basic" list of such analogies, off the top of my head: program/definition | proof type/declaration | proposition inhabited type | t
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Why can't Coq figure out symmetry of the equality by itself?
What will be the number of reachable states if Petri-Net model states are in loop
formal methods - Tool-supported to check module in SOFL - Stack Overflow
Where does the KeY verification tool shine?
Axiomatic Semantics - How to calculate a weakest precondition
Zed specification: Promotion and applying an operation more than one schema
how to resolve max search depth too small in SPIN model checker? What can be the possible reasons?
Formal method : []<> Infinitely often (Always eventually) in TLA
Hoare Triples - Weakest Precondition / Strongest Postcondition
Can Haskell functions be proved/model-checked/verified with correctness properties?
What are the strengths and weaknesses of the Isabelle proof assistant compared to Coq?
Using forall within recursive Function definition
