Strict<->Lazy?

[Zuurbier, E. - AMSXE]

Siegfried, you wrote:

> Yesterday I wrote a little program for calculating the fibonacci
> numbers.
[snip]
> And then I was shocked, because Clean requires 30sec!
> 
There are various versions of Fibonacci algorithms around.
The demo's that come with Clean carry a number of them.
Some are meant to show the basic idea. Others are meant
to show what a speed-up can do, by introducing accumulators.
So I suggest that you either study those and compare them with your
own algorithm, or put your algorithm on this discussion list.

Regards Erik Zuurbier