- A subroutine call performed as the final action of a procedure. If the target of a tail is the same subroutine, the subroutine is said to be tail-recursive, which is a special case of direct recursion. Tail recursion (or tail-end recursion) is particularly useful, and is often easy to optimize in implementations. A tail call can be located just before the syntactical end of a function, as in
function foo(data). ← Wikipedia
- Related terms: Tail call optimization, Double-ended queue, Recursion, Routine
- Previous term: Tagging
- Next term: Tail call elimination
- Random term: ATAG (webglossary.info/random 🎲)