logoalt Hacker News

bananaflag • yesterday at 11:36 AM • 4 replies • view on HN

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.


Replies

Sharlin • yesterday at 12:53 PM

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.

➕ show 1 reply
lordnacho • yesterday at 12:34 PM

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

➕ show 1 reply
fweimer • yesterday at 4:05 PM

That's like saying that all memory-safety programs are written in Rust.

There is no fundamental reason why mathematics should be formalized using concepts that are alien to most mathematicians, in the way that type theory is.

(I guess Isabelle/HOL is the Java of formalized mathematics, in the sense that for reasons that are difficult to understand, memory safety of Java-implemented technology does not count.)

➕ show 1 reply