Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-16T01:21:42.434Z Has data issue: false hasContentIssue false
  • English
  • Français

Checking modes of HAL programs

Published online by Cambridge University Press:  31 October 2005

MARIC GARCÍA DE LA BANDA ,
WARWICK HARVEY ,
KIM MARRIOTT ,
PETER J. STUCKEY  and
BART DEMOEN
MARIC GARCÍA DE LA BANDA
Affiliation:
School of Computer Science & Software Engineering, Monash University, Australia (e-mail: [email protected], [email protected]) (e-mail: ([email protected])
WARWICK HARVEY
Affiliation:
School of Computer Science & Software Engineering, Monash University, Australia (e-mail: [email protected], [email protected]) (e-mail: ([email protected])
KIM MARRIOTT
Affiliation:
School of Computer Science & Software Engineering, Monash University, Australia (e-mail: [email protected], [email protected]) (e-mail: ([email protected])
PETER J. STUCKEY
Affiliation:
Department of Computer Science & Software Engineering, University of Melbourne, Australia (e-mail: [email protected])
BART DEMOEN
Affiliation:
Department of Computer Science, Catholic University Leuven, Belgium (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Keywords

strong modesmode checkingregular grammars
Type
Regular Papers
Information
Theory and Practice of Logic Programming , Volume 5 , Issue 6 , November 2005 , pp. 623 - 667
Copyright
2005 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

A preliminary version of this paper appeared under the title “Mode Checking in HAL,” in the Conference on Computational Logic (CL'2000), London, June 2000.