ConceptSystems & CS
Tail recursion
The optimization in an evaluator where restoring continue points directly to the caller rather than stacking intermediate evaluation states.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Richard Feldman
A recursive call that is the final operation in a function, allowing compilers to optimize it into a loop without consuming extra stack frames.
Connections
5The lectures that define it or assume it, and the concepts next to it.