On 11/11/17, 6:24 PM, "gene...@developer.marklogic.com on behalf
of Eliot Kimber" <gene...@developer.marklogic.com on behalf of
I¹m using recursive functions to process an arbitrarily large set of
items where in a procedural language I would use a while true() loop. The
number of items can be large so tail recursion optimization has to be in
place or I¹ll eventually blow the call stack.
My question: How do I ensure that my functions are constructed so that
tail recursion optimization will be applied?
A search on ³recursion² or ³tail recursion² didn¹t reveal anything on the
ML docs site.