Recursion

Defining a procedure in terms of itself — with a base case to stop the mirrors from reflecting forever.

Core Principles & Analysis

• Recursive definitions reach back to Euclid and Fibonacci's rabbits.
• Turing-complete computation needs only recursion and a conditional.
• Every recursion can be rewritten as iteration with an explicit stack — the compiler does it with tail calls.