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.
This can be done purely anonymously by applying a fixed-point combinator to this higher order 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.
[7] This allows anonymous recursion, such as in the following implementation of the factorial: In R, the current function can be called using Recall.