Everything About ___
Live briefing

Everything about Anonymous recursion

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". Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Anonymous recursionA 5-minute orientation
  2. Pick up a classic book: Study Guide -- The Other Wes Moore by Wes MooreThe most-reprinted book on the subject
  3. Go sideways: Fixed-point combinatorA closely related topic
  4. Go sideways: Examples of anonymous functionsA closely related topic

đź“– Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. Use
  2. Alternatives
  3. Examples

🏆 Landmark papers (most cited)

đź“š Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

đź”— Related topics