Offline specialisation in Prolog using a hand-written compiler generator

Theory and Practice of Logic Programming

Volumn 4, Issue 1-2, 2004, Pages 139-191

  Leuschel, Michael ^a   Jørgensen, Jesper ^b   Vanhoof, Wim ^c   Bruynooghe, Maurice ^c  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b UNIVERSITY OF COPENHAGEN   (Denmark)

^c UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Abstract interpretation; Compiler generation; Partial deduction; Partial evaluation; Program specialisation

Indexed keywords

CODES (SYMBOLS); FORMAL LOGIC; FUNCTION EVALUATION; LOGIC PROGRAMMING; PROGRAM COMPILERS;

ABSTRACT INTERPRETATION; COMPILER GENERATION; PARTIAL DEDUCTION; PARTIAL EVALUATION; PROGRAM SPECIALIZATION;

PROLOG (PROGRAMMING LANGUAGE);

EID: 2142640335     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/s1471068403001662     Document Type: Article

References (73)

1. Andersen, L. O. (1994) Program Analysis and Specialization for the C Programming Language, PhD thesis, DIKU, University of Copenhagen. (DIKU report 94/19).
2. Apt, K. R. and Marchiori, E. (1994) Reasoning about Prolog programs: from modes through types to assertions. Formal Aspects of Computing, 6(6A), 743-765.
3. Beckman, L., Haraldson, A., Oskarsson, Ö. and Sandewall, E. (1976) A partial evaluator and its use as a programming tool. Artificial Intelligence, 7, 319-357.
4. Benkerimi, K. and Hill, P. M. (1993) Supporting transformations for the partial evaluation of logic programs. Journal of Logic and Computation, 3(5), 469-486.
5. Birkedal, L. and Welinder, M. (1994) Hand-writing program generator generators. In: M. Hermenegildo and J. Penjam (eds.), Programming Language Implementation and Logic Programming. Proceedings, Proceedings of PLILP'91, LNCS 844, Springer-Verlag, Madrid, Spain, pp. 198-214.
6. Bol, R. (1993) Loop checking in partial deduction. Journal of Logic Programming, 16(1 & 2), 25-46.
7. Bondorf, A. and Jørgensen, J. (1993) Efficient analyses for realistic off-line partial evaluation. Journal of Functional Programming, 3(3), 315-346.
8. Bondorf, A., Frauendorf, F. and Richter, M. (1990) An experiment in automatic self-applicable partial evaluation of Prolog. Technical Report 335, Lehrstuhl Informatik V, University of Dortmund.
9. Bruynooghe, M., De Schreye, D. and Martens, B. (1992) A general criterion for avoiding infinite unfolding during partial deduction. New Generation Computing, 11(1), 47-79.
10. 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, Proc. of ESOP'98, part of ETAPS'98, LNCS 1381, Springer-Verlag, Lisbon, Portugal, pp. 27-41.
11. Chen, W., Kifer, M. and Warren, D. S. (1989) A first-order semantics of higher-order logic programming constructs. In: E. L. Lusk and R. A. Overbeek (eds.), Logic Programming: Proceedings of the North American Conference, MIT Press, pp. 1090-1114.
12. Codish, M. and Demoen, B. (1995) Analyzing logic programs using "prop"-ositional logic programs and a magic wand. Journal of Logic Programming, 25(3), 249-274.
13. Codish, M. and Taboch, C. (1999) A semantic basis for the termination analysis of logic programs. Journal of Logic Programming, 41(1), 103-123.
14. Consel, C. (1993) Polyvariant binding-time analysis for applicative languages. PEPM93, ACM, pp. 66-77.
15. Consel, C. and Danvy, O. (1993) Tutorial notes on partial evaluation, Proceedings of ACM Symposium on Principles of Programming Languages (POPL'93), ACM Press, Charleston, SC, pp. 493-501.
16. Cosmadopoulos, Y., Sergot, M. and Southwick, R. W. (1991) Data-driven transformation of meta-interpreters: A sketch. In: H. Boley and M. M. Richter (eds.), Proceedings of the International Workshop on Processing Declarative Knowledge (PDK'91), LNAI 567, Springer-Verlag, Kaiserslautern, pp. 301-308.
17. 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. Journal of Logic Programming, 41(2 & 3), 231-277.
18. Fujita, H. and Furukawa, K. (1988) A self-applicable partial evaluator and its use in incremental compilation. New Generation Computing, 6(2 & 3), 91-118.
19. Futamura, Y. (1971) Partial evaluation of a computation process - an approach to a compiler-compiler. Systems, Computers, Controls, 2(5), 45-50.
20. Gallagher, J. (1991) A system for specialising logic programs. Technical Report TR-91-32, University of Bristol.
21. Gallagher, J. (1993) Tutorial on specialisation of logic programs. Proceedings of PEPM'93, the ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, ACM Press, pp. 88-98.
22. Gallagher, J. and Bruynooghe, M. (1990) Some low-level transformations for logic programs. In: M. Bruynooghe (ed.), Proceedings of Meta90 Workshop on Meta Programming in Logic, Leuven, Belgium, pp. 229-244.
23. Gallagher, J. and Bruynooghe, M. (1991) The derivation of an algorithm for program specialisation. New Generation Computing, 9(3 & 4), 305-333.
24. 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, LNCS 1110, Springer-Verlag, Schloß Dagstuhl, pp. 115-136.
25. Genaim, S., Codish, M., Gallagher, J. and Lagoon, V. (2002) Combining norms to prove termination. In: T. Cortesi (ed.), Verification, Model Checking and Abstract Interpretation, VMCAI2002, Revised Papers, LNCS 2294, Springer-Verlag, pp. 126-138.
26. Glück, R. and Jørgensen, J. (1995) Efficient multi-level generating extensions for program specialization. In: S. Swierstra and M. Hermenegildo (eds.), Programming Languages, Implementations, Logics and Programs (PLILP'95), LNCS 982, Springer-Verlag, Utrecht, The Netherlands, pp. 259-278.
27. Glück, R. and Sørensen, M. H. (1994) Partial deduction and driving are equivalent. In: M. Hermenegildo and J. Penjam (eds.), Programming Language Implementation and Logic Programming. Proceedings, Proceedings of PLILP'94, LNCS 844, Springer-Verlag, Madrid, Spain, pp. 165-181.
28. 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.), Proceedings of PLILP'96, LNCS 1140, Springer-Verlag, Aachen, Germany, pp. 152-166.
29. Gurr, C. A. (1994) A Self-Applicable Partial Evaluator for the Logic Programming Language Gödel. PhD thesis, Department of Computer Science, University of Bristol.
30. Helsen, S. and Thiemann, P. (2000) Fragmental specialization. In: W. Taha (ed.), Proceedings of SAIG'00, LNCS 1924, Springer-Verlag, pp. 51-71.
31. Hermenegildo, M., Warren, R. and Debray, S. K. (1992) Global flow analysis as a practical compilation tool. Journal of Logic Programming, 13(4), 349-366.
32. Hill, P. and Gallagher, J. (1998) Meta-programming in logic programming. In: D. M. Gabbay, C. J. Hogger and J. A. Robinson (eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 5, Oxford Science Publications, Oxford University Press, pp. 421-497.
33. Hill, P. and Lloyd, J. W. (1994) The Gödel Programming Language, MIT Press.
34. Holst, C. K. (1989) Syntactic currying: yet another approach to partial evaluation. Technical report, DIKU, Department of Computer Science, University of Copenhagen.
35. Holst, C. K. and Launchbury, J. (1991) Handwriting cogen to avoid problems with static typing, Draft Proceedings, Fourth Annual Glasgow Workshop on Functional Programming, Skye, Scotland, Glasgow University, pp. 210-218.
36. Jones, N. D., Gomard, C. K. and Sestoft, P. (1993) Partial Evaluation and Automatic Program Generation, Prentice Hall.
37. Jones, N. D., Sestoft, P. and Søndergaard, H. (1989) Mix: a self-applicable partial evaluator for experiments in compiler generation, LISP and Symbolic Computation, 2(1), 9-50.
38. 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, LNCS 1110, Springer-Verlag, Schloß Dagstuhl, pp. 238-262.
39. Komorowski, J. (1992) An introduction to partial deduction. In: A. Pettorossi (ed.), Proceedings Meta'92, LNCS 649, Springer-Verlag, pp. 49-69.
40. Launchbury, J. (1991) Projection Factorisations in Partial Evaluation, Distinguished Dissertations in Computer Science, Cambridge University Press.
41. Leuschel, M. (1996-2000) The ECCE partial deduction system and the DPPD library of benchmarks. Obtainable via http://www.ecs.soton.ac.uk/~mal.
42. Leuschel, M. and Bruynooghe, M. (2002) Logic program specialisation through partial deduction: Control issues. Theory and Practice of Logic Programming, 2(4 & 5), 461-515.
43. Leuschel, M. and De Schreye, D. (1998) Constrained partial deduction and the preservation of characteristic trees. New Generation Computing, 16, 283-342.
44. Leuschel, M. and Lehmann, H. (2000) Solving coverability problems of Petri nets by partial deduction. In: M. Gabbrielli and F. Pfenning (eds.), Proceedings of PPDP'2000, ACM Press, Montreal, Canada, pp. 268-279.
45. Leuschel, M. and Sørensen, M. H. (1996) Redundant argument filtering of logic programs. In: J. Gallagher (ed.), Logic Program Synthesis and Transformation. Proceedings of LOPSTR'96, LNCS 1207, Springer-Verlag, Stockholm, Sweden, pp. 83-103.
46. 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, Bonn, Germany, pp. 319-332.
47. Leuschel, M., Martens, B. and De Schreye, D. (1998) Controlling generalisation and polyvariance in partial deduction of normal logic programs. ACM Trans. on Programming Languages and Systems, 20(1), 208-258.
48. Lloyd, J. W. (1987) Foundations of Logic Programming, Springer-Verlag.
49. Lloyd, J. W. and Shepherdson, J. C. (1991) Partial evaluation in logic programming. Journal of Logic Programming, 11(3 & 4), 217-242.
50. Martens, B. and De Schreye, D. (1995) Two semantics for definite meta-programs, using the non-ground representation. In: K. R. Apt and F. Turini (eds.), Meta-logics and Logic Programming, MIT Press, pp. 57-82.
51. Martens, B. and De Schreye, D. (1996) Automatic finite unfolding using well-founded measures. Journal of Logic Programming, 28(2), 89-146.
52. Martens, B. and Gallagher, J. (1995) Ensuring global termination of partial deduction while allowing flexible polyvariance. In: L. Sterling (ed.), Proceedings ICLP'95, MIT Press, Kanagawa, Japan, pp. 597-613.
53. Martin, J. and Leuschel, M. (1999) Sonic partial deduction. Proceedings of the Third International Ershov Conference on Perspectives of System Informatics, LNCS 1755, Springer-Verlag, Novosibirsk, Russia, pp. 101-112.
54. 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, Springer-Verlag, pp. 214-227.
55. Neumann, G. (1990) Transforming interpreters into compilers by goal classification. In: M. Bruynooghe (ed.), Proceedings of Meta90 Workshop on Meta Programming in Logic, Leuven, Belgium, pp. 205-217.
56. Neumann, G. (1991) A simple transformation from Prolog-written metalevel interpreters into compilers and its implementation. In: A. Voronkov (ed.), Logic Programming. Proceedings of the First and Second Russian Conference on Logic Programming, LNCS 592, Springer-Verlag, pp. 349-360.
57. Pettorossi, A. and Proietti, M. (1994) Transformation of logic programs: Foundations and techniques. The Journal of Logic Programming, 19 & 20, 261-320.
58. Prestwich, S. (1992) The PADDY partial deduction system. Technical Report ECRC-92-6, ECRC, Munich, Germany.
59. 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.
60. Sahlin, D. (1993) Mixtus: An automatic partial evaluator for full Prolog. New Generation Computing, 12(1), 7-51.
61. Somogyi, Z., Henderson, F. and Conway, T. (1996) The execution algorithm of Mercury: An efficient purely declarative logic programming language. The Journal of Logic Programming, 29(1-3), 17-64.
62. Sørensen, M. H. and Glück, R. (1995) An algorithm of generalization in positive supercompilation. In: J. W. Lloyd (ed.), Proceedings of ILPS'95, the International Logic Programming Symposium, MIT Press, Portland, USA, pp. 465-479.
63. 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, LNCS 1706, Springer-Verlag, Copenhagen, Denmark, pp. 246-270.
64. Sterling, L. and Shapiro, E. (1986) The Art of Prolog, MIT Press.
65. Tarau, P. and De Bosschere, K. (1994) Memoing techniques for logic programs. In: Y. Deville (ed.), Logic Program Synthesis and Transformation. Proceedings of LOPSTR'93, Workshops in Computing, Springer-Verlag, Louvain-La-Neuve, Belgium, pp. 196-209.
66. Thiemann, P. (1996) Cogen in six lines. International Conference on Functional Programming, ACM Press, pp. 180-189.
67. Turchin, V. F. (1986) The concept of a supercompiler. ACM Trans. on Programming Languages and Systems, 8(3), 292-325.
68. Vanhoof, W. (2000) Binding-time analysis by constraint solving: a modular and higher-order approach for mercury. In: M. Parigot and A. Voronkov (eds.), Proceedings of LPAR'2000, LNAI 1955, Springer-Verlag, pp. 399-416.
69. 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, 8th International Conference, Proceedings, LNAI 2250, Springer-Verlag, pp. 707-722.
70. Vanhoof, W. and Bruynooghe, M. (2002) When size does matter - Termination analysis for typed logic programs. In: A. Pettorossi (ed.), Logic-based Program Synthesis and Transformation, Proceedings of LOPSTR 2001, LNCS 2372, Springer-Verlag, pp. 129-147.
71. Vanhoof, W. and Martens, B. (1997) To parse or not to parse. In: N. Fuchs (ed.), Logic Program Synthesis and Transformation. Proceedings of LOPSTR'97, LNCS 1463, Leuven, Belgium, pp. 322-342.
72. Venken, R. and Demoen, B. (1988) A partial evaluation system for Prolog: Theoretical and practical considerations. New Generation Computing, 6(2 & 3), 279-290.
73. Yardeni, E., Frühwirth, T. and Shapiro, E. (1992) Polymorphically typed logic programs. In: F. Pfenning (ed.), Types in Logic Programming, MIT Press, pp. 63-90.