On Sat, May 4, 2013 at 8:25 AM, elton wang <[email protected]> wrote: > This is not tail recursion, so can get stack-overflow. BTW, does J has tail > recursion optimization?
J's induction operator (^:) achieves "inductive semantics without stack overflow", so no one has bothered implementing tail recursion (either as an operator or as a parse time operation on all verbs). -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
