Sign inSign in
ConceptSystems & CS

Constant folding

An optimization technique where constant expressions are evaluated and replaced with their hardcoded values at compile time.
as Laurie Kirk defines itRE//verse ConferenceThe wording closest to all 3 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.

Lecturers

3

Each in their own terms, from the easiest level.

  • Steven Johnson

    MIT · Undergraduate

    An optimization technique where the compiler simplifies expressions containing constants at compile time rather than computing them at runtime.
    • 40:53High Performance in Dynamic Languages
  • Andy Pavlo

    Carnegie Mellon University · Graduate

    An optimization where sub-expressions involving only constants are evaluated once and the result is reused.
    • 1:08:33Query Execution & Processing Part 2

Connections

7

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

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