News for hackers. Stuff that matters.
Re:Curry-Howard, the Ontological Ultimate by cousin_it on Wednesday October 15, 2014 @03:42PM (#8461194)
I think that's missing an implementation of the function that matches the type. Is that also easy?
Re:Curry-Howard, the Ontological Ultimate by vilhelm_s on Wednesday October 15, 2014 @09:25PM (#8462802)
That's not so easy. That's the point, right? It's easier to write a specification than an implementation, so it's valuable to check that the implementation satisfies the spec.
Re:Curry-Howard, the Ontological Ultimate by eli_gottlieb on Thursday October 16, 2014 @03:22AM (#8463779)
Well if I wasn't so lazy, it would be easy to implement a Sieve of Eratosthenes algorithm yielding a list of primes up to some number, and then another function feeding 1000000 to that function and returning the length of the resulting list. The hard part would be actually proving the theorem I stated in terms of those two functions.