Branimir Maksimovic wrote:
I've found that Haskell is pretty good in implementing recursive
algorithms.
Problem cames when one want's to implement non recursive algorithm
by terms of recursion as Haskell does not support loops.
Perhaps if we can get loops, situation will improve, but then that
wouldn't be functional style.
Could you give an example of a loop you find awkward in Haskell?
I've often found that you can just define a control construct
in Haskell when needed (e.g., some kind of loop).
-- Lennart
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe
