[Haskell-cafe] Binary constants in Haskell

[Stefan O'Rear]

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
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 189 bytes
Desc: Digital signature
Url : http://www.haskell.org/pipermail/haskell-cafe/attachments/20071025/1d608a04/attachment.bin