Logic program specialisation through partial deduction: Control issues

Theory and Practice of Logic Programming

Volumn 2, Issue 4-5, 2002, Pages 461-515

  Leuschel, Michael ^a   Bruynooghe, Maurice ^b  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Logic programming; Partial deduction; Partial evaluation; Program specialisation

Indexed keywords

EID: 0347303277     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S147106840200145X     Document Type: Article

References (167)

1. Albert, E., Alpuente, M., Falaschi, M., Julián, P. and Vidal, G. (1998) Improving control in functional logic program specialization. In: G. Levi (ed.), Static Analysis, SAS'98, Proceedings, LNCS 1503, Springer-Verlag, pp. 262-277.
2. Albert, E., Alpuente, M., Hanus, M. and Vidal, G. (1999) A partial evaluation framework for curry programs. In: H. Ganzinger, D. A. McAllester and A. Voronkov (eds.), Logic Programming and Automated Reasoning, LPAR'99, Proceedings, LNCS 1705, Springer-Verlag, pp. 376-395.
3. Albert, E. and Vidal, G. (2001) Source-level abstract profiling for multi-paradigm declarative programs. In: A. Pettorossi (ed.), Pre-Proceedings of 11th Int'l Workshop on Logic-based Program Synthesis and Transformation, LOPSTR'2001.
4. Albert, E., Antoy, S. and Vidal, G. (2001) Measuring the effectiveness of partial evaluation in functional logic languages, in K-K. Lau (ed.), Logic Based Program Synthesis and Transformation, LOPSTR 2000, Selected Papers, LNCS 2042, Springer-Verlag, pp. 103-124.
5. Alpuente, M., Falaschi, M. and Vidal, G. (1996). Narrowing-driven partial evaluation of functional logic programs. In: H. Riis Nielson (ed.), Programming Languages and Systems, ESOP'96, Proceedings, LNCS 1058, Springer-Verlag, pp. 45-61.
6. Alpuente, M., Falaschi, M. and Vidal, G. (1998) Partial evaluation of functional logic programs. ACM Trans. Program. Lang. Syst. 20(4), 768-844.
7. Alpuente, M., Falaschi, M., Julián, P. and Vidal, G. (1997) Spezialisation of lazy functional logic programs. Proceedings of PEPM'97, ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, ACM Press, pp. 151-162.
8. Andersen, L. O. (1992) Partial evaluation of C and automatic compiler generation. In: U. Kastens and P. Pfahler (eds.), Compiler Construction, CC'92, Proceedings, LNCS 641, Springer-Verlag, pp. 251-257.
9. Andersen, L. O. (1994) Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, University of Copenhagen. (DIKU report 94/19).
10. Apt, K. R. (1990) Introduction to logic programming. In: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, North-Holland, pp. 495-574.
11. Apt, K. R. and Bol, R. N. (1994) Logic programming and negation: a survey. J. Logic Program. 19 & 20, 9-72.
12. Aravindan, C. and Dung, P. M. (1994) Partial deduction of logic programs wrt well-founded semantics. New Generat. Comput. 13: 45-74.
13. Beckman, L., Haraldson, A., Oskarsson, Ö. and Sandewall, E. (1976) A partial evaluator and its use as a programming tool. Artif. Intell. 7, 319-357.
14. Benkerimi, K. and Hill, P. M. (1993) Supporting transformations for the partial evaluation of logic programs. J. Logic & Computation, 3(5), 469-486.
15. Benkerimi, K. and Lloyd, J. W. (1990) A partial evaluation procedure for logic programs. In: S. Debray and M. Hermenegildo (eds.), Proceedings North American Conference on Logic Programming, MIT Press, pp. 343-358.
16. Bensaou, N. and Guessarian, I. (1998) Transforming constraining logic programs. Theor. Comput. Sci. 206, 81-125.
17. Birkedal, L. and Welinder, M. (1994) Hand-writing program generator generators. In: M. Hermenegildo and J. Penjam (eds.), Programming Language Implementation and Logic Programming, PLILP'91, Proceedings, LNCS 844, Springer-Verlag, pp. 198-214.
18. Bol, R. (1993) Loop checking in partial deduction, The Journal of Logic Programming 16(1&2), 25-46.
19. Bondorf, A. (1988) Towards a self-applicable partial evaluator for term rewriting systems. In: D. Bjorner, A. P. Ershov and N. D. Jones (eds.), Partial Evaluation and Mixed Computation, North-Holland, pp. 27-50.
20. Bondorf, A. (1989) A self-applicable partial evaluator for term rewriting systems. In: J. Diaz and F. Orejas (eds.), TAPSOFT'89, Proceedings of the International Joint Conference on Theory and Practice of Software Development, LNCS 352, Springer-Verlag, pp. 81-96.
21. Bossi, A. and Cocco, N. (1994) Preserving universal termination through unfold/fold. In: G. Levi and M. Rodriguez-Artalejo (eds.), Algebraic and Logic Programming, ALP'94, Proceedings, LNCS 850, Springer-Verlag, pp. 269-286.
22. Bossi, A. and Cocco, N. (1996) Replacement can preserve termination. In: J. Gallagher (ed.), Logic Programming Synthesis and Transformation, LOPSTR'96, Proceedings, LNCS 1207, Springer-Verlag, pp. 104-129.
23. Bossi, A., Cocco, N. and Dulli, S. (1990) A method for specialising logic programs. ACM Trans. Program. Lang. Syst. 12(2), 253-302.
24. Bossi, A., Cocco, N. and Etalle, S. (1995) Transformation of left terminating programs: The reordering problem. In: M. Proietti (ed.), Logic Program Synthesis and Transformation, LOPSTR'95, Proceedings, LNCS 1048, Springer-Verlag, pp. 33-45.
25. Boulanger, D. and Bruynooghe, M. (1993) Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation. J. Symbolic Computation, 15(5&6), 495-521.
26. Bowers, A. F. and Gurr, C. A. (1995) Towards fast and declarative meta-programming. In: K. R. Apt and F. Turini (eds.), Meta-logics and Logic Programming, MIT Press, pp. 137-166.
27. Bruynooghe, M., De Schreye, D. and Krekels, B. (1989) Compiling control. J. Logic Program. 6, 135-162.
28. Bruynooghe, M., De Schreye, D. and Martens, B. (1992) A general criterion for avoiding infinite unfolding during partial deduction. New Generat. Computing, 11(1), 47-79.
29. Bruynooghe, M., Leuschel, M. and Sagonas, K. (1998) A polyvariant binding-time analysis for off-line partial deduction. In: C. Hankin (ed.), Programming Languages and Systems, ESOP'98, Proceedings, LNCS 1381, Springer-Verlag, pp. 27-41.
30. Bugliesi, M. and Russo, F. (1989) Partial evaluation in Prolog: Some improvements about cut. In: E. L. Lusk and R. A. Overbeek (eds.), Logic Programming: Proceedings of the North American Conference, MIT Press, pp. 645-660.
31. Burstall, R. M. and Darlington, J. (1977) A transformation system for developing recursive programs. J. ACM, 24(1), 44-67.
32. Chan, D. and Wallace, M. (1989) A treatment of negation during partial evaluation. In: H. Abramson and M. Rogers (eds.), Meta-Programming in Logic Programming, Proceedings of the Meta88 Workshop, MIT Press, pp. 299-318.
33. Chen, W. and Warren, D. S. (1996) Tabled evaluation with delaying for general logic programs. J. ACM, 43(1), 20-74.
34. Chin, W.-N. (1993) Towards an automated tupling strategy. Proceedings of PEPM'93, the ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, ACM Press, pp. 119-132.
35. Chin, W.-N. and Khoo, S.-C. (1993) Tupling functions with multiple recursion parameters. in: P. Cousot, M. Falaschi, G. File, A. Rauzy (eds.), Static Analysis, WSA'93, Proceedings, LNCS 724, Springer-Verlag, pp. 124-140.
36. Codish, M. and Taboch, C. (1999) A semantic basis for the termination analysis of logic programs. J. Logic Program. 41(1), 103-123.
37. Consel, C. and Danvy, O. (1993) Tutorial notes on partial evaluation. Proceedings of ACM Symposium on Principles of Programming Languages (POPL'93), ACM Press, pp. 493-501.
38. Dawson, S., Ramakrishnan, C. R., Ramakrishnan, I. V., Sagonas, K., Skiena, S., Swift, T. and Warren, D. S. (1995) Unification factoring for the efficient execution of logic programs. Proceedings ACM Symposium on Principles of Programming Languages (POPL'95), pp. 247-258.
39. Decorte, S., De Schreye, D. and Vandecasteele, H. (1999) Constraint-based termination analysis of logic programs. ACM Trans. Program. Lang. Syst. 21(6), 1137-1195.
40. De Schreye, D. and Decorte, S. (1994) Termination of logic programs: The never ending story. J. Logic Program. 19 & 20, 199-260.
41. De Schreye, D., Glück, R., Jørgensen, J., Leuschel, M., Martens, B. and Sørensen, M. H. (1999) Conjunctive partial deduction: Foundations, control, algorithms and experiments. J. Logic Program. 41(2 & 3), 231-277.
42. de Waal, D. A. and Gallagher, J. (1994) The applicability of logic program analysis and transformation to theorem proving. In: A. Bundy (ed.), Automated Deduction, CADE-12, Proceedings, LNCS 814, Springer-Verlag, pp. 207-221.
43. Debray, S. (1997) Resource-bounded partial evaluation. Proceedings PEPM'97, ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, ACM Press, pp. 179-192.
44. Denecker, M., Bruynooghe, M. and Marek, V. (2001) Logic programming revisited: logic programs as inductive definitions. ACM Trans. Computational Logic, 2(4), 623-654.
45. Dershowitz, N. (1987) Termination of rewriting. J. Symbolic Computation, 3, 69-116.
46. Dershowitz, N. and Jouannaud, J.-P. (1990) Rewrite systems. In: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B, Elsevier/MIT Press, pp. 243-320.
47. Dershowitz, N. and Manna, Z. (1979) Proving termination with multiset orderings. Comm. ACM, 22(8), 465-476.
48. Ershov, A. (1982) Mixed computation: Potential applications and problems for study. Theor. Comput. Sci. 18, 41-67.
49. Etalle, S. and Gabbrielli, M. (1996) Transformations of CLP modules. Theor. Comput. Sci. 166, 101-146.
50. Fioravanti, F., Pettorossi, A. and Proietti, M. (1999) Rules and strategies for contextual specialization of constraint logic programs. Electr. Notes in Theor. Comput. Sci. 30(2).
51. Fioravanti, F., Pettorossi, A. and Proietti, M. (2000) Automated strategies for specializing constraint logic programs. In: K-K. Lau (ed.), Logic Based Program Synthesis and Transformation, LOPSTR 2000, Selected Papers, LNCS 2042, Springer-Verlag, pp. 125-146.
52. Fioravanti, F., Pettorossi, A. and Proietti, M. (2001) Verifying CTL Properties of Infinite State Systems by Specializing Constraint Logic Programs. In: M. Leuschel, A. Podelski, C. R. Ramakrishnan and U. Ultes-Nitsche (eds.), Proceedings Second International Workshop on Verification and Computational Logic, VCL'2001, pp. 85-96.
53. Fujita, H. and Furukawa, K. (1988) A self-applicable partial evaluator and its use in incremental compilation. New Generat. Comput. 6(2 & 3), 91-118.
54. Fuller, D. A. and Abramsky, S. (1988) Mixed computation of Prolog programs. New Generat. Comput. 6(2 & 3), 119-141.
55. Fuller, D. A. F., Bocic, A. and Bertossi, L. E. (1996) Towards efficient partial evaluation in logic programming. New Generat. Comput. 14, 237-259.
56. Gallagher, J. (1991) A system for specialising logic programs. Technical Report TR-91-32, University of Bristol.
57. Gallagher, J. (1993) Tutorial on specialisation of logic programs. Proceedings PEPM'93, ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, ACM Press, pp. 88-98.
58. Gallagher, J. and Bruynooghe, M. (1991) The derivation of an algorithm for program specialisation. New Generat. Comput. 9(3 & 4), 305-333.
59. Gallagher, J. and de Waal, D. A. (1992) Deletion of redundant unary type predicates from logic programs. In: K.-K. Lau and T. Clement (eds.), Logic Program Synthesis and Transformation, Proceedings of LOPSTR'92, Workshops in Computing, Springer-Verlag, pp. 151-167.
60. Gallagher, J. and Lafave, L. (1996) Regular approximations of computation paths in logic and functional languages. In: O. Danvy, R. Glück and P. Thiemann (eds.), Partial Evaluation, International Seminar, Dagstuhl Castle, Selected Papers, LNCS 1110, Springer-Verlag, pp. 115-136.
61. Gallagher, J. P. and Peralta, J. C. (2001) Regular tree languages as an abstract domain in program specialisation. Higher Order and Symbolic Computation, 14(2-3), 143-172.
62. Glenstrup, A. J. and Jones, N. D. (1996) BTA algorithms to ensure termination of off-line partial evaluation. In: D. Bjorner, M. Broy and I. V. Pottosin (eds.), Perspectives of System Informatics: Andrei Ershov Second International Memorial Conference, Proceedings, LNCS 1181, Springer-Verlag, pp. 273-284.
63. Glück, R. and Sorensen, M. H. (1994) Partial deduction and driving are equivalent. In: M. Hermenegildo and J. Penjam (eds.), Programming Language Implementation and Logic Programming, PLILP'94, Proceedings, LNCS 844, Springer-Verlag, pp. 165-181.
64. Glück, R. and Sorensen, M. H. (1996) A roadmap to supercompilation. In: O. Danvy, R. Glück and P. Thiemann (eds.), Partial Evaluation, International Seminar, Dagstuhl Castle, Selected Papers, LNCS 1110, Springer-Verlag, pp. 137-160.
65. Glück, R., Jørgensen, J., Martens, B. and Sørensen, M. H. (1996). Controlling conjunctive partial deduction of definite logic programs. In: H. Kuchen and S. Swierstra (eds.), Programming Languages: Implementations, Logics, and Programs, PLILP'96, Proceedings, LNCS 1140, Springer-Verlag, pp. 152-166.
66. Gurr, C. A. (1994a) A Self-Applicable Partial Evaluator for the Logic Programming Language Gödel. PhD thesis, Department of Computer Science, University of Bristol.
67. Gurr, C. A. (1994b) Specialising the ground representation in the logic programming language Gödel. In: Y. Deville (ed.), Logic Program Synthesis and Transformation, Proceedings of LOPSTR'93, Workshops in Computing, Springer-Verlag, pp. 124-140.
68. Hanus, M. (1994) The integration of functions into logic programming. J. Logic Programming, 19 & 20, 583-628.
69. Higman, G. (1952) Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc. 2, 326-336.
70. Holst, C. K. (1989) Syntactic currying: yet another approach to partial evaluation. Technical report, DIKU, Department of Computer Science, University of Copenhagen.
71. Holst, C. K. and Launchbury, J. (1992) Handwriting cogen to avoid problems with static typing. Working paper.
72. Huet, G. (1980) Confluent reductions: Abstract properties and applications to term rewriting systems. J. ACM, 27(4), 797-821.
73. Jaffar, J. and Maher, M. J. (1994) Constraint logic programming: A survey. J. Logic Program. 19 & 20, 503-581.
74. Jones, N. D. (1994) The essence of program transformation by partial evaluation and driving. In: N. D. Jones, M. Hagiya and M. Sato (eds.), Logic, Language and Computation, Festschrift in Honor of Satoru Takasu, LNCS 792, Springer-Verlag, pp. 206-224.
75. Jones, N. D. (1996) An introduction to partial evaluation. ACM Comput. Surv. 28(3), 480-503.
76. Jones, N. D. (1997) Combining abstract interpretation and partial evaluation. In: P. Van Hentenryck (ed.), Static Analysis, SAS'97, Proceedings, LNCS 1302, Springer-Verlag, pp. 396-405.
77. Jones, N. D., Gomard, C. K. and Sestoft, P. (1993) Partial Evaluation and Automatic Program Generation. Prentice Hall.
78. Jones, N. D., Sestoft, P. and Søndergaard, H. (1989) Mix: a self-applicable partial evaluator for experiments in compiler generation. LISP & Symbolic Computation, 2(1), 9-50.
79. Jørgensen, J. and Leuschel, M. (1996) Efficiently generating efficient generating extensions in Prolog. In: O. Danvy, R. Glück and P. Thiemann (eds.), Partial Evaluation, International Seminar, Dagstuhl Castle, Selected Papers, LNCS 1110, Springer-Verlag, pp. 238-262.
80. Jørgensen, J., Leuschel, M. and Martens, B. (1996) Conjunctive partial deduction in practice. In: J. Gallagher (ed.), Logic Programming Synthesis and Transformation, LOPSTR'96, Proceedings, LNCS 1207, Springer-Verlag, pp. 59-82.
81. Kleene, S. (1952) Introduction to Metamatheinatics. van Nostrand, Princeton, NJ.
82. Komorowski, J. (1982) Partial evaluation as a means for inferencing data structures in an applicative language: a theory and implementation in the case of Prolog. 9th Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 255-267.
83. Komorowski, J. (1992) An introduction to partial deduction. In: A. Pettorossi (ed.), Meta-Programming in Logic, META-92, Proceedings, LNCS 649, Springer-Verlag, pp. 49-69.
84. Kruskal, J. B. (1960) Well-quasi ordering, the tree theorem, and Vazsonyi's conjecture. Trans. Am. Math. Soc. 95, 210-225.
85. Lafave, L. and Gallagher, J. (1997) Constraint-based partial evaluation of rewriting-based functional logic programs. In: N. Fuchs (ed.), Logic Programming Synthesis and Transformation, LOPSTR'97, Proceedings, LNCS 1463, pp. 168-188.
86. Lassez, J.-L., Maher, M. and Marriott, K. (1988) Unification revisited. In: J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan-Kaufmann, pp. 587-625.
87. Leuschel, M. (1994) Partial evaluation of the "real thing". In: L. Fribourg and F. Turini (eds.), Logic Programming Synthesis and Transformation - Meta-Programming in Logic, LOPSTR'94 and META'94, Proceedings, LNCS 883, Springer-Verlag, pp. 122-137.
88. Leuschel, M. (1995) Ecological partial deduction: Preserving characteristic trees without constraints. In: M. Proietti (ed.), Logic Program Synthesis and Transformation, LOPSTR'95, Proceedings, LNCS 1048, Springer-Verlag, pp. 1-16.
89. Leuschel, M. (1996) The ECCE partial deduction system and the DPPD library of benchmarks. Obtainable via http://www.cs.kuleuven.ac.be/~dtai.
90. Leuschel, M. (1997) Advanced Techniques for Logic Program Specialisation. PhD thesis, K.U. Leuven. Accessible via http://www.ecs.soton.ac.uk/~mal.
91. Leuschel, M. (1998a) Improving homeomorphic embedding for online termination. In: P. Flener (ed.), Logic-Based Program Synthesis and Transformation, LOPSTR'98, Proceedings, LNCS 1559, Springer-Verlag, pp. 199-218.
92. Leuschel, M. (1998b) On the power of homeomorphic embedding for online termination. In: G. Levi (ed.), Static Analysis, SAS'98, Proceedings, LNCS 1503, Springer-Verlag, pp. 230-245.
93. Leuschel, M. (1998c) 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, pp. 220-234.
94. Leuschel, M. (1999b) Logic program specialisation. In: J. Hatcliff, T. Æ. Mogensen and P. Thiemann (eds.), Partial Evaluation: Practice and Theory, DIKU 1998 International Summer School, LNCS 1706, Springer-Verlag, pp. 155-188 and 271-292.
95. Leuschel, M. and De Schreye, D. (1995) Towards creating specialised integrity checks through partial evaluation of meta-interpreters. Proceedings PEPM'95, the ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, ACM Press, pp. 253-263.
96. Leuschel, M. and De Schreye, D. (1996) Logic program specialisation: How to be more specific. In: H. Kuchen and S. Swierstra (eds.), Programming Languages: Implementations, Logics, and Programs, PLILP'96, Proceedings, LNCS 1140, Springer-Verlag, pp. 137-151.
97. Leuschel, M. and De Schreye, D. (1998a) Constrained partial deduction and the preservation of characteristic trees. New Generat. Comput. 16, 283-342.
98. Leuschel, M. and De Schreye, D. (1998b) Creating specialised integrity checks through partial evaluation of meta-interpreters. J. Logic Program. 36(2), 149-193.
99. Leuschel, M. and Jørgensen, J. (1999) Efficient specialisation in prolog using the hand-written compiler generator Logen. Electr. Notes in Theor. Comput. Sci. 30(2).
100. Leuschel, M. and Lehmann, H. (2000a). Coverability of reset Petri nets and other well-structured transition systems by partial deduction, in J. Lloyd et al. (eds.), Computational Logic, CL 2000, Proceedings, LNAI 1861, Springer-Verlag, pp. 101-115.
101. Leuschel, M. and Lehmann, H. (2000b) Solving coverability problems of Petri nets by partial deduction. Proceedings of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, ACM Press, Montreal, Canada, pp. 268-279.
102. Leuschel, M. and Massart, T. (1999) Infinite state model checking by abstract interpretation and program specialisation. In: A. Bossi (ed.), Logic-Based Program Synthesis and Transformation, LOPSTR'99, Selected Papers. LNCS 1817, pp. 63-82.
103. Leuschel, M. and Sørensen, M. H. (1996) Redundant argument filtering of logic programs. In: J. Gallagher (ed.), Logic Programming Synthesis and Transformation, LOPSTR'96, Proceedings, LNCS 1207, Springer-Verlag, pp. 83-103. (Extended version as Technical Report CW 243, K.U. Leuven.)
104. Leuschel, M., De Schreye, D. and de Waal, A. (1996) 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, pp. 319-332.
105. Leuschel, M., Martens, B. and De Schreye, D. (1998a) Controlling generalisation and poly-variance in partial deduction of normal logic programs. ACM Trans. Program. Lang. Syst. 20(1), 208-258.
106. Leuschel, M., Martens, B. and Sagonas, K. (1998b) Preserving termination of tabled logic programs while unfolding. In: N. Fuchs (ed.), Logic Programming Synthesis and Transformation, LOPSTR'97, Proceedings, LNCS 1463, pp. 189-205.
107. Levi, G. and Sardu, G. (1988). Partial evaluation of metaprograms in a multiple worlds logic language. New Generat. Comput. 6(2 & 3), 227-247.
108. Lloyd, J. W. (1987) Foundations of Logic Programming. Springer-Verlag.
109. Lloyd, J. W. and Shepherdson, J. C. (1991) Partial evaluation in logic programming. J. Logic Program. 11(3& 4), 217-242.
110. Lüttringhaus-Kappel, S. (1993) Control generation for logic programs. In: D. S. Warren (ed.) Logic Programming, Proceedings of the Tenth International Conference on Logic Programming, MIT Press, pp. 478-495.
111. Marchiori, E. and Teusink, F. (1995) Proving termination of logic programs with delay declarations. In: J. Lloyd (ed.), Logic Programming, Proceedings 1995 International Symposium, MIT Press, Cambridge, pp. 447-464.
112. Marriott, K. and Stuckey, P. (1993) The 3 R's of optimizing constraint logic programs: Refinement, removal and reordering. Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM Press, pp. 334-344.
113. Martens, B. (1994) On the Semantics of Meta-Programming and the Control of Partial Deduction in Logic Programming. PhD thesis, K. U. Leuven.
114. Martens, B. and De Schreye, D. (1996) Automatic finite unfolding using well-founded measures. J. Logic Program. 28(2):, 89-146.
115. Martens, B. and Gallagher, J. (1995) Ensuring global termination of partial deduction while allowing flexible polyvariance. In: L. Sterling (ed.), Logic Programming, Proceedings 12th International Conference on Logic Programming, MIT Press, pp. 597-613.
116. Martens, B., De Schreye, D. and Horváth, T. (1994) Sound and complete partial deduction with unfolding based on well-founded measures. Theor. Comput. Sci. 122(1-2), 97-117.
117. Martin, J. (2000) Judgement Day: Terminating Logic Programs. PhD thesis, University of Southampton.
118. Martin, J. and King, A. (1997) Generating efficient, terminating logic programs. In: M. Bidoit and M. Dauchet (eds.), Theory and Practice of Software Development, TAPSOFT'97, Proceedings, LNCS 1214, Springer-Verlag, pp. 273-284.
119. Martin, J. and Leuschel, M. (1999) Sonic partial deduction. In: D. Bjorner, M. Broy and A. V. Zamulin (eds.), Perspectives of System Informatics, Third International Andrei Ershov Memorial Conference, PSI'99, Proceedings, LNCS 1755, Springer-Verlag, pp. 101-112.
120. Miniuissi, A. and Sherman, D. J. (1996) Squeezing intermediate construction in equational programs.'In: O. Danvy, R. Glück and P. Thiemann (eds.), Partial Evaluation, International Seminar, Dagstuhl Castle, Selected Papers, LNCS 1110, Springer-Verlag, pp. 284-302.
121. Mogensen, T. and Bondorf, A. (1992) Logimix: A self-applicable partial evaluator for Prolog. In: K.-K. Lau and T. Clement (eds.), Logic Program Synthesis and Transformation, Proceedings of LOPSTR'92, Workshops in Computing, Springer-Verlag, pp. 214-227.
122. Mogensen, T. and Sestoft, P. (1997) Partial evaluation. In: A. Kent and J. G. Williams (eds.), Encyclopedia of Computer Science and Technology, Marcel Decker, New York, pp. 247-279.
123. Naish, L. (1993) Coroutining and the construction of terminating logic programs. Australian Comput. Sci. Comm. 15(1), 181-190.
124. Neumann, G. (1990) Transforming interpreters into compilers by goal classification. In: M. Bruynooghe (ed.), Proceedings 2nd Workshop on Meta Programming in Logic, pp. 205-217.
125. Neumann, G. (1991) A simple transformation from Prolog-written metalevel interpreters into compilers and its implementation. In: A. Voronkov (ed.), Logic Programming, First Russian Conference on Logic Programming - Second Russian Conference on Logic Programming, Proceedings, LNCS 592, Springer-Verlag, pp. 349-360.
126. O'Keefe, R. (1985) On the treatment of cuts in Prolog source-level tools. Proceedings 1985 Symposium on Logic Programming, IEEE, pp. 68-72.
127. Owen, S. (1989) Issues in the partial evaluation of meta-interpreters. In: H. Abramson and M. Rogers (eds.), Meta-Programming in Logic Programming, Workshop on Meta-Programming in Logic, MIT Press, pp. 319-339.
128. Pettorossi, A. and Proietti, M. (1994) Transformation of logic programs: Foundations and techniques. J. Logic Program. 19& 20, 261-320.
129. Plotkin, G. D. (1969) A note on inductive generalisation. In: B. Meltzer and D. Michie (eds.), Machine Intelligence 5, Edinburgh University Press, pp. 153-163.
130. Prestwich, S. (1992a) The PADDY partial deduction system. Technical Report ECRC-92-6, ECRC, Munich, Germany.
131. Prestwich, S. (1992b) An unfold rule for full Prolog. In: K.-K. Lau and T. Clement (eds.), Logic Program Synthesis and Transformation. Proceedings LOPSTR'92, Workshops in Computing, Springer-Verlag, pp. 199-213.
132. Prestwich, S. (1993) Online partial deduction of large programs. Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM'93, ACM Press, pp. 111-118.
133. Proietti, M. and Pettorossi, A. (1991) Semantics preserving transformation rules for Prolog. Proceedings Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM'91, Sigplan Notices, 26(9), 274-284.
134. Proietti, M. and Pettorossi, A. (1991b) Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs. In: J. Małuszyński and M. Wirsing (eds.), Programming Language Implementation and Logic Programming, PLILP'91, Proceedings, LNCS 528, Springer-Verlag, pp. 347-358.
135. Proietti, M. and Pettorossi, A. (1993) The loop absorption and the generalization strategies for the development of logic programs and partial deduction. J. Logic Program. 16(1 & 2), 123-162.
136. Przymusinska, H., Przymusinski, T. C. and Seki, H. (1994) Soundness and completeness of partial deductions for well-founded semantics. In: A. Voronkov (ed.), Logic Programming and Automated Reasoning, LPAR'92, Proceedings, LNCS 624, Springer-Verlag, pp. 1-12.
137. Puebla, G. and Hermenegildo, M. (1996) Abstract specialization and its application to program parallelization. In: J. Gallagher (ed.), Logic Programming Synthesis and Transformation, LOPSTR'96, Proceedings, LNCS 1207, pp. 169-186.
138. Puebla, G., Gallagher, J. and Hermenegildo, M. (1997) Towards integrating partial evaluation in a specialization framework based on generic abstract interpretation. In: M. Leuschel (ed.), Proceedings ILPS'97 Workshop on Specialisation of Declarative Programs and its Application, K.U. Leuven, Technical Report CW 255, pp. 29-38.
139. Renault, S., Pettorossi, A. and Proietti, M. (1998) Design, Implementation, and Use of the MAP Transformation System. Technical Report R. 491, IASI-CNR, Roma, Italy.
140. Reynolds, J. C. (1969) Transformational systems and the algebraic structure of atomic formulas. In: B. Meltzer and D. Michie (eds.), Machine Intelligence 5, Edinburgh University Press, pp. 135-151.
141. Romanenko, S. A. (1988) A compiler generator produced by a self-applicable specializer can have a surprisingly natural and understandable structure. In: D. Bjørner, A. P. Ershov and N. D. Jones (eds.), Partial Evaluation and Mixed Computation, North-Holland, pp. 445-463.
142. Safra, S. and Shapiro, E. (1986) Meta interpreters for real. In: H.-J. Kugler (ed.), Information Processing 86, Proceedings IFIP 10th World Computer Congress, North-Holland, pp. 271-278.
143. Sagonas, K. and Leuschel, M. (1998) Extending partial deduction to tabled execution: Some results and open issues. ACM Comput. Surv. 30 (Electronic Symposium on partial evaluation).
144. Sahlin, D. (1991) An Automatic Partial Evaluator for Full Prolog. PhD thesis, Swedish Institute of Computer Science.
145. Sahlin, D. (1993) Mixtus: An automatic partial evaluator for full Prolog. New Generat. Comput. 12(1), 7-51.
146. Seki, H. (1993) Unfold/fold transformation of general programs for the well-founded semantics. J. Logic Program. 16, 5-23.
147. Smith, D. A. (1991) Partial evaluation of pattern matching in constraint logic programming languages. ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, Sigplan Notices, 26(9), 62-71.
148. Smith, D. A. and Mickey, T. (1990) Partial evaluation of a CLP language. In: S. Debray and M. Hermenegildo (eds.), Logic Programming, Proceedings 1990 North American Conference, MIT Press, pp. 119-138.
149. Somogyi, Z., Henderson, F. and Conway, T. (1996) The execution algorithm of Mercury: An efficient purely declarative logic programming language. J. Logic Program. 29(1-3), 17-64.
150. Sorensen, M. H. (1998) Convergence of program transformers in the metric space of trees. In: J. Jeuring (ed.) Mathematics of Program Construction, MPC'98, Proceedings, LNCS 1422, Springer-Verlag, pp. 315-337.
151. Sorensen, M. H. and Glück, R. (1995) An algorithm of generalization in positive supercompilation. In: J. W. Lloyd (ed.), Logic Programming, Proceedings of the 1995 International Symposium, MIT Press, Portland, OR, pp. 465-479.
152. Sørensen, M. H. and Glück, R. (1999) Introduction to supercompilation. In: J. Hatcliff, T. Æ. Mogensen and P. Thiemann (eds.), Partial Evaluation: Practice and Theory, DIKU 1998 International Summer School, LNCS 1706, Springer-Verlag, pp. 246-270.
153. SÆrensen, M. H., Glück, R. and Jones, N. D. (1996) A positive supercompiler. J. Functional Program. 6(6), 811-838.
154. Sterling, L. and Beer, R. D. (1989) Metainterpreters for expert system construction. J. Logic Program. 6(1 & 2), 163-178.
155. Takeuchi, A. and Furukawa, K. (1986) Partial evaluation of Prolog programs and its application to meta programming. In: H.-J. Kugler (ed.), Information Processing 86, Proceedings IFIP 10th World Computer Congress, North-Holland, pp. 415-420.
156. Tamaki, H._ and Sato, T. (1984) Unfold/fold transformations of logic programs. In: S.-Å. Tärnlund (ed.), Proceedings 2nd International Conference on Logic Programming, pp. 127-138.
157. Tamaki, H. and Sato, T. (1986) OLD resolution with tabulation. In: E. Shapiro (ed.), 3rd International Conference on Logic Programming, Proceedings, LNCS 225, Springer-Verlag, London, pp. 84-98.
158. Turchin, V. F. (1986) The concept of a supercompiler. ACM Trans. Program. Lang. Syst. 8(3), 292-325.
159. van Harmelen, F. (1989) The limitations of partial evaluation. In: P. Jackson and F. van Harmelen (eds.), Logic-Based Knowledge Representation, MIT Press, pp. 87-111.
160. Vanhoof, W. (2000) Binding-time analysis by constraint solving: a modular and higher-order approach for Mercury. In: M. Parigot and A. Voronkov (eds.), Logic for Programming and Automated Reasoning, LPAR 2000 Proceedings, LNAI 1955, Springer-Verlag, pp. 399-416.
161. Vanhoof, W. (2001) Techniques for On- and Off-line Specialisation of Logic Programs. PhD thesis, K. U. Leuven, Belgium.
162. Vanhoof, W. and Bruynooghe, M. (1999) Binding-time analysis for Mercury. In: D. De Schreye (ed.), Logic Programming: The 1999 International Conference, MIT Press, pp. 500-514.
163. Vanhoof, W. and Bruynooghe, M. (2001) Binding-time annotations without binding-time analysis. In: R. Nieuwenhuis and A. Voronkov (eds.), Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2001, Proceedings, LNAI 2250, Springer-Verlag, pp. 707-722.
164. Vanhoof, W. and Martens, B. (1997) To parse or not to parse. In: N. Fuchs (ed.), Logic Programming Synthesis and Transformation, LOPSTR'97, LNCS 1463, Leuven, Belgium, pp. 322-342.
165. Venken, R. (1984) A Prolog meta interpreter for partial evaluation and its application to source to source transformation and query optimization. In: T. O'Shea (ed.), Advances in Artificial Intelligence, Proceedings 6th European Conference on Artificial Intelligence, ECAI-84, North-Holland, pp. 91-100.
166. Venken, R. and Demoen, B. (1988) A partial evaluation system for Prolog: Theoretical and practical considerations. New Generat. Comput. 6(2 & 3), 279-290.
167. Whaley, R., Petitet, A. and Dongarra, J. (2001) Automated empirical optimizations of software and the atlas project. Parallel Comput. 27(1-2), 3-35.