Assignments have sequential meaning: each expression reads the state left
by its predecessor. A learner may explicitly share an intermediate by
assigning a slot; subsequent expressions read that value without rebuilding
its arithmetic tree. This is neither an optimizer catalogue nor a gradient
requirement. Local update rules use exactly the same program structure.
The compiler supplied declaration spans and resolved links from this source snapshot. This page does not assert that this file belongs to a checked closure.