(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.

(computing theory) Recursion to a fixed depth. / (computing theory) The operator 𝜌, that creates a new function from two functions g, and h, such that:

plural of infinite recursion

The case in which a string (in a language) may be decomposed to another string and a suffix

plural of crock recursion

(computing) The condition in which a program or document either directly or indirectly requests that it include itself, without protection against an endless sequence of continued requests to include itself.

plural of tail recursion