Another Newbie in distress :-)

[Charles Hixson <charleshixsn@mail.earthlink.net>]

Those are nice distinction.  I'm going to check the differences in
implementation between heterogeneous and homogeneous.

But the one that bothers me is "Storage Pools". Intuitively a storage pool
is essentially a block of storage that is allocated and freed, however...
If I remember my spec's correctly, anything that is declared in the package
declaration exists permanently from the time that the package in called.
This means that the reference to the storage pool would never get freed.  Or
it means that I don't understand what a storage pool is (likely).

I really don't want to go around implementing garbage collectors.  Reference
counters won't collect networks (trees, ok,  lattices, ok, but not
networks).  The only thing that looks like it would do the job is mark and
sweep, but that's much better when done inside the language.  Storage pools
might be able to do the job, but they would need to release their storage
when the last external reference disappeared.  If they don't, then I get a
viscious memory leak.  I've seen several references to storage pools, but
haven't found a good source of info.

David Botton wrote:

> May also be found at:
>
> Heterogeneous, Reference-Counted Lists (Heaney)
> http://www.adapower.com/alg/hetroref.html
>
> Homogeneous, Reference-Counted Lists (Heaney)
> http://www.adapower.com/alg/homoref.html
>
> > Use the search engine to find "list" in the subject line.  The article
> > was titled "homogeneous lists", or something like that.