Anonymous recursion

Short description: Recursion without calling a function by name

In computer science, anonymous recursion is recursion which does not explicitly call a function by name. This can be done either explicitly, by using a higher-order function – passing in a function as an argument and calling it – or implicitly, via reflection features which allow one to access certain functions depending on the current context, especially "the current function" or sometimes "the calling function of the current function".

In programming practice, anonymous recursion is notably used in JavaScript, which provides reflection facilities to support it. In general programming practice, however, this is considered poor style, and recursion with named functions is suggested instead. Anonymous recursion via explicitly passing functions as arguments is possible in any language that supports functions as arguments, though this is rarely used in practice, as it is longer and less clear than explicitly recursing by name.

In theoretical computer science, anonymous recursion is important, as it shows that one can implement recursion without requiring named functions. This is particularly important for the lambda calculus, which has anonymous unary functions, but is able to compute any recursive function. This anonymous recursion can be produced generically via fixed-point combinators.

## Contents

* 1 Use
* 2 Alternatives
* 2.1 Named functions
* 2.2 Passing functions as arguments
* 3 Examples
* 3.1 APL
* 3.2 JavaScript
* 3.3 Perl
* 3.4 R
* 4 References

## Use

Anonymous recursion is primarily of use in allowing recursion for anonymous functions, particularly when they form closures or are used as callbacks, to avoid having to bind the name of the function.

Anonymous recursion primarily consists of calling "the current function", which results in direct recursion. Anonymous indirect recursion is possible, such as by calling "the caller (the previous function)", or, more rarely, by going further up the call stack, and this can be chained to produce mutual recursion. The self-reference of "the current function" is a functional equivalent of the "this" keyword in object-oriented programming, allowing one to refer to the current context.

Anonymous recursion can also be used for named functions, rather that calling them by name, say to specify that one is recursing on the current function, or to allow one to rename the function without needing to change the name where it calls itself. However, as a matter of programming style this is generally not done.

## Alternatives

### Named functions

The usual alternative is to use named functions and named recursion. Given an anonymous function, this can be done either by binding a name to the function, as in named function expressions in JavaScript, or by assigning the function to a variable and then calling the variable, as in function statements in JavaScript. Since languages that allow anonymous functions generally allow assigning these functions to variables (if not first-class functions), many languages do not provide a way to refer to the function itself, and explicitly reject anonymous recursion; examples include Go.[1]

For example, in JavaScript the factorial function can be defined via anonymous recursion as such:[2]

[1, 2, 3, 4, 5].map(function(n) {
return (!(n > 1)) ? 1 : arguments.callee(n-1) * n;
});

Rewritten to use a named function expression yields:

[1, 2, 3, 4, 5].map(function factorial(n) {
return (!(n > 1)) ? 1 : factorial(n-1) * n;
});

### Passing functions as arguments

Even without mechanisms to refer to the current function or calling function, anonymous recursion is possible in a language that allows functions as arguments. This is done by adding another parameter to the basic recursive function and using this parameter as the function for the recursive call. This creates a higher-order function, and passing this higher function itself allows anonymous recursion within the actual recursive function. This can be done purely anonymously by applying a fixed-point combinator to this higher order function. This is mainly of academic interest, particularly to show that the lambda calculus has recursion, as the resulting expression is significantly more complicated than the original named recursive function. Conversely, the use of fixed-pointed combinators may be generically referred to as "anonymous recursion", as this is a notable use of them, though they have other applications.[3][4]

This is illustrated below using Python. First, a standard named recursion:

def fact(n):
if n == 0:
return 1
return n * fact(n - 1)

Using a higher-order function so the top-level function recurses anonymously on an argument, but still needing the standard recursive function as an argument:

def fact0(n0):
if n0 == 0:
return 1
return n0 * fact0(n0 - 1)
fact1 = lambda f, n1: 1 if n1 == 0 else n1 * f(n1 - 1)
fact = lambda n: fact1(fact0, n)

We can eliminate the standard recursive function by passing the function argument into the call:

fact1 = lambda f, n1: 1 if n1 == 0 else n1 * f(f, n1 - 1)
fact = lambda n: fact1(fact1, n)

The second line can be replaced by a generic higher-order function called a combinator:

F = lambda f: (lambda x: f(f, x))
fact1 = lambda f, n1: 1 if n1 == 0 else n1 * f(f, n1 - 1)
fact = F(fact1)

Written anonymously:[5]

(lambda f: (lambda x: f(f, x))) \
(lambda g, n1: 1 if n1 == 0 else n1 * g(g, n1 - 1))

In the lambda calculus, which only uses functions of a single variable, this can be done via the Y combinator. First make the higher-order function of two variables be a function of a single variable, which directly returns a function, by currying:

fact1 = lambda f: (lambda n1: 1 if n1 == 0 else n1 * f(f)(n1 - 1))
fact = fact1(fact1)

There are two "applying a higher order function to itself" operations here: `f(f)` in the first line and `fact1(fact1)` in the second. Factoring out the second double application into a combinator yields:

C = lambda x: x(x)
fact1 = lambda f: (lambda n1: 1 if n1 == 0 else n1 * f(f)(n1 - 1))
fact = C(fact1)

Factoring out the other double application yields:

C = lambda x: x(x)
D = lambda f: (lambda x: f(lambda v: x(x)(v)))
fact1 = lambda g: (lambda n1: 1 if n1 == 0 else n1 * g(n1 - 1))
fact = C(D(fact1))

Combining the two combinators into one yields the Y combinator:

C = lambda x: x(x)
D = lambda f: (lambda x: f(lambda v: x(x)(v)))
Y = lambda y: C(D(y))
fact1 = lambda g: (lambda n1: 1 if n1 == 0 else n1 * g(n1 - 1))
fact = Y(fact1)

Expanding out the Y combinator yields:

Y = lambda f: (lambda x: f(lambda v: x(x)(v))) \
(lambda x: f(lambda v: x(x)(v)))
fact1 = lambda g: (lambda n1: 1 if n1 == 0 else n1 * g(n1 - 1))
fact = Y(fact1)

Combining these yields a recursive definition of the factorial in lambda calculus (anonymous functions of a single variable):[6]

(lambda f: (lambda x: f(lambda v: x(x)(v)))
(lambda x: f(lambda v: x(x)(v)))) \
(lambda g: (lambda n1: 1 if n1 == 0 else n1 * g(n1 - 1)))

## Examples

### APL

In APL, the current dfn is accessible via `∇`. This allows anonymous recursion, such as in this implementation of the factorial:

{0=⍵:1 ⋄ ⍵×∇ ⍵-1} 5
120
{0=⍵:1 ⋄ ⍵×∇ ⍵-1}¨ ⍳10    ⍝ applied to each element of 0 to 9
1 1 2 6 24 120 720 5040 40320 362880

### JavaScript

In JavaScript, the current function is accessible via `arguments.callee`, while the calling function is accessible via `arguments.caller`. These allow anonymous recursion, such as in this implementation of the factorial:[2]

[1, 2, 3, 4, 5].map(function(n) {
return (!(n > 1)) ? 1 : arguments.callee(n - 1) * n;
});

### Perl

Starting with Perl 5.16, the current subroutine is accessible via the `__SUB__` token, which returns a reference to the current subroutine, or `undef` outside a subroutine.[7] This allows anonymous recursion, such as in the following implementation of the factorial:

#!/usr/bin/perl
use feature ":5.16";

print sub {
my $x = shift;
$x > 0
? $x * __SUB__->( $x - 1 )
: 1;
}->(5), "\n";

### R

In R, the current function can be called using `Recall`. For example,

sapply(0:5, function(n) {
if (n == 0) return(1)
n * Recall(n - 1)

It will not work, however, if passed as an argument to another function, e.g. `lapply`, inside the anonymous function definition. In this case, `sys.function(0)` can be used.[8] For example, the code below squares a list recursively:

(function(x) {
if (is.list(x)) {
lapply(x, sys.function(0))
} else {
x^2

})(list(list(1, 2, 3), list(4, 5)))

## References

1. ↑ Issue 226: It's impossible to recurse a anonymous function in Go without workarounds.
2. ↑ 2.0 2.1 answer by olliej, Oct 25 '08 to "Why was the arguments.callee.caller property deprecated in JavaScript?", StackOverflow
3. ↑ This terminology appear to be largely folklore, but it does appear in the following:
* Trey Nash, Accelerated C# 2008, Apress, 2007, ISBN 1-59059-873-3, p. 462—463. Derived substantially from Wes Dyer's blog (see next item).
* Wes Dyer Anonymous Recursion in C#, February 02, 2007, contains a substantially similar example found in the book above, but accompanied by more discussion.
4. ↑ The If Works Deriving the Y combinator, January 10th, 2008
5. ↑ Hugo Walter's answer to "Can a lambda function call itself recursively in Python?"
6. ↑ Nux's answer to "Can a lambda function call itself recursively in Python?"
7. ↑ Perldoc, "The 'current_sub' feature", perldoc feature
8. ↑ agstudy's answer to Get currently called function to write anonymous recursive function at StackOverflow

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Anonymous recursion. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Anonymous_recursion&oldid=231940"