ML 9 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. Thanks, Eliot -- Eliot Kimber http://contrext.com _______________________________________________ General mailing list [email protected] Manage your subscription at: http://developer.marklogic.com/mailman/listinfo/general
