I should add: the tail-recursion-like idiom is F^:test^:_ arg

Thanks,

-- 
Raul


On Tuesday, December 19, 2017, Raul Miller <[email protected]> wrote:

> J's induction operation ( ^: ) is very similar to tail recursion (in terms
> of data flow) except that it does not have full recursion as one of its
> failure modes.
>
> --
> Raul
>
> On Tuesday, December 19, 2017, Dabrowski, Andrew John <
> [email protected]> wrote:
>
>> Is J a good language for using recursion?  In particular does it do tail
>> recursion optimization?
>> ----------------------------------------------------------------------
>> For information about J forums see http://www.jsoftware.com/forums.htm
>
>
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm

Reply via email to