3 ms·
I think that's missing an implementation of the function that matches the type. Is that also easy?
by cousin_it 12y ago
I think that's missing an implementation of the function that matches the type. Is that also easy?
- vilhelm_s 12y agoThat'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.
- eli_gottlieb 12y agoWell 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.