Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  give an inductive method for proving ak innermost termination of rule-based programs, from which  automatically infer, for each successful proof, a finite strategy for data evaluation.  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,  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 sub-terms, and narrowing, schematizing rewriting steps. Then,  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.
['Olivier Fissore', 'Isabelle Gnaedig', 'Hélène Kirchner']
I am writing a research paper on a idea A proof of weak termination providing the right way to terminate
[{"from": "human", "value": "I am writing a research paper on a idea A proof of weak termination providing the right way to terminate"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  give an inductive method for proving ak innermost termination of rule-based programs, from which  automatically infer, for each successful proof, a finite strategy for data evaluation.  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,  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 sub-terms, and narrowing, schematizing rewriting steps. Then,  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."}]