Anonymous recursion

• abstract: In computer science, anonymous recursion is recursion which does not explicitly call a function by name, but rather implicitly calls a function depending on the current context, especially "the current function" or sometimes "the calling function of the current function". This is supported in some programming languages via keywords (or other constructions) that allow one to refer to the current context, and more abstractly can be produced via fixed-point combinators.

以上来源于: WordNet