Conjunctive partial deduction: foundations, control, algorithms, and experiments

Journal of Logic Programming

Volumn 41, Issue 2-3, 1999, Pages 231-277

  De Schreye, Danny ^a   Glück, Robert ^b   Jørgensen, Jesper ^c   Leuschel, Michael ^a   Martens, Bern ^a   Sørensen, Morten Heine ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b UNIVERSITY OF COPENHAGEN   (Denmark)

^c UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTATIONAL LINGUISTICS; CONTROL; OPTIMIZATION; PROGRAM COMPILERS;

CONJUNCTIVE PARTIAL DEDUCTION; PARTIAL EVALUATION; PROGRAM SPECIALIZATION; SUPERCOMPILATION; UNFOLD FOLDS TRANSFORMATIONS; WELL QUASI ORDER;

LOGIC PROGRAMMING;

EID: 0343390271     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(99)00030-8     Document Type: Article

References (73)

1. C. Aravindan, P.M. Dung, On the correctness of unfold/fold transformation of normal and extended logic programs, Journal of Logic Programming 24 (3) (1995) 201-217.
2. K. Benkerimi, P.M. Hill, Supporting transformations for the partial evaluation of logic programs, Journal of Logic and Computation 3 (5) (1993) 469-486.
3. R. Bol, Loop checking in partial deduction, Journal of Logic Programming 16 (1&2) (1993) 25-46.
4. A. Bossi, N. Cocco, S. Dulli, A method for specialising logic programs, ACM Transactions on Programming Languages and Systems 12 (2) (1990) 253-302.
5. A. Bossi, N. Cocco, Preserving Universal Termination through Unfold/Fold, in: G. Levi, M. Rodriguez-Artalejo (Eds.), Proceedings of the Fourth International Conference on Algebraic and Logic Programming, LNCS 850, Springer, Berlin. 1994, pp. 269-286.
6. A. Bossi, S. Etalle, Transforming acyclic programs, ACM Transactions on Programming Languages and Systems 16 (4) (1994) 1081-1096.
7. A. Bossi, S. Etalle, More on unfold/fold transformations of normal programs: Preservation of Fitting's semantics, in: L. Fribourg, F. Turini (Eds.), Logic Program Synthesis and Transformation -Meta - Programming in Logic. Proceedings of LOPSTR'94 and META'94, LNCS 883, Springer, Berlin, 1994, pp. 311-331.
8. A. Bossi, N. Cocco, S. Etalle, Transformation of Left Terminating Programs: The Reordering Problem, in: M. Proietti (Ed.), Logic Program Synthesis and Transformation. Proceedings of LOPSTR'95, LNCS 1048, Springer, Berlin, 1995, pp. 33-45.
9. A. Bossi, N. Cocco, Replacement can Preserve Termination, in: J. Gallagher (Ed.), Pre-Proceedings of LOPSTR'96, Stockholm, Sweden, 1996, pp. 78-91.
10. M. Bruynooghe, D. De Schreye, B. Martens, A general criterion for avoiding infinite unfolding during partial deduction New Generation Computing 11 (1) (1992) 47-79.
11. R.M. Burstall, J. Darlington, A transformation system for developing recursive programs, Journal of the ACM 24 (1) (1977) 44-67.
12. W.-N. Chin, Automatic Methods for Program Transformation, PhD thesis, Imperial College, University of London, 1990.
13. O. Danvy, R. Glück, P. Thiemann, Partial Evaluation, LNCS 1110, Springer, Berlin, 1996.
14. B. Demoen, On the transformation of a Prolog program to a more efficient binary program, in: [38], 1993, pp. 242-252.
15. D. De Schreye, M. Leuschel, B. Martens, Program specialisation for logic programs. Tutorial. Abstract, in: J. Lloyd (Ed.), Proceedings ILPS'95, MIT Press, Cambridge, MA, 1995, pp. 615-616.
16. N. Dershowitz, J.-P. Jouannaud, Rewrite systems, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, 244-320, Elsevier, Amsterdam, 1992.
17. D.A. de Waal, J. Gallagher, The applicability of logic program analysis and transformation to theorem proving, in: A. Bundy (Ed.), Automated Deduction - CADE - 12, Springer, Berlin, 1994, pp. 207-221.
18. L. Fribourg, Extracting logic programs from proofs that use extended prolog execution and induction. Proceedings ICLP'90, MIT Press, Cambridge MA, 1990, pp. 685-699.
19. Y. Futamura, Partial evaluation of a computation process - an approach to a compiler-compiler, Systems Computers Controls 2 (5) (1971) 45-50.
20. J. Gallagher, M. Bruynooghe, Some low-level source transformations for logic programs, in: M. Bruynooghe (Ed.), Proceedings Meta'90, Leuven, Belgium, 1990, pp. 229-244.
21. J. Gallagher, A system for specialising logic programs, Technical Report TR-91-32, University of Bristol, 1991.
22. J. Gallagher, M. Bruynooghe, The derivation of an algorithm for program specialisation, New Generation Computing 9 (3 & 4) (1991) 305-333.
23. J. Gallagher, Tutorial on specialisation of logic programs, in: Proceedings of the ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, ACM Press, New York, 1993, pp. 88-98.
24. P.A. Gardner, J.C. Shepherdson, Unfold/fold transformations in logic programs, in: J.-L. Lassez, G. Plotkin (Eds.), Computational Logic, Essays in Honor of Alan Robinson, MIT Press, Cambridge, MA, 1991, pp. 565-583.
25. R. Glück, J. Jørgensen, B. Martens, M.H. Sørensen, Controlling conjunctive partial deduction of definite logic programs, in: H. Kuchen, S.D. Swierstra (Eds.), Programming Language Implementation and Logic Programming. Proceedings, LNCS 1140, Springer, Berlin, 1996, pp. 152-166.
26. C.A. Gurr, A Self-Applicable Partial Evaluator for the Logic Programming Language Gödel. PhD thesis, Department of Computer Science, University of Bristol, 1994.
27. G. Higman, Ordering by divisibility in abstract algebras, Proceedings of the London Mathematical Society 2 (1952) 326-336.
28. N.D. Jones, C.K. Gomard, P. Sestoft, Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliff, NJ, 1993.
29. J. Jørgensen, M. Leuschel, Efficiently generating efficient generating extensions in Prolog, in: [14], 1996, pp. 238-262.
30. J. Jørgensen, M. Leuschel, B. Martens, Conjunctive partial deduction in practice, in: John Gallager (Ed.), Logic Program Synthesis and Transformation, Proceedings of the sixth International Workshop, LOPSTR'96, LNCS 1207, Stockholm, Sweden, August 1996, pp. 59-82.
31. T. Kanamori, K. Horiuichi, Construction of logic programs based on generalized unfold/fold rules, in: J.-L. Lassez (Ed.), Proceedings of the Fourth International Conference on Logic Programming, MIT Press, Cambridge, MA, 1987, pp. 744-768.
32. J. Komorowski, Partial evaluation as a means for inferencing data structures in an applicative language: a theory and implementation in the case of prolog, in: Symposium on Principles of Programming Languages, ACM Press, New York, 1982, pp. 255-167.
33. J.B. Kruskal, Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture, Transactions of the American Mathematical Society 95 (1960) 210-225.
34. A. Lakhotia, To PE or not to PE, in: M. Bruynooghe (Ed.), Proceedings of Meta90 Workshop on Meta Programming in Logic, Leuven, Belgium, 1990, pp. 218-228.
35. A. Lakhotia, L. Sterling, How to control unfolding when specializing interpreters, New Generation Computing 8 (1990) 61-70.
36. M. Leuschel, Partial evaluation of the "real thing", in: L. Fribourg, F. Turini (Eds.), Logic Program Synthesis and Transformation - Meta-Programming in Logic. Proceedings of LOPSTR'94 and META'94, LNCS 883, Springer, Berlin, 1994, pp. 122-137.
37. M. Leuschel, Ecological partial deduction: Preserving characteristic trees without constraints, in: M. Proietti (Ed.), Logic Program Synthesis and Transformation. Proceedings of LOPSTR'95, LNCS 1048, Springer, Berlin, 1995, pp. 1-16.
38. M. Leuschel, Advanced Techniques for Logic Program Specialisation, PhD thesis, K.U. Leuven, May 1997 (Available via http://www.cs.kuleuven.ac.be/∼lpai).
39. M. Leuschel, Program Specialisation and Abstract Interpretation Reconciled, in: J. Jaffar (Ed.), Proceedings of the Joint International Conference and Symposium on Logic Programming JICSLP'98, MIT Press, Cambridge, MA, 1998, pp. 220-234.
40. M. Leuschel, On the Power of Homeomorphic Embedding for Online Termination, in: G. Levi (Ed.), Static Analysis Proceedings of SAS'98, LNCS 1503, 1998, pp. 230-245.
41. M. Leuschel, Improving Homeomorphic Embedding for Online Termination, in: P. Flener (Ed.), Logic Program Synthesis and Transformation, Proceedings of LOPSTR'98, LNCS 1559, 199-218.
42. M. Leuschel, D. De Schreye, Constrained partial deduction and the preservation of characteristic trees, New Generation Computing 16 (3) (1998) 283-342.
43. M. Leuschel, D. De Schreye, Creating specialised integrity checks through partial evaluation of meta-interpreters, The Journal of Logic Programming, 36, 1998, pp. 149-193 (Earlier version in Proceedings of PEPM'95, ACM Press, New York, (1995) 253-263).
44. M. Leuschel, D. De Schreye, Creating specialised integrity checks through partial evaluation of meta- interpreters, The Journal of Logic Programming, 36, 1998, pp. 149-193 (Earlier version in Proceedings of PEPM'95, ACM Press, New York, (1995) 253-263).
45. M. Leuschel, D. De Schreye, Logic program specialisation: How to be more specific, in: H. Kuchen, S.D. Swierstra (Eds.), Programming Languages: Implementations, Logics and Programs, LNCS 1140, 1996, pp. 137-151.
46. M. Leuschel, D. De Schreye, A. de Waal, A conceptual embedding of folding into partial deduction: Towards a maximal integration, in: M. Maher (Ed.), Proceedings of the Joint International Conference and Symposium on Logic Programming JICSLP'96, MIT Press, Cambridge, MA, 1996, pp. 319-332.
47. M. Leuschel, B. Martens, Partial deduction of the ground representation and its application to integrity checking, in: J. Lloyd (Ed.), Proceedings of ILPS'95, the International Logic Programming Symposium, MIT Press, Cambridge, MA, 1995, pp. 495-509.
48. M. Leuschel, B. Martens, Global control for partial deduction through characteristic atoms and global trees, in: [14], 1996, pp. 263-283.
49. M. Leuschel, B. Martens, D. De Schreye, Controlling generalisation and polyvariance in partial deduction of normal logic programs, ACM Transactions on Programming Languages and Systems 20 (1) (1998) 208-258.
50. M. Leuschel, M.H. Sørensen, Redundant argument filtering of logic programs, in: John Gallager (Ed.), Logic Program Synthesis and Transformation, Proceedings of the Sixth International Workshop, LOPSTR'96, LNCS 1207, 83-103, Stockholm, Sweden, August 1996.
51. M. Leuschel, The ECCE partial deduction system and the DPPD library of benchmarks (Available via http://www.cs.kuleuven.ac.be/∼lpai).
52. J.W. Lloyd, Foundations of Logic Programming Springer, Berlin, 1987.
53. J.W. Lloyd, J.C. Shepherdson, Partial evaluation in logic programming, Journal of Logic Programming 11 (1991) 217-242.
54. K. Marriott, L. Naish, J.-L. Lassez, Most specific logic programs, in: Proceedings of the Joint International Conference and Symposium on Logic Programming, IEEE, MIT Press, Cambridge, MA, 1988.
55. K. Marriott, L. Naish, J.-L. Lassez, Most specific logic programs, Annals of Mathematics and Artificial Intelligence 1 (1990) 303-338.
56. B. Martens, D. De Schreye, Automatic finite unfolding using well-founded measures, Journal of Logic Programming 28 (1996) 89-146.
57. B. Martens, J. Gallagher, Ensuring global termination of partial deduction while allowing flexible polyvariance, in: L. Sterling (Ed.), Proceedings ICLP'95, MIT Press, Cambridge, MA, 1995, pp. 597-613 (Extended version as Technical Report CSTR-94-16, University of Bristol).
58. T. Mogensen, A. Bondorf, Logimix: A self-applicable partial evaluator for Prolog, in: [38], 1993, pp. 214-227.
59. S. Owen, Issues in the partial evaluation of meta-interpreters, in: H. Abramson, M. Rogers (Eds.), Meta-Programming in Logic Programming, Proceedings of the Meta88 Workshop, June 1988, MIT Press, Cambridge, MA, 1989, pp. 319-339.
60. A. Pettorossi, M. Proietti, Transformation of logic programs: Foundations and Techniques, Journal of Logic Programming 19&20 (1994) 261-320.
61. S. Prestwich, The PADDY partial deduction system, Technical Report ECRC-92-6 ECRC, Munich, Germany, 1992.
62. M. Proietti, A. Pettorossi, Unfolding - definition - folding, in this order, for avoiding unnecessary variables in logic programs, Theoretical Computer Science 142 (1) (1995) 89-124.
63. M. Proietti, A. Pettorossi, The loop absorption and the generalization strategies for the development of logic programs and partial deduction, The Journal of Logic Programming 16 (1&2) (1993) 123-162.
64. D. Sahlin, Mixtus: An automatic partial evaluator for full Prolog. New Generation Computing 12 (1) (1993) 7-51.
65. T. Sato, Equivalence-preserving first-order unfold/fold transformation systems, Theoretical Computer Science 105 (1992) 57-84.
66. H. Seki, Unfold/fold transformation of stratified programs, Theoretical Computer Science 86 (1991) 107-139.
67. H. Seki, Unfold/fold transformation of general programs for the well-founded semantics, Journal of Logic Programming 16 (1993) 5-23.
68. Z. Somogyi, F. Henderson, T. Conway, The execution algorithm of Mercury: An efficient purely declarative logic programming language, The Journal of Logic Programming 29 (1996) 17-64.
69. M.H. Sørensen, R. Glück, An algorithm of generalization in positive supercompilation, in: J. Lloyd (Ed.), Proceedings ILPS'95, MIT Press, Cambridge, MA, 1995, pp. 465-479.
70. H. Tamaki, T. Sato, Unfold/fold transformations of logic programs, in: S.-Å. Tärnlund (Ed.), Proceedings of the Second International Conference on Logic Programming, Uppsala, Sweden, 1984, pp. 127-138.
71. V.F. Turchin, The concept of a supercompiler, ACM Transactions on Programming Languages and Systems 8 (3) (1986) 292-325.
72. F. van Harmelen, The limitations of partial evaluation, in: P. Jackson, H. Reichgelt, F. van Harmelen (Eds.), Logic-Based Knowledge Representation, MIT Press, Cambridge, MA, 1989, pp. 87-111.
73. P.L. Wadler, Deforestation: Transforming programs to eliminate intermediate trees, Theoretical Computer Science 73 (1990) 231-248.