>>135
In data/flow-oriented programming, you can determine memory usage upper-bounds and data lifetimes from the task dependency graph and transformation lattice, and implicitly and deterministically destroy objects when they go out of the lattice's scope. It's like how things work on a call stack, only instead of a stack, it's a lattice.