Computer Science – Programming Languages
Scientific paper
2004-09-21
Theory and Practice of Logic Programming: 5(6):623-668, 2005
Computer Science
Programming Languages
46 pages, 3 figures To appear in Theory and Practice of Logic Programming
Scientific paper
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.
Demoen Bart
Harvey Warwick
la Banda Maria Garcia de
Marriott Kim
Stuckey Peter J.
No associations
LandOfFree
Checking modes of HAL programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Checking modes of HAL programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Checking modes of HAL programs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-327293