Computer Science – Programming Languages
Scientific paper
2009-03-12
Computer Science
Programming Languages
Paper presented at the 18th Workshop on Logic-based Methods in Programming Environments (WLPE2008) (Report-No: WLPE/2008). Pap
Scientific paper
Termination properties of actual Prolog systems with constraints are fragile and difficult to analyse. The lack of the occurs-check, moded and overloaded arithmetical evaluation via is/2 and the occasional nontermination of finite domain constraints are all sources for invalidating termination results obtained by current termination analysers that rely on idealized assumptions. In this paper, we present solutions to address these problems on the level of the underlying Prolog system. Improved unification modes meet the requirements of norm based analysers by offering dynamic occurs-check detection. A generalized finite domain solver overcomes the shortcomings of conventional arithmetic without significant runtime overhead. The solver offers unbounded domains, yet propagation always terminates. Our work improves Prolog's termination and makes Prolog a more reliable target for termination and type analysis. It is part of SWI-Prolog since version 5.6.50.
Neumerkel Ulrich
Triska Markus
Wielemaker Jan
No associations
LandOfFree
Better Termination for Prolog with Constraints 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 Better Termination for Prolog with Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Better Termination for Prolog with Constraints will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-36536