A meta-environment for generating programming environments
ACM Transactions on Software Engineering and Methodology (TOSEM)
ALP Proceedings of the fourth international conference on Algebraic and logic programming
System Presentation -- CARIBOO: An induction based proof tool for termination with strategies
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Termination of Rewriting With Strategy Annotations
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
A Proof of Weak Termination of Typed lambda-sigma-Calculi
TYPES '96 Selected papers from the International Workshop on Types for Proofs and Programs
Proving Innermost Normalisation Automatically
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Well-Founded Recursive Relations
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
Computing constructor forms with non terminating rewrite programs
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Termination of rewriting under strategies
ACM Transactions on Computational Logic (TOCL)
Analysis of Rewrite-Based Access Control Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
Rewrite rules for search database systems
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proving positive almost sure termination under strategies
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Narrowing, abstraction and constraints for proving properties of reduction relations
Rewriting Computation and Proof
| Hi-index | 0.00 |
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data evaluation. We first present the proof principle, using an explicit induction on the termination property, to prove that any input data has at least one finite evaluation. For that, we observe proof trees built from the rewrite system, schematizing the innermost rewriting tree of any ground term, and generated with two mechanisms: abstraction, schematizing normalization of subterms, and narrowing, schematizing rewriting steps. Then, we show how, for any ground term, a normalizing rewriting strategy can be extracted from the proof trees, even if the ground term admits infinite rewriting derivations.