In computer science, a tail call is a subroutine call performed as the final action of a procedure. If the target of a tail is the same subroutine, the...

as calls to a continuation; intermediate values, which are all given names; order of argument evaluation, which is made explicit; and tail calls, which...

significance of tail recursion is that when making a tail-recursive call (or any tail call), the caller's return position need not be saved on the call stack;...

the tail call optimizations discussed by Steele turned the procedure into a credible way of implementing iteration through single tail recursion (tail recursion...

implement tail-call optimization, allowing infinite recursion of a specific sort—tail recursion—to occur without stack overflow. This works because tail-recursion...

The tail is the section at the rear end of certain kinds of animals' bodies; in general, the term refers to a distinct, flexible appendage to the torso...

Scheme was the first dialect of lisp to use lexical scoping and to require tail-call optimization, features that encourage functional programming. In the 1980s...

provide tail call optimization to allow for extensive use of recursion without stack overflow problems. Limitations in Java bytecode complicate tail call optimization...

choose lexical scope and the first to require implementations to perform tail-call optimization, giving stronger support for functional programming and associated...

does not require the optimization commonly termed a tail call elimination. Thus, the fact that tail recursive style as a casual replacement for the use...