Jose Mario Quintana wrote: > > [...], there is a way to write fully fixable recursive code in J; see > http://rosettacode.org/wiki/Y_combinator#J . > The method implies heavy overhead and it is typically relatively > slow;[...] > Not typically but intrinsically slow because interpreter first has to tokenize expressions before it can parse them every time apply is applied. Furthermore:
> [...]but adverbial programming [...] is not about efficiency > I disagree: the use of tacit adverbs, in contradistinction to the use of apply, can make code run faster. -- View this message in context: http://www.nabble.com/Recursive-nesting%2C-avoiding-recursion-tp25122502s24193p25127150.html Sent from the J Programming mailing list archive at Nabble.com. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
