From mboxrd@z Thu Jan  1 00:00:00 1970
From: David Tolpin <dvd@davidashen.net>
Message-Id: <200403021008.i22A8eJv072216@adat.davidashen.net>
To: 9fans@cse.psu.edu
Content-Type: text/plain; charset=KOI8-R
Subject: [9fans] limbo's GC
Date: Tue,  2 Mar 2004 14:08:40 +0400
Topicbox-Message-UUID: 0c41d412-eacd-11e9-9e20-41e7f4b1d025


I have read the article and I am convinced. It is an algorithm different from
that I had in mind, but is efficient enough to support general-purpose garbage
collection.

I have been misled by limbo's papers and manual. 

Can I rephrase it as that I can use arbitrary data structures exactly as I would
with lisp or ML or any other language with automatic memory management. And
that I can rely on instant deallocation of resources if the data structures
behind resources are acyclic?

David