An overview of HAL

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

    36 Citations (Scopus)


    Experience using constraint programming to solve real-life problems has shown that finding an efficient solution to the problem often requires experimentation with different constraint solvers or even building a problem-specific constraint solver. HAL is a new constraint logic programming language expressly designed to facilitate this process. It provides a well-defined solver interface, mutable global variables for implementing a constraint store, and dynamic scheduling for combining, extending and writing new constraint solvers. Equally importantly, HAL supports semi-optional type, mode and determinism declarations. These allow natural constraint specification by means of type overloading, better compile-time error checking and generation of more efficient run-time code.
    Original languageEnglish
    Title of host publicationPrinciples and Practice of Constraint Programming – CP’99
    Subtitle of host publication5th International Conference, CP’99 Alexandria, VA, USA, October 11-14, 1999 Proceedings
    EditorsJoxan Jaffar
    Place of PublicationBerlin Germany
    Number of pages15
    ISBN (Print)3540666265
    Publication statusPublished - 1999
    EventInternational Conference on Principles and Practice of Constraint Programming 1999 - Alexandria, United States of America
    Duration: 11 Oct 199914 Oct 1999
    Conference number: 5th

    Publication series

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


    ConferenceInternational Conference on Principles and Practice of Constraint Programming 1999
    Abbreviated titleCP 1999
    Country/TerritoryUnited States of America

    Cite this