Trailing analysis for HAL

Tom Schrijvers, Maria Jose Garcia De La Banda, Bart Demoen

    Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review


    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.
    Original languageEnglish
    Title of host publicationLogic Programming
    Subtitle of host publication18th International Conference, ICLP 2002 Copenhagen, Denmark, July 29 – August 1, 2002 Proceedings
    EditorsPeter J. Stuckey
    Place of PublicationBerlin Germany
    Number of pages16
    ISBN (Print)3540439307
    Publication statusPublished - 2002
    EventInternational Conference on Logic Programming 2002 - Copenhagen, Denmark
    Duration: 29 Jul 20021 Aug 2002
    Conference number: 18th (Proceedings)

    Publication series

    NameLecture Notes in Computer Science
    ISSN (Print)0302-9743


    ConferenceInternational Conference on Logic Programming 2002
    Abbreviated titleICLP 2002
    Internet address

    Cite this