Polymorphic rewriting conserves algebraic strong normalization
Selected papers of the 16th international colloquium on Automata, languages, and programming
Combinatory reduction systems: introduction and survey
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
On the modularity of termination of term rewriting systems
Theoretical Computer Science
Comparing curried and uncurried rewriting
Journal of Symbolic Computation
Theoretical Computer Science - Special issue: algebraic development techniques
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
A Monotonic Higher-Order Semantic Path Ordering
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Termination and Confluence of Higher-Order Rewrite Systems
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Confluence and Termination of Simply Typed Term Rewriting Systems
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
The Higher-Order Recursive Path Ordering
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Mechanizing and Improving Dependency Pairs
Journal of Automated Reasoning
Tyrolean termination tool: Techniques and features
Information and Computation
Enhancing dependency pair method using strong computability in simply-typed term rewriting
Applicable Algebra in Engineering, Communication and Computing
Matrix Interpretations for Proving Termination of Term Rewriting
Journal of Automated Reasoning
The Computability Path Ordering: The End of a Quest
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Automating the dependency pair method
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
SAT solving for termination analysis with polynomial interpretations
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Argument filterings and usable rules for simply typed dependency pairs
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Automated termination proofs for haskell by term rewriting
ACM Transactions on Programming Languages and Systems (TOPLAS)
Simplifying algebraic functional systems
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Proving Termination by Dependency Pairs and Inductive Theorem Proving
Journal of Automated Reasoning
AProVE 1.2: automatic termination proofs in the dependency pair framework
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Proving and disproving termination of higher-order functions
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Dependency pairs for simply typed term rewriting
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs
Journal of Automated Reasoning
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems
Fundamenta Informaticae
Termination Of Term Rewriting By Semantic Labelling
Fundamenta Informaticae
| Hi-index | 0.00 |
Many functional programs and higher order term rewrite systems contain, besides higher order rules, also a significant first order part. We discuss how an automatic termination prover can split a rewrite system into a first order and a higher order part. The results are applicable to all common styles of higher order rewriting with simple types, although some dependency pair approach is needed to use them.