Home → Magazine Archive → June 1988 (Vol. 31, No. 6) → Garbarge collection for Prolog based on WAM → Abstract

Garbarge collection for Prolog based on WAM

By K. Appleby, M. Carllson, S. Haridi, D. Sawhlin

Communications of the ACM, Vol. 31 No. 6, Pages 719-741

Save PDF
The Warren abstract machine (WAM) has become a generally accepted standard Prolog implementation technique. Garbage collection is an important aspect in the implementation of any Prolog system. A synopsis of the WAM is presented and then marking and compaction algorithms are shown that take advantage of WAM's unique use of the data areas. Marking and compaction are performed on both the heap and the trail; both use pointer reversal techniques, which obviate the need for extra stack space. However, two bits for every pointer on the heap are reserved for the garbage collection algorithm. The algorithm can work on segments of the heap, which may lead to a significant reduction of the total garbage collection time. The time of the algorithms are linear in the size of the areas.

The full text of this article is premium content


No entries found