On Wed, May 13, 2009 at 10:39 PM, Zsbán Ambrus <[email protected]> wrote:
> IMO as I write most of the loops with the lots of looping builtins > like rank, insert, and power etc, I rarely use recursion, so it does > not really matter if the interpreter does tail recursion or not. > Whether the language implement TCO does have an impact on the tendency to use recursion or not(for the fear of stack overflow). That said, I found Haskell's lazy evaluation having a greater benefit for writing recursive style function. As writing 'TCOtable' function is not that simple. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
