tail recursion optimisation

(programming)(TRO) Discarding the calling environment (call stack frame) when the last thing a function or proceduredoes is to call itself. This is important when a procedurecalls itself recursively many times since, without tailrecursion optimisation, the environments of earlierinvocations would fill up the memory only to be discarded when(if) the last call terminated.

Tail recursion optimisation is a special case of last call optimisation but it allows the further optimisation that somearguments may be passed in situ, possibly in registers. Itallows recursive functions to be compiled into iterativeloops.

See also conversion to iteration, tail recursion modulo cons.

单词	tail recursion optimisation
释义	tail recursion optimisation tail recursion optimisation (programming)(TRO) Discarding the calling environment (call stack frame) when the last thing a function or proceduredoes is to call itself. This is important when a procedurecalls itself recursively many times since, without tailrecursion optimisation, the environments of earlierinvocations would fill up the memory only to be discarded when(if) the last call terminated. Tail recursion optimisation is a special case of last call optimisation but it allows the further optimisation that somearguments may be passed in situ, possibly in registers. Itallows recursive functions to be compiled into iterativeloops. See also conversion to iteration, tail recursion modulo cons.
随便看	buy (something) on credit buy (something) on tick buy something on tick buy (something) on time buy (something) sight unseen buy some time buys on credit buys on margin buys on tick buys on time buys out buysse, cyriel buyssens, eric buys sight unseen buys the big one buys the book buys the farm buys the index buys the rabbit buys the round buys the round of drinks buys the spread buys time buy stop buy stop order