Noun
tail recursion (countable and uncountable, plural tail recursions)
(programming) The technique of writing a function so that recursive calls are only done immediately before function return, particularly when recursive control structures are used in place of iterative ones.