Title: Trailing analysis for HAL
Authors: Schrijvers, Tom ×
Garcia de la Banda, Maria
Demoen, Bart #
Issue Date: 2002
Publisher: Springer-verlag berlin
Series Title: Logics programming, proceedings vol:2401 issue:18 pages:38-53
Conference: International Conference on Logic Programming location:Copenhagen, Denmark date:July 29 - August 1, 2002
Abstract: The HAL language includes a Herbrand constraint solver which uses Taylor's PARMA scheme rather than the standard WAM representation. This allows HAL to generate more efficient Mercury code. Unfortunately, PARMA's variable representation requires value trailing with a trail stack consumption about twice as large as for the WAM. We present a trailing analysis aimed at determining which Herbrand variables do not need to be trailed. The accuracy of the analysis comes from HAL's semi-optional determinism and mode declarations. The analysis has been partially integrated in the HAL compiler and benchmark programs show good speed-up.
ISBN: 3-540-43930-7
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
38227.pdf Published 163KbAdobe PDFView/Open


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

© Web of science