Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  extend the termination proof methods based on reduction orderings to higher-order rewriting systems based on higher-order pattern matching.  accommodate, on the one hand, a akly polymorphic, algebraic extension of Church’s simply typed λ-calculus and, on the other hand, any use of eta, as a reduction, as an expansion, or as an equation. The user’s rules may be of any type in this type system, either a base, functional, or akly polymorphic type.
['Jean-Pierre Jouannaud', 'Albert Rubio']
I am writing a research paper on a idea Normal Higher-Order Termination
[{"from": "human", "value": "I am writing a research paper on a idea Normal Higher-Order Termination"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  extend the termination proof methods based on reduction orderings to higher-order rewriting systems based on higher-order pattern matching.  accommodate, on the one hand, a akly polymorphic, algebraic extension of Church\u2019s simply typed \u03bb-calculus and, on the other hand, any use of eta, as a reduction, as an expansion, or as an equation. The user\u2019s rules may be of any type in this type system, either a base, functional, or akly polymorphic type."}]