Fri Aug 27 14:13:28 CEST 2010

Hash Consing with Names

to implement:  Cn = (Cons An Bn)

  -  Lookup Cn -> Cp
  -  Is it equal to (Cons Ap Bp) where Ap -> An, and Bp -> Bn
  -  If yes, reuse in Flash, 
     otherwise create in RAM + register for resolve later

The point: structures contain real pointers for efficiency, but the
Hash consing is based on names.

The context: the app has large, circular, constant data structures
that could be represented in Flash.

What is necessary: mutable nodes, in case where most of the data
structure is constant, but a small fraction needs to be in RAM: use
indirection but reserve fixed addresses for the mutable values.