On Mon, 6 Mar 2006, Jonathan Harrop wrote:

> >How do I jump out of a recursive algorithm and be able to 
> >continue it at the same point?
> 
> If you're doing purely functional programming then you'll be passing the state as an argument to the 
> recursive function.

How do you restore the call stack?

-- 
regards,               tf@cip.physik.uni-muenchen.de              (o_
 Thomas Fischbacher -  http://www.cip.physik.uni-muenchen.de/~tf  //\
(lambda (n) ((lambda (p q r) (p p q r)) (lambda (g x y)           V_/_
(if (= x 0) y (g g (- x 1) (* x y)))) n 1))                  (Debian GNU)