Jump to text
On this page
Copy and source
Published source confirmed at last check

Source changed 2026-11-18 22:51:26 UTC · snapshot created 2026-11-18 22:54:45 UTC · last check 2026-11-18 23:20:20 UTC

CMP.3:4.4 - Retain what remains live, and recompute selectively

A value is live along an execution path while a later operation on that path still needs it. Find its last consumer, including any use in reconstructing the requested output. The storage can be reused after its last use. A live value can also be discarded earlier if it can be obtained again when needed at an acceptable cost and with the required meaning.

Compare full retention, a moving set of recent values, and selected stored checkpoints from which intervening work is recomputed. Include key storage, lookup, copying, arithmetic size and transfer costs when they can change the choice. The mathematical dependency graph can be unchanged while these execution costs differ substantially.

Recomputation must reproduce the needed value from retained inputs and conditions. If it repeats an external effect or uses changed data, its meaning needs separate treatment. A stored checkpoint is useful only if it contains enough information to restart that part of the computation.