Affiliation:
1. INRIA and LORIA, Vandoeuvre lès Nancy Cedex France
Abstract
A termination proof method for rewriting under strategies, based on an explicit induction on the termination property, is presented and instantiated for the innermost, outermost, and local strategies. Rewriting trees are simulated by proof trees generated with an abstraction mechanism, narrowing and constraints representing sets of ground terms. Abstraction introduces variables to represent normal forms without computing them and to control the narrowing mechanism, well known to easily diverge. The induction ordering is not given a priori, but defined with ordering constraints, incrementally set during the proof. It is established that termination under strategy is equivalent to the construction of finite proof trees schematizing terminating rewriting trees. Sufficient effective conditions to ensure finiteness are studied and the method is illustrated on several examples for each specific strategy.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Reference65 articles.
1. Alarcón B. and Lucas S. 2007. Termination of innermost context-sensitive rewriting using dependency pairs. In Proceedings of the 6th International Symposium on Frontiers of Combining Systems. Lecture Notes in Artificial Intelligence Springer. 10.1007/978-3-540-74621-8_5 Alarcón B. and Lucas S. 2007. Termination of innermost context-sensitive rewriting using dependency pairs. In Proceedings of the 6th International Symposium on Frontiers of Combining Systems. Lecture Notes in Artificial Intelligence Springer. 10.1007/978-3-540-74621-8_5
2. Correct and Complete (Positive) Strategy Annotations for OBJ
3. Termination of term rewriting using dependency pairs
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献