Termination of algorithms over non-freely generated data types (Q4647505): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-61511-3_73
+Normal rank
@@ Property / OpenAlex ID @@
+W1523188793
@@ Property / OpenAlex ID: W1523188793 / rank @@
+Normal rank
@@ Property / cites work @@
+Mechanizing structural induction. II: Strategies
@@ Property / cites work: Mechanizing structural induction. II: Strategies / rank @@
+Normal rank
@@ Property / cites work @@
+Q3894958
@@ Property / cites work: Q3894958 / rank @@
+Normal rank
@@ Property / cites work @@
+Rippling: A heuristic for guiding inductive proofs
+Normal rank
@@ Property / cites work @@
+INKA: The next generation
@@ Property / cites work: INKA: The next generation / rank @@
+Normal rank
@@ Property / cites work @@
+Proof by consistency
@@ Property / cites work: Proof by consistency / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic specifications: a constructive specification method for abstract data types
+Normal rank
@@ Property / cites work @@
+Termination of algorithms over non-freely generated data types
+Normal rank
@@ Property / cites work @@
+Q3804237
@@ Property / cites work: Q3804237 / rank @@
+Normal rank
@@ Property / cites work @@
+On proving the termination of algorithms by machine
+Normal rank
@@ Property / cites work @@
+Q3805961
@@ Property / cites work: Q3805961 / rank @@
+Normal rank