Well with Bacon/Dingle (B/D) you use the owned pointers to describe the spawning tree of your data structures and it's a tree by construction (modulo the edge cases that Bacon/Dingle mention) whereas reference counting is an incomplete form of memory management. The "limitations" are a feature, you can't create cycles with B/D easily and with reference counting you can.
> And isn't it possible that my proposal eliminates many of the limitations > while very easily and concisely supporting multi-threading, which the > Bacon/Dingle method can't do very well if at all? 1. B/D does work well with multi-threading. 2. Well it's of course not "Impossible" that you come up with something better, but if you start with reference counting you start from a worse position.
