Re:On Two Views of Computation in Computer Science
by Ericson2314 on Wednesday September 07, 2016 @05:12PM
(#12447745)
I am curious what you think of math.andrej.com/2016/08/30/formal-proofs-are-not-just-deduction-steps/
[ Parent
| on HN ]
Re:On Two Views of Computation in Computer Science
by pron on Friday September 09, 2016 @12:16AM
(#12459594)
He mostly talks about proof assistants for general mathematical theorems, something I don't use, but in TLA+, proofs are of logical formulas, the steps are logical formulas (unlike in dependently typed provers), and a computation is just a (temporal) logical formula, so TLA+ already lets you incorporate computations into proofs, but the process isn't automatic. Then again, TLA+ isn't really designed nor used as a general theorem prover (though it certainly can prove general mathematical theorems) but as a tool to specify and verify algorithms.