Harnessing First Order Termination Provers Using Higher Order Dependency Pairs (Q3172889): Difference between revisions

@@ Property / cites work @@
+Term Rewriting and Applications
@@ Property / cites work: Term Rewriting and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Argument Filterings and Usable Rules for Simply Typed Dependency Pairs
+Normal rank
@@ Property / cites work @@
+Termination of term rewriting using dependency pairs
+Normal rank
@@ Property / cites work @@
+Q2723890
@@ Property / cites work: Q2723890 / rank @@
+Normal rank
@@ Property / cites work @@
+The Computability Path Ordering: The End of a Quest
+Normal rank
@@ Property / cites work @@
+A Monotonic Higher-Order Semantic Path Ordering
@@ Property / cites work: A Monotonic Higher-Order Semantic Path Ordering / rank @@
+Normal rank
@@ Property / cites work @@
+SAT solving for termination proofs with recursive path orders and dependency pairs
+Normal rank
@@ Property / cites work @@
+Matrix interpretations for proving termination of term rewriting
+Normal rank
@@ Property / cites work @@
+SAT Solving for Termination Analysis with Polynomial Interpretations
+Normal rank
@@ Property / cites work @@
+Proving termination by dependency pairs and inductive theorem proving
+Normal rank
@@ Property / cites work @@
+Frontiers of Combining Systems
@@ Property / cites work: Frontiers of Combining Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Mechanizing and improving dependency pairs
@@ Property / cites work: Mechanizing and improving dependency pairs / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized sufficient conditions for modular termination of rewriting
+Normal rank
@@ Property / cites work @@
+Q4846997
@@ Property / cites work: Q4846997 / rank @@
+Normal rank
@@ Property / cites work @@
+Automating the dependency pair method
@@ Property / cites work: Automating the dependency pair method / rank @@
+Normal rank
@@ Property / cites work @@
+Tyrolean termination tool: techniques and features
+Normal rank
@@ Property / cites work @@
+Uncurrying for Termination
@@ Property / cites work: Uncurrying for Termination / rank @@
+Normal rank
@@ Property / cites work @@
+Abstract data type systems
@@ Property / cites work: Abstract data type systems / rank @@
+Normal rank
@@ Property / cites work @@
+Comparing curried and uncurried rewriting
@@ Property / cites work: Comparing curried and uncurried rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatory reduction systems: Introduction and survey
+Normal rank
@@ Property / cites work @@
+Simplifying Algebraic Functional Systems
@@ Property / cites work: Simplifying Algebraic Functional Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Higher Order Dependency Pairs for Algebraic Functional Systems
+Normal rank
@@ Property / cites work @@
+Enhancing dependency pair method using strong computability in simply-typed term rewriting
+Normal rank
@@ Property / cites work @@
+On the modularity of termination of term rewriting systems
+Normal rank
@@ Property / cites work @@
+Polymorphic rewriting conserves algebraic strong normalization
+Normal rank
@@ Property / cites work @@
+Q2778888
@@ Property / cites work: Q2778888 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4847000
@@ Property / cites work: Q4847000 / rank @@
+Normal rank