On Wed, Feb 18, 2009 at 10:50 AM, Lennart Augustsson <[email protected]> wrote: > I just want to make one thing clear. With a type that just contains > prime numbers the onus is on you (the programmer) to provide the proof > that a number is a prime number whenever you claim it is. So you have > to make the proof, and the compiler merely checks that your proof is > correct. > There is no free lunch.
That's the point I was aiming at. Cristiano _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
