Strict<->Lazy?

[Siegfried Gonzi]

> So I suggest that you either study those and compare them with your
> own algorithm, or put your algorithm on this discussion list.

In the Clean Language Report (Chapter 5) there  someone can read that
the Ackermann function (14sec on a old Mac) can be speed up by a factor
of 10 (1.5sec on that old Mac with strict evaluation) if the variables
are declared strict.
 
I thougt this is also true for the fibonacci numbers.


Greetings,
Siegfried Gonzi