[Haskell-cafe] How to incrementally update list

[Branimir Maksimovic]

Problem is following short program:list = [1,2,3,4,5]
advance l = map (\x -> x+1) l
run 0 s = srun n s = run (n-1) $ advance s
main = do        let s =  run 50000000 list        putStrLn $ show s
I want to incrementally update list lot of times, but don't knowhow to do this.Since Haskell does not have loops I have to use recursion,but problem is that recursive calls keep previous/state parameterleading to excessive stack.and memory usage.I don't know how to tell Haskell not to keep previousstate rather to release so memory consumption becomesmanagable.
Is there some solution to this problem as I think it is rathercommon?
 		 	   		  
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20121128/74797023/attachment.htm>