Totally correct logic program transformations via well-founded annotations (Q2271905): Difference between revisions

@@ Property / cites work @@
+Q4385536
@@ Property / cites work: Q4385536 / rank @@
+Normal rank
@@ Property / cites work @@
+Reasoning about termination of pure Prolog programs
+Normal rank
@@ Property / cites work @@
+Strong termination of logic programs
@@ Property / cites work: Strong termination of logic programs / rank @@
+Normal rank
@@ Property / cites work @@
+Simultaneous Replacement in Normal Programs
@@ Property / cites work: Simultaneous Replacement in Normal Programs / rank @@
+Normal rank
@@ Property / cites work @@
+A Transformation System for Developing Recursive Programs
+Normal rank
@@ Property / cites work @@
+Q4385535
@@ Property / cites work: Q4385535 / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of rewriting
@@ Property / cites work: Termination of rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
+Normal rank
@@ Property / cites work @@
+Q3783512
@@ Property / cites work: Q3783512 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992908
@@ Property / cites work: Q3992908 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3996676
@@ Property / cites work: Q3996676 / rank @@
+Normal rank
@@ Property / cites work @@
+Synthesis and transformation of logic programs using unfold/fold proofs
+Normal rank
@@ Property / cites work @@
+Unfold/fold transformation of stratified programs
@@ Property / cites work: Unfold/fold transformation of stratified programs / rank @@
+Normal rank