Title: Representation sharing for Prolog
Authors: Demoen, Bart
Nguyen, Phuong-Lan
Issue Date: Nov-2009
Publisher: Department of Computer Science, K.U.Leuven
Series Title: CW Reports vol:CW571
Abstract: Techniques to reduce the memory footprint of an application include representation sharing between multiple copies of some data. Representation sharing has been implemented through hash-consing in functional languages. Representation sharing for Prolog was not given that much attention in the past. Here, representation sharing is defined for Prolog implementations in a structure copying environment (basically the WAM), and the specific issues arising from the logical variable and backtracking are analyzed. A high-level algorithm is described, and its properties are derived. An implementation in hProlog is evaluated. The impact of representation sharing depends very much on the application. The cost seems acceptable and the memory gains can be large. Issues related to the representation sharing policy are discussed.
Publication status: published
KU Leuven publication type: IR
Appears in Collections:Informatics Section

Files in This Item:
File Description Status SizeFormat
CW571.pdfDocument Published 262KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.