Argument Filterings and Usable Rules for Simply Typed Dependency Pairs (Q3655195): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-04222-5_7
+Normal rank
@@ Property / OpenAlex ID @@
+W1505638068
@@ Property / OpenAlex ID: W1505638068 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4447246
@@ Property / cites work: Q4447246 / rank @@
+Normal rank
@@ 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 @@
+Solving Partial Order Constraints for LPO Termination
+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 @@
+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 @@
+Comparing curried and uncurried rewriting
@@ Property / cites work: Comparing curried and uncurried rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Enhancing dependency pair method using strong computability in simply-typed term rewriting
+Normal rank
@@ Property / cites work @@
+Proving Termination Using Recursive Path Orders and SAT Solving
+Normal rank
@@ Property / cites work @@
+Rewriting Techniques and Applications
@@ Property / cites work: Rewriting Techniques and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations
+Normal rank
@@ Property / cites work @@
+Modular and incremental automated termination proofs
+Normal rank
@@ Property / cites work @@
+Q2778888
@@ Property / cites work: Q2778888 / rank @@
+Normal rank