(programming) | tail recursion - 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 them already, recursion, tail recursion. |

Browse

tail bone

tail circuit

tail coat

Tail coverts

tail end

tail feather

tail fin

tail gate

tail gunner

Tail joist

tail lamp

Tail of a comet

Tail of a gale

Tail of a lock

Tail of the trenches

Tail on

**-- tail recursion --**

tail recursion modulo cons

tail recursion optimisation

tail rotor

Tail spindle

Tail stock

Tail-bay

tail-flower

tail-strict

Tail-water

Tailage

tailback

Tailblock

Tailboard

tailcoat

Tailed

tailed frog

tail circuit

tail coat

Tail coverts

tail end

tail feather

tail fin

tail gate

tail gunner

Tail joist

tail lamp

Tail of a comet

Tail of a gale

Tail of a lock

Tail of the trenches

Tail on

tail recursion modulo cons

tail recursion optimisation

tail rotor

Tail spindle

Tail stock

Tail-bay

tail-flower

tail-strict

Tail-water

Tailage

tailback

Tailblock

Tailboard

tailcoat

Tailed

tailed frog