From: Henning Thielemann <[EMAIL PROTECTED]>
On Wed, 15 Jun 2005, Rene de Visser wrote:
You can put temporary values into a data structure.
E.g. if you have an iteration don't write a recursion with a fixed abort
criterion but write a function which maps the old value to the new one,
then apply 'iterate' on it. Now you can inspect the temporary values and
you can later apply a function which decides when to stop the iteration.
Designing the data structures to store the calculation results seems to be
non-trivial,
so I guess I should do this first. Then maybe the solution to the other
problem will be apparent.
Rene.
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
