Sign inSign in
ConceptSystems & CS

Lazy evaluation

An evaluation strategy that delays expression evaluation until its value is needed, avoiding unnecessary computation for data constructors and selectors.
as Hal Abelson & Gerald Jay Sussman defines itMITThe wording closest to all 4 definitions
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

4

Each in their own terms, from the easiest level.

  • John Hughes

    Chalmers University of Technology · Undergraduate

    An evaluation strategy that delays the evaluation of an expression until its value is needed, enabling the creation and manipulation of infinite data structures.
    • 33:46Why Functional Programming Matters: Higher-Order Glue & Lazy Evaluation
  • Jon Bentley

    MIT · Undergraduate

    Delaying a computation until the result is actually needed.
  • Nick Trefethen

    Society for Industrial and Applied Mathematics (SIAM) · Undergraduate

    An evaluation strategy where matrix dimensions are determined at runtime when discretizing operators.
    • 38:03Chebfun: Numerical Computing with Functions via Chebyshev Polynomials (SIAM 2013)

Lectures that assume it

1

Connections

10

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

4 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.