Remix.run Logo
▲ bananaflag an hour ago

No, because proofs are programs and theorems are types. It is enough to construct a function of the needed type to have a proof of the needed theorem. You don't need to look through all the code to see that the function has the desired type.

▲Sharlin 8 minutes ago | parent | next [-]

You have to be sure that the formalized theorem matches the informally stated theorem. Which is what GP meant and what the article is about. A program does what is written, not what is meant; a Lean program proves what is written, not what is meant.

▲lordnacho 27 minutes ago | parent | prev [-]

This sounds interesting enough that I think a link would be useful

▲RossBencina 19 minutes ago | parent [-]

Here you go: https://en.wikipedia.org/wiki/Curry%E2%80%93Howard_correspon...