[Haskell-cafe] Binary constants in Haskell
lemming at henning-thielemann.de
Thu Oct 25 16:02:37 EDT 2007
On Thu, 25 Oct 2007, Stefan O'Rear wrote:
> 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?
The compiled program should run fast nevertheless ...
More information about the Haskell-Cafe