Re:Russell's paradox and the Y combinator
by curryhoward on Tuesday June 02, 2015 @10:41PM
(#9650263)
Correct. One way to think of it is that running the program produces a proof of the theorem. But since the program is guaranteed to terminate with a proof (since all functions are total in Coq), why run it at all? Type checking is sufficient.
[ Parent
| on HN ]
There are no comments on this comment yet.