1. J. Andersson, S. Andersson, K. Boortz, M. Carlsson, H. Nilsson, T. Sjoland, and J. Widén. SICStus Prolog User’s Manual. Technical report, SICS, November 1997. SICS Technical Rep ort T93-01.
2. N. Angelopoulos and J. Cussens. Markov chain monte carlo using tree-based priors on modelstructure. In Proceedings of the 17th Annual Conference on Uncertainty in AI (UAI), Seattle, USA, 2001.
3. K. Appleby, M. Carlsson, S. Haridi, and D. Sahlin. Garbage collection for Prolog based on WAM. Communications of the ACM, 31(6):719–741, 1988.
4. Y. C. Chung, S.-M. Moon, K. Ebcioğlu, and D. Sahlin. Reducing sweep time for a nearly empty heap. In Symposium on Principles of Programming Languages (POPL’00), pages 378–389, 2000.
5. B. Demoen. Early reset and reference counting improve variable shunting in the wam. Technical Report CW Report 298, Katholieke Universiteit Leuven, 2000.