Hacker Newsnew | past | comments | ask | show | jobs | submitlogin
A proof of Löb's theorem in Haskell (lesswrong.com)
49 points by cubetime on Sept 20, 2014 | hide | past | favorite | 2 comments


Interesting to see you can jam something like this into Haskell despite its inappropriateness. The (genuine) Agda proofs are much, much nicer.


Agreed :-)

One of the big questions to me now is whether we can prove the Diagonal Lemma, not just assume it. Do you know if it's possible in Agda? I heard somewhere that it might be hard to find an intuitionistic proof.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: