[<<][staapl][>>][..]

Mon Aug 27 14:49:10 CEST 2007

## closures & stacks

something to think about: a compositional language can have first
class functions without having first class closures, and without this
leading to any kind of inconsistency. like 'downward closures only'.
this brings me back to linear vs. non--linear.
a key observation is that linear data structures are allowed to refer
to non--linear ones, as long as the non--linear collector can traverse
the linear data tree (acyclic graph in the case we work with reference
counts as an optimization). but non--linear structures are NOT allowed
to refer to linear structures. (because otherwise they would not be
able to be managed by the linear collector).
this makes the non--linear collector trivially pre--emptable by linear
programs. PROVE THIS!

[Reply][About]

[<<][staapl][>>][..]