Change search
ReferencesLink to record
Permanent link

Direct link
Variable shunting for the WAM
Number of Authors: 2
1991 (English)Report (Refereed)
Abstract [en]

This paper describes how to extend the garbage collection for WAM so that it will shunt chains of bound variables if possible. Doing so has two advantages: 1. Space is saved by making it possible to deallocate the intermediate cells. This is particularly useful when those cells are associated with frozen goals. 2. Later dereferencing is speeded up by not having to follow long variable chains. The main complication of this optimization is the treatment of the trailed variables. We claim that all possible chains of variables are shunted by this algorithm. The algorithm has been implemented in SICStus Prolog, and benchmark results are presented in this paper. The full source code for the shunting algorithm is given in this paper.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1991, 1. , 11 p.
SICS Research Report, ISSN 0283-3638 ; R91:07
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-21351OAI: diva2:1041385
Revised version of R89003.Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(1035 kB)12 downloads
File information
File name FULLTEXT01.pdfFile size 1035 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 12 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 4 hits
ReferencesLink to record
Permanent link

Direct link