Re:" and the proof is checked in Lean"
by bananaflag on Monday November 16, 2026 @06:36AM
(#50516441)
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.
[ Parent
| on HN ]
Re:" and the proof is checked in Lean"
by lordnacho on Monday November 16, 2026 @07:34AM
(#50516935)
This sounds interesting enough that I think a link would be useful
Re:" and the proof is checked in Lean"
by RossBencina on Monday November 16, 2026 @07:42AM
(#50517002)
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.
Re:" and the proof is checked in Lean"
by bananaflag on Monday November 16, 2026 @08:17AM
(#50517313)
I agree with that. I never said you don't have to check the statement.
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.)
Re:" and the proof is checked in Lean"
by bananaflag on Monday November 16, 2026 @12:55PM
(#50520573)
Re:" and the proof is checked in Lean"
by mentalgear on Monday November 16, 2026 @12:33PM
(#50520254)
That's basically what Typescript also gives you, and it isn't bug free either.
You can proof a logic, but it does not proof that it is the logic that would keep the program secure and bug-free, only that it is internally consistent. So it helps, but by no means a silver bullet !