Sign inSign in
ConceptSystems & CS

Tail recursion

The optimization in an evaluator where restoring continue points directly to the caller rather than stacking intermediate evaluation states.
Watch it explained

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.

Explicit-control evaluator1Recursion1Stack frame1Stack operations1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Richard Feldman

    Zed Industries · Graduate

    A recursive call that is the final operation in a function, allowing compilers to optimize it into a loop without consuming extra stack frames.
    • 20:22Functional Mechanical Sympathy

Connections

5

The lectures that define it or assume it, and the concepts next to it.

Concepts3

Lectures2

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.