Wsrtjtyk

In computer science, a tail call is a subroutine call performed as the final action of a procedure. If a tail call might lead to the same subroutine being called again later in the call chain, the subroutine is said to be tail-recursive, which is a special case of recursion. Tail recursion (or tail-end recursion) is particularly useful, and often easy to handle in implementations.

Tail calls can be implemented without adding a new stack frame to the call stack. Most of the frame of the current procedure is no longer needed, and can be replaced by the frame of the tail call, modified as appropriate (similar to overlay for processes, but for function calls). The program can then jump to the called subroutine. Producing such code instead of a standard call sequence is called tail call elimination. Tail call elimination allows procedure calls in tail position to be implemented as efficiently as goto statements, thus allowing efficient structured programming. In the words of Guy L. Steele, "in general, procedure calls may be usefully thought of as GOTO statements which also pass parameters, and can be uniformly coded as [machine code] JUMP instructions."^[1]

Not all programming languages require tail call elimination. However, in functional programming languages, tail call elimination is often guaranteed by the language standard, allowing tail recursion to use a similar amount of memory as an equivalent loop. The special case of tail recursive calls, when a function calls itself, may be more amenable to call elimination than general tail calls. When the language semantics do not explicitly support general tail calls, a compiler can often still optimize sibling calls, or tail calls to functions which take and return the same types as the caller.^[2]

Description

When a function is called, the computer must "remember" the place it was called from, the return address, so that it can return to that location with the result once the call is complete. Typically, this information is saved on the call stack, a simple list of return locations in order of the times that the call locations they describe were reached. For tail calls, there is no need to remember the caller – instead, tail call elimination leaves the stack alone (except possibly for function arguments and local variables,^[3]) and the newly-called function will return directly to the original caller. The tail call doesn't have to appear lexically after all other statements in the source code; it is only important that the calling function return immediately after the tail call, returning the tail call's result if any, since the calling function will never get a chance to do anything after the call if the optimization is performed.

For non-recursive function calls, this is usually an optimization that saves only a little time and space, since there are not that many different functions available to call. When dealing with recursive or mutually recursive functions where recursion happens through tail calls, however, the stack space and the number of returns saved can grow to be very significant, since a function can call itself, directly or indirectly, creating a new call stack frame each time. Tail call elimination often asymptotically reduces stack space requirements from linear, or O(n), to constant, or O(1). Tail call elimination is thus required by the standard definitions of some programming languages, such as Scheme,^[4][5] and languages in the ML family among others. The Scheme language definition formalizes the intuitive notion of tail position exactly, by specifying which syntactic forms allow having results in tail context.^[6] Implementations allowing an unlimited number of tail calls to be active at the same moment, thanks to tail call elimination, can also be called 'properly tail-recursive'.^[4]

Besides space and execution efficiency, tail call elimination is important in the functional programming idiom known as continuation-passing style (CPS), which would otherwise quickly run out of stack space.

Syntactic form

A tail call can be located just before the syntactical end of a subroutine:

function foo(data) {

    a(data);

    return b(data);

}

Here, both a(data) and b(data) are calls, but b is the last thing the procedure executes before returning and is thus in tail position. However, not all tail calls are necessarily located at the syntactical end of a subroutine:

function bar(data) {

    if ( a(data) ) {

        return b(data);

    }

    return c(data);

}

Here, both calls to b and c are in tail position. This is because each of them lies in the end of if-branch respectively, even though the first one is not syntactically at the end of bar's body.

In this code:

function foo1(data) {

    return a(data) + 1;

}

function foo2(data) {

    var ret = a(data);

    return ret;

}

function foo3(data) {

    var ret = a(data);

    return (ret == 0) ? 1 : ret;

}

the call to a(data) is in tail position in foo2, but it is not in tail position either in foo1 or in foo3, because control must return to the caller to allow it to inspect or modify the return value before returning it.

Example programs

The following program is an example in Scheme:^[7]

;; factorial : number -> number

;; to calculate the product of all positive

;; integers less than or equal to n.

(define (factorial n)

 (if (= n 1)

    1

    (* n (factorial (- n 1)))))

This is not written in a tail recursion style, because the multiplication function ("*") is in the tail position. This can be compared to:

;; factorial : number -> number

;; to calculate the product of all positive

;; integers less than or equal to n.

(define (factorial n)

  (fact-iter 1 n))

(define (fact-iter product n)

  (if (< n 2)

      product

      (fact-iter (* product n)

                 (- n 1))))

This program assumes applicative-order evaluation. The inner procedure fact-iter calls itself last in the control flow. This allows an interpreter or compiler to reorganize the execution which would ordinarily look like this:^[7]

  call factorial (4)

   call fact-iter (1 4)

    call fact-iter (4 3)

     call fact-iter (12 2)

      call fact-iter (24 1)

      return 24

     return 24

    return 24

   return 24

  return 24

into the more efficient variant, in terms of both space and time:

  call factorial (4)

   call fact-iter (1 4)

   replace arguments with (4 3)

   replace arguments with (12 2)

   replace arguments with (24 1)

   return 24

  return 24

This reorganization saves space because no state except for the calling function's address needs to be saved, either on the stack or on the heap, and the call stack frame for fact-iter is reused for the intermediate results storage. This also means that the programmer need not worry about running out of stack or heap space for extremely deep recursions. In typical implementations, the tail recursive variant will be substantially faster than the other variant, but only by a constant factor.

Some programmers working in functional languages will rewrite recursive code to be tail-recursive so they can take advantage of this feature. This often requires addition of an "accumulator" argument (product in the above example) to the function. In some cases (such as filtering lists) and in some languages, full tail recursion may require a function that was previously purely functional to be written such that it mutates references stored in other variables.^{[citation needed]}

Tail recursion modulo cons

Tail recursion modulo cons is a generalization of tail recursion optimization introduced by David H. D. Warren^[8] in the context of compilation of Prolog, seen as an explicitly set once language. It was described (though not named) by Daniel P. Friedman and David S. Wise in 1974^[9] as a LISP compilation technique. As the name suggests, it applies when the only operation left to perform after a recursive call is to prepend a known value in front of a list returned from it (or to perform a constant number of simple data-constructing operations, in general). This call would thus be a tail call save for ("modulo") the said cons operation. But prefixing a value at the start of a list on exit from a recursive call is the same as appending this value at the end of the growing list on entry into the recursive call, thus building the list as a side effect, as if in an implicit accumulator parameter. The following Prolog fragment illustrates the concept:

Prolog example

% tail recursive modulo cons:

partition(, _, , ).

partition([X|Xs], Pivot, [X|Rest], Bigs) :-

  X @< Pivot, !,

  partition(Xs, Pivot, Rest, Bigs).

partition([X|Xs], Pivot, Smalls, [X|Rest]) :-

  partition(Xs, Pivot, Smalls, Rest).

-- In Haskell, guarded recursion:

partition :: Ord a => [a] -> a -> ([a],[a])

partition  _ = (,)

partition (x:xs) p | x < p     = (x:a,b)

                   | otherwise = (a,x:b)

   where

      (a,b) = partition xs p

% With explicit unifications:

%     non-tail recursive translation:

partition(, _, , ).

partition(L, Pivot, Smalls, Bigs) :- L=[X|Xs],

 (  X @< Pivot

 -> partition(Xs,Pivot,Rest,Bigs), Smalls=[X|Rest]

 ;  partition(Xs,Pivot,Smalls,Rest), Bigs=[X|Rest]

 ).

% With explicit unifications:

%     tail recursive translation:

partition(, _, , ).

partition(L, Pivot, Smalls, Bigs) :- L=[X|Xs],

 (  X @< Pivot

 -> Smalls=[X|Rest], partition(Xs,Pivot,Rest,Bigs)

 ;  Bigs=[X|Rest], partition(Xs,Pivot,Smalls,Rest)

 ).

Thus in tail recursive translation such a call is transformed into first creating a new list node and setting its first field, and then making a tail call with the pointer to the node's rest field as argument, to be filled recursively.

C example

The following fragment defines a recursive function in C that duplicates a linked list:

struct list {void *value;struct list *next;};

typedef struct list list;



list *duplicate(const list *ls)

{

    list *head = NULL;



    if (ls != NULL) {

        list *p = duplicate(ls->next);

        head = malloc(sizeof *head);

        head->value = ls->value;

        head->next = p;

    }

    return head;

}

;; in Scheme,

(define (duplicate ls)

  (if (not (null? ls))

    (cons (car ls)

          (duplicate (cdr ls)))

    '()))

%% in Prolog,

dup([X|Xs],R):- 

  dup(Xs,Ys),

  R=[X|Ys].

dup(,).

In this form the function is not tail-recursive, because control returns to the caller after the recursive call duplicates the rest of the input list. Even if it were to allocate the head node before duplicating the rest, it would still need to plug in the result of the recursive call into the next field after the call.^[a]
So the function is almost tail-recursive. Warren's method pushes the responsibility of filling the next field into the recursive call itself, which thus becomes tail call:

struct list {void *value;struct list *next;};

typedef struct list list;

void duplicate_aux(const list *ls, list *end);



list *duplicate(const list *ls)

{   

    list head;



    duplicate_aux(ls, &head);

    return head.next;

}



void duplicate_aux(const list *ls, list *end)

{

    if (ls != NULL) {

        end->next = malloc(sizeof *end);

        end->next->value = ls->value;

        duplicate_aux(ls->next, end->next);

    } else {

        end->next = NULL;

    }

}

;; in Scheme,

(define (duplicate ls)

  (let ((head (list 1)))

    (let dup ((ls  ls) 

              (end head))

      (cond 

        ((not (null? ls)) 

         (set-cdr! end (list (car ls)))

         (dup (cdr ls) (cdr end)))))

    (cdr head)))

%% in Prolog,

dup([X|Xs],R):-

   R=[X|Ys],

   dup(Xs,Ys).

dup(,).

(A sentinel head node is used to simplify the code.) The callee now appends to the end of the growing list, rather than have the caller prepend to the beginning of the returned list. The work is now done on the way forward from the list's start, before the recursive call which then proceeds further, instead of backward from the list's end, after the recursive call has returned its result. It is thus similar to the accumulating parameter technique, turning a recursive computation into an iterative one.

Characteristically for this technique, a parent frame is created on the execution call stack, which the tail-recursive callee can reuse as its own call frame if the tail-call optimization is present.

The tail-recursive implementation can now be converted into an explicitly iterative form, as an accumulating loop:

struct list {void *value;struct list *next;};

typedef struct list list;



list *duplicate(const list *ls)

{

    list head, *end;

    end = &head;

    while (ls != NULL)

    {

        end->next        = malloc(sizeof *end);

        end->next->value = ls->value;

        ls = ls->next;

        end = end->next;

    }

    end->next = NULL;

    return head.next;

}

 ;; in Scheme,

 (define (duplicate ls)

   (let ((head (list 1)))

     (do ((end head (cdr end))

          (ls  ls   (cdr ls )))

         ((null? ls) (cdr head))

       (set-cdr! end (list (car ls))))))

%% in Prolog,

%% N/A

History

In a paper delivered to the ACM conference in Seattle in 1977, Guy L. Steele summarized the debate over the GOTO and structured programming, and observed that procedure calls in the tail position of a procedure can be best treated as a direct transfer of control to the called procedure, typically eliminating unnecessary stack manipulation operations.^[1] Since such "tail calls" are very common in Lisp, a language where procedure calls are ubiquitous, this form of optimization considerably reduces the cost of a procedure call compared to other implementations. Steele argued that poorly implemented procedure calls had led to an artificial perception that the GOTO was cheap compared to the procedure call. Steele further argued that "in general procedure calls may be usefully thought of as GOTO statements which also pass parameters, and can be uniformly coded as [machine code] JUMP instructions", with the machine code stack manipulation instructions "considered an optimization (rather than vice versa!)".^[1] Steele cited evidence that well optimized numerical algorithms in Lisp could execute faster than code produced by then-available commercial Fortran compilers because the cost of a procedure call in Lisp was much lower. In Scheme, a Lisp dialect developed by Steele with Gerald Jay Sussman, tail call elimination is guaranteed to be implemented in any interpreter.^[10]

Implementation methods

Tail recursion is important to some high-level languages, especially functional and logic languages and members of the Lisp family. In these languages, tail recursion is the most commonly used way (and sometimes the only way available) of implementing iteration. The language specification of Scheme requires that tail calls are to be optimized so as not to grow the stack. Tail calls can be made explicitly in Perl, with a variant of the "goto" statement that takes a function name: goto &NAME;^[11]

However, for language implementations which store function arguments and local variables on a call stack (which is the default implementation for many languages, at least on systems with a hardware stack, such as the x86), implementing generalized tail call optimization presents an issue: if the size of the callee's activation record is different from that of the caller, then additional cleanup or resizing of the stack frame may be required. For these cases, optimizing tail recursion remains trivial, but general tail call optimization may be harder to implement efficiently.

For example, in the Java virtual machine (JVM), tail-recursive calls can be eliminated (as this reuses the existing call stack), but general tail calls cannot be (as this changes the call stack).^[12][13] As a result, functional languages such as Scala that target the JVM can efficiently implement direct tail recursion, but not mutual tail recursion.

The GCC, LLVM/Clang, and Intel compiler suites perform tail call optimization for C and other languages at higher optimization levels or when the -foptimize-sibling-calls option is passed.^[14][15][16] Though the given language syntax may not explicitly support it, the compiler can make this optimization whenever it can determine that the return types for the caller and callee are equivalent, and that the argument types passed to both function are either the same, or require the same amount of total storage space on the call stack.^[17]

Various implementation methods are available.

In assembly

Tail calls are often optimized by interpreters and compilers of functional programming and logic programming languages to more efficient forms of iteration. For example, Scheme programmers commonly express while loops as calls to procedures in tail position and rely on the Scheme compiler or interpreter to substitute the tail calls with more efficient jump instructions.^[18]

For compilers generating assembly directly, tail call elimination is easy: it suffices to replace a call opcode with a jump one, after fixing parameters on the stack.
From a compiler's perspective, the first example above is initially translated into pseudo-assembly language (in fact, this is valid x86 assembly):

 foo:

  call B

  call A

  ret

Tail call elimination replaces the last two lines with a single jump instruction:

 foo:

  call B

  jmp  A

After subroutine A completes, it will then return directly to the return address of foo, omitting the unnecessary ret statement.

Typically, the subroutines being called need to be supplied with parameters. The generated code thus needs to make sure that the call frame for A is properly set up before jumping to the tail-called subroutine. For instance, on platforms where the call stack does not just contain the return address, but also the parameters for the subroutine, the compiler may need to emit instructions to adjust the call stack. On such a platform, for the code:

function foo(data1, data2)

   B(data1)

   return A(data2)

(where data1 and data2 are parameters) a compiler might translate that as:^[b]

 1  foo:

 2    mov  reg,[sp+data1] ; fetch data1 from stack (sp) parameter into a scratch register.

 3    push reg            ; put data1 on stack where B expects it

 4    call B              ; B uses data1

 5    pop                 ; remove data1 from stack

 6    mov  reg,[sp+data2] ; fetch data2 from stack (sp) parameter into a scratch register.

 7    push reg            ; put data2 on stack where A expects it

 8    call A              ; A uses data2

 9    pop                 ; remove data2 from stack.

10    ret

A tail call optimizer could then change the code to:

1  foo:

2    mov  reg,[sp+data1] ; fetch data1 from stack (sp) parameter into a scratch register.

3    push reg            ; put data1 on stack where B expects it

4    call B              ; B uses data1

5    pop                 ; remove data1 from stack

6    mov  reg,[sp+data2] ; fetch data2 from stack (sp) parameter into a scratch register.

7    mov  [sp+data1],reg ; put data2 where A expects it

8    jmp  A              ; A uses data2 and returns immediately to caller.

This code is more efficient both in terms of execution speed and use of stack space.

Through trampolining

Since many Scheme compilers use C as an intermediate target code, the tail recursion must be encoded in C without growing the stack, even if the C compiler does not optimize tail calls. Many implementations achieve this by using a device known as a trampoline, a piece of code that repeatedly calls functions. All functions are entered via the trampoline. When a function has to tail-call another, instead of calling it directly and then returning the result, it returns the address of the function to be called and the call parameters back to the trampoline (from which it was called itself), and the trampoline takes care of calling this function next with the specified parameters. This ensures that the C stack does not grow and iteration can continue indefinitely.

It is possible to implement trampolines using higher-order functions in languages that support them, such as Groovy, Visual Basic .NET and C#.^[19]

Using a trampoline for all function calls is rather more expensive than the normal C function call, so at least one Scheme compiler, Chicken, uses a technique first described by Henry Baker from an unpublished suggestion by Andrew Appel,^[20] in which normal C calls are used but the stack size is checked before every call. When the stack reaches its maximum permitted size, objects on the stack are garbage-collected using the Cheney algorithm by moving all live data into a separate heap. Following this, the stack is unwound ("popped") and the program resumes from the state saved just before the garbage collection. Baker says "Appel's method avoids making a large number of small trampoline bounces by occasionally jumping off the Empire State Building."^[20] The garbage collection ensures that mutual tail recursion can continue indefinitely. However, this approach requires that no C function call ever returns, since there is no guarantee that its caller's stack frame still exists; therefore, it involves a much more dramatic internal rewriting of the program code: continuation-passing style.

Relation to while construct

Tail recursion can be related to the while control flow operator by means of a transformation such as the following:

function foo(x) is:

  if predicate(x) then

    return foo(bar(x))

  else

    return baz(x)

The above construct transforms to:

function foo(x) is:

  while predicate(x) do:

    x ← bar(x)

  return baz(x)

In the preceding, x may be a tuple involving more than one variable: if so, care must be taken in designing the assignment statement x ← bar(x) so that dependencies are respected. One may need to introduce auxiliary variables or use a swap construct.

More general uses of tail recursion may be related to control flow operators such as break and continue, as in the following:

function foo(x) is:

  if p(x) then

    return bar(x)

  else if q(x) then

    return baz(x)

  ...

  else if t(x) then

    return foo(quux(x))

  ...

  else

    return foo(quuux(x))

where bar and baz are direct return calls, whereas quux and quuux involve a recursive tail call to foo. A translation is given as follows:

function foo(x) is:

  do:

    if p(x) then

      x ← bar(x)

      break

    else if q(x) then

      x ← baz(x)

      break

    ...

    else if t(x) then

      x ← quux(x)

      continue

    ...

    else

      x ← quuux(x)

      continue

    loop

  return x

By language

• 
  Common Lisp - Some implementations perform tail-call optimization during compilation if optimizing for speed


• 
  JavaScript - ECMAScript 6.0 compliant engines should have tail calls^[21] which is now implemented on Safari/WebKit^[22]
  


• 
  Lua - Tail recursion is performed by the reference implementation^[23]
  


• 
  Python - Stock Python implementations do not perform tail-call optimization, though a third-party module is available to do this.^[24] Language inventor Guido van Rossum contends that stack traces are altered by tail call elimination making debugging harder, and prefers that programmers use explicit iteration instead^[25]
  


• 
  Scheme - Required by the language definition^[26][27]
  


• 
  Racket - Yes^[28]
  


• 
  Tcl - Since Tcl 8.6, Tcl has a tailcall command^[29]
  


• 
  Kotlin - Has tailrec modifier for functions^[30]
  


• 
  Elixir - Elixir implements tail-call optimization^[31] As do all languages currently targeting the BEAM VM.


• 
  Perl - Explicit with a variant of the "goto" statement that takes a function name: goto &NAME;^[32]
  


• 
  Scala - Tail recursive functions are automatically optimized by the compiler. Such functions can also optionally be marked with a @tailrec annotation.


• 
  Objective-C - Compiler optimizes tail calls when -O1 (or higher) option specified but it is easily disturbed by calls added by Automatic Reference Counting (ARC).


• 
  F#- F# implements TCO by default where possible "Tail Calls in F#". msdn. Microsoft..mw-parser-output cite.citation{font-style:inherit}.mw-parser-output .citation q{quotes:"""""""'""'"}.mw-parser-output .citation .cs1-lock-free a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/6/65/Lock-green.svg/9px-Lock-green.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .citation .cs1-lock-limited a,.mw-parser-output .citation .cs1-lock-registration a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/d/d6/Lock-gray-alt-2.svg/9px-Lock-gray-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .citation .cs1-lock-subscription a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/a/aa/Lock-red-alt-2.svg/9px-Lock-red-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration{color:#555}.mw-parser-output .cs1-subscription span,.mw-parser-output .cs1-registration span{border-bottom:1px dotted;cursor:help}.mw-parser-output .cs1-ws-icon a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/4/4c/Wikisource-logo.svg/12px-Wikisource-logo.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output code.cs1-code{color:inherit;background:inherit;border:inherit;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;font-size:100%}.mw-parser-output .cs1-visible-error{font-size:100%}.mw-parser-output .cs1-maint{display:none;color:#33aa33;margin-left:0.3em}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration,.mw-parser-output .cs1-format{font-size:95%}.mw-parser-output .cs1-kern-left,.mw-parser-output .cs1-kern-wl-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right,.mw-parser-output .cs1-kern-wl-right{padding-right:0.2em}]

See also

Look up tail recursion in Wiktionary, the free dictionary.

• Course-of-values recursion


• Recursion (computer science)


• Inline expansion


• Leaf subroutine


• Corecursion

Notes

References

This article is based on material taken from the Free On-line Dictionary of Computing prior to 1 November 2008 and incorporated under the "relicensing" terms of the GFDL, version 1.3 or later.