Computer Science – Logic in Computer Science
Scientific paper
2006-09-05
Dans 13th International Conference on Logic for Programming, Artificial Intelligence and Reasoning - LPAR 2006
Computer Science
Logic in Computer Science
Scientific paper
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size based termination and initially developed for ML-like programs. Here, we go one step further by considering conditional rewriting and explicit quantifications and constraints on size annotations. This allows to describe more precisely how the size of the output of a function depends on the size of its inputs. Hence, we can check the termination of more functions. We first give a general type-checking algorithm based on constraint solving. Then, we give a termination criterion with constraints in Presburger arithmetic. To our knowledge, this is the first termination criterion for higher-order conditional rewriting taking into account the conditions in termination.
Blanqui Frédéric
Riba Colin
No associations
LandOfFree
Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems 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 Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-554519