Proving ground confluence and inductive validity in constructor based equational specifications (Q5044723): Difference between revisions

@@ Property / cites work @@
+Q3995129
@@ Property / cites work: Q3995129 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3894958
@@ Property / cites work: Q3894958 / rank @@
+Normal rank
@@ Property / cites work @@
+Proving Properties of Programs by Structural Induction
+Normal rank
@@ Property / cites work @@
+Proofs by induction in equational theories with constructors
+Normal rank
@@ Property / cites work @@
+Q4430308
@@ Property / cites work: Q4430308 / rank @@
+Normal rank
@@ Property / cites work @@
+Proof by consistency
@@ Property / cites work: Proof by consistency / rank @@
+Normal rank
@@ Property / cites work @@
+On sufficient-completeness and related properties of term rewriting systems
+Normal rank
@@ Property / cites work @@
+Automating inductionless induction using test sets
+Normal rank
@@ Property / cites work @@
+Q4246727
@@ Property / cites work: Q4246727 / rank @@
+Normal rank
@@ Property / cites work @@
+Basic narrowing revisited
@@ Property / cites work: Basic narrowing revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Semantic confluence tests and completion methods
@@ Property / cites work: Semantic confluence tests and completion methods / rank @@
+Normal rank