Checking modes of HAL programs
<|reference_start|>Checking modes of HAL programs: Recent constraint logic programming (CLP) languages, such as HAL and Mercury, require type, mode and determinism declarations for predicates. This information allows the generation of efficient target code and the detection of many errors at compile-time. Unfortunately, mode checking in such languages is difficult. One of the main reasons is that, for each predicate mode declaration, the compiler is required to appropriately re-order literals in the predicate's definition. The task is further complicated by the need to handle complex instantiations (which interact with type declarations and higher-order predicates) and automatic initialization of solver variables. Here we define mode checking for strongly typed CLP languages which require reordering of clause body literals. In addition, we show how to handle a simple case of polymorphic modes by using the corresponding polymorphic types.<|reference_end|>
@article{de la banda2004checking,
    title={Checking modes of HAL programs},
    author={Maria Garcia de la Banda, Warwick Harvey, Kim Marriott, Peter J.
  Stuckey, Bart Demoen},
    journal={Theory and Practice of Logic Programming: 5(6):623-668, 2005},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0409038},
    primaryClass={cs.PL}
}