I might do that. In the meantime, Henry Baker&#x27;s archive[1] contains lots of techniques on garbage collection and heap compaction. I often recommend it.<p>Reference counting can fit on a page[2]. Even though Perl uses it where it&#x27;s a bad fit, Q&#x2F;KDB use it and it&#x27;s a great fit: Because arrays are very big, being able to optimise on count=1 and reuse the buffer is a valuable optimisation!<p>Something that I think would be useful would be an examination of the performance characteristics of different techniques (especially considering new superscalar chips and hardware transactional memory), but this would take some time.<p>[1]: <a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=10871801" rel="nofollow">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=10871801</a><p>[2]: <a href="http:&#x2F;&#x2F;www.brpreiss.com&#x2F;books&#x2F;opus5&#x2F;html&#x2F;page421.html" rel="nofollow">http:&#x2F;&#x2F;www.brpreiss.com&#x2F;books&#x2F;opus5&#x2F;html&#x2F;page421.html</a>