Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs (Q673496): Difference between revisions

@@ Property / cites work @@
+Mechanizing structural induction. II: Strategies
@@ Property / cites work: Mechanizing structural induction. II: Strategies / rank @@
+Normal rank
@@ Property / cites work @@
+Q3947094
@@ Property / cites work: Q3947094 / rank @@
+Normal rank
@@ Property / cites work @@
+Basic transformation operations which preserve computed answer substitutions of logic programs
+Normal rank
@@ Property / cites work @@
+Proving Theorems about LISP Functions
@@ Property / cites work: Proving Theorems about LISP Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Compiling control
@@ Property / cites work: Compiling control / rank @@
+Normal rank
@@ Property / cites work @@
+A general criterion for avoiding infinite unfolding during partial deduction
+Normal rank
@@ Property / cites work @@
+A Transformation System for Developing Recursive Programs
+Normal rank
@@ Property / cites work @@
+Derivation of Logic Programs
@@ Property / cites work: Derivation of Logic Programs / rank @@
+Normal rank
@@ Property / cites work @@
+Preservation of stronger equivalence in unfold/fold logic program transformation
+Normal rank
@@ Property / cites work @@
+Q3339245
@@ Property / cites work: Q3339245 / rank @@
+Normal rank
@@ Property / cites work @@
+Partial evaluation in logic programming
@@ Property / cites work: Partial evaluation in logic programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q4038669
@@ Property / cites work: Q4038669 / rank @@
+Normal rank
@@ Property / cites work @@
+Horn clause computability
@@ Property / cites work: Horn clause computability / rank @@
+Normal rank
@@ Property / cites work @@
+Deforestation: Transforming programs to eliminate trees
+Normal rank