VDict - Definition of tail recursion

Computing (FOLDOC) dictionary

tail recursion

programming When the last thing a function (or procedure)

does is to call itself. Such a function is called tail

recursive. A function may make several recursive calls but a

call is only tail-recursive if the caller returns immediately

after it. E.g.

f n = if n #@ 2 then 1 else f (f (n-2) + 1)

Here the both calls to fib are recursive but only the outer

one is tail recursive.

See tail recursion optimisation, and, if you aren't sick of

(1996-02-22)

Related search result for "tail recursion"

Words contain "tail recursion":
tail recursion tail recursion modulo cons tail recursion optimisation
Words contain "tail recursion" in its definition in Computing (FOLDOC) dictionary:
tail recursion tail recursion optimisation conversion to iteration tail recursion modulo cons recursion TRO mutual recursion Id Nouveau last call optimisation tail-strict more...