• 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

1. More about this term (beta): Web search, articles and videos, books
2. Previous term: Tagging
3. Next term: Tail call elimination
4. Random term: Data pump