On Thu, May 14, 2009 at 2:10 PM, gary ng <[email protected]> wrote: > J has loop construct and is not pure so not having TCO is not much an issue > as there are alternatives. For a functional language that is pure like > Haskell, no TCO may make certain algorithm very difficult to implement if > not impossible. ... > So if by 'serious' you mean coding in 'pure' style(i.e. no fallback to > loop), I am curious to know how can one implement algorithms that needs > recursion in J.
For example: 1 2 3 + 4 5 6 7 -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
