On Thu, Oct 25, 2007 at 09:41:27PM +0200, Henning Thielemann wrote: > > Total functions, full laziness, and compile time evaluation of finite > > non-bottom CAFs... > > If I write a program that approximates a big but fixed number of digits of > Pi - how can we prevent the compiler from computing Pi, and generating a > program which contains just the digits of Pi as constant data?
-O0 Stefan
signature.asc
Description: Digital signature
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
