Efficiently generating efficient generating extensions in prolog

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1110, Issue , 1996, Pages 238-262

  Jørgensen, Jesper ^a   Leuschel, Michael ^a  

^a Department of Computer Science ^*  (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; LOGIC PROGRAMMING;

COGEN APPROACH; COMPILER GENERATORS; IMPERATIVE LANGUAGES; PARTIAL DEDUCTION; PARTIAL EVALUATION; SPECIALISATION;

PROGRAM COMPILERS;

EID: 84957654264     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61580-6_12     Document Type: Conference Paper

References (47)

1. L. 0. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, University of Copenhagen, May 1994. (DIKU report 94/19).
2. L. Beckman, A. Haraldson, O. Oskarsson, and E. Sandewall. A partial evaluator and its use as a programming tool. Artificial Intelligence, 7:319-357, 1976.
3. K. Benkerimi and P. M. Hill. Supporting transformations for the partial evaluation of logic programs. Journal of Logic and Computation, 3(5):469-486, October 1993.
4. K. Benkerimi and J. W. Lloyd. A partial evaluation procedure for logic programs. In S. Debray and M. Hermenegildo, editors, Proceedings of the North American Conference on Logic Programming, pages 343-358. MIT Press, 1990.
5. L. Birkedal and M. Welinder. Hand-writing program generator generators. In M. Hermenegildo and J. Penjam, editors, Programming Language Implementation and Logic Programming. Proceedings, volume 844 of LNCS, pages 198-214, Madrid, Spain, 1994. Springer-Verlag.
6. R. Bol. Loop checking in partial deduction. Journal of Logic Programming, 16(1&2):25-46, 1993.
7. A. Bondorf, F. Frauendorf, and M. Richter. An experiment in automatic self-applicable partial evaluation of prolog. Technical Report 335, Lehrstuhl Informatik V, University of Dortmund, 1990.
8. A. F. Bowers and C. A. Gurr. Towards fast and declarative meta-programming. In K. R. Apt and F. Turini, editors, Meta-logics and Logic Programming, pages 137-166. MIT Press, 1995.
9. M. Bruynooghe, D. De Schreye, and B. Martens. A general criterion for avoiding infinite unfolding during partial deduction. New Generation Computing, 11(1):4779, 1992.
10. C. Consel and 0. Danvy. Tutorial notes on partial evaluation. In Proceedings of POPL'93, Charleston, South Carolina, January 1993. ACM Press.
11. H. Fujita and K. Furukawa. A self-applicable partial evaluator and its use in incremental compilation. New Generation Computing, 6(2 & 3):91-118, 1988.
12. J. Gallagher. A system for specialising logic programs. Technical Report TR-91-32, University of Bristol, November 1991.
13. J. Gallagher. Tutorial on specialisation of logic programs. In Proceedings of PEPM'93, the ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 88-98. ACM Press, 1993.
14. J. Gallagher and M. Bruynooghe. Some low-level transformations for logic programs. In M. Bruynooghe, editor, Proceedings of Meta90 Workshop on Meta Programming in Logic, pages 229-244, Leuven, Belgium, 1990.
15. J. Gallagher and M. Bruynooghe. The derivation of an algorithm for program specialisation. New Generation Computing, 9(3 & 4):305-333, 1991.
16. R. Glick and J. Jorgensen. Efficient multi-level generating extensions for program specialisation. In Programming Languages, Implementations, Logics and Programs (PLILP'95), LNCS 982, pages 259-278. Springer-Verlag, 1995.
17. R. Gliick, J. Jorgensen, B. Martens, and M. SOrensen. Controlling conjunctive partial deduction of definite logic programs. Technical Report CW 226, Departement Computerwetenschappen, K.U. Leuven, Belgium, February 1996. Submitted.
18. C. A. Gurr. A Self-Applicable Partial Evaluator for the Logic Programming Language G5del. PhD thesis, Department of Computer Science, University of Bristol, January 1994.
19. M. Hermenegildo, R. Warren, and S. K. Debray. Global flow analysis as a practical compilation tool. The Journal of Logic Programming, 13(4):349-366, 1992.
20. P. Hill and J. Gallagher. Meta-programming in logic programming. Technical Report 94.22, School of Computer Studies, University of Leeds, 1994. To be published in Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 5. Oxford Science Publications, Oxford University Press.
21. C. K. Holst. Syntactic currying: yet another approach to partial evaluation. Technical report, DIKU, Department of Computer Science, University of Copenhagen, 1989.
22. C. K. Hoist and J. Launchbury. Handwriting cogen to avoid problems with static typing. Working paper, 1992.
23. N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993.
24. N. D. Jones, P. Sestoft, and H. Sondergaard. Mix: a self-applicable partial eval-uator for experiments in compiler generation. LISP and Symbolic Computation, 2(1):9-50, 1989.
25. t, efficient generating extensions in Prolog. Technical Report CW 221, K.U. Leuven, Belgium, February 1996. Accessible via http://www.ca.kuleuven.ac.berapai.
26. J. Komorowski. An introduction to partial deduction. In A. Pettorossi, editor, Proceedings Meta'92, pages 49-69. Springer-Verlag, LNCS 649, 1992.
27. J. Launchbury. Projection Factorisations in Partial Evaluation. Distinguished Dissertations in Computer Science. Cambridge University Press, 1991.
28. M. Leuschel. Partial evaluation of the "real thing". In L. Fribourg and F. Turini, editors, Logic Program Synthesis and Transformation — Meta-Programming in Logic. Proceedings of LOPSTR'94 and META'94, LNCS 883, pages 122-137, Pisa, Italy, June 1994. Springer-Verlag.
29. M. Leuschel. Ecological partial deduction: Preserving characteristic trees without constraints. In M. Proietti, editor, Logic Program Synthesis and Transformation. Proceedings of LOPSTR'95, LNCS 1048, pages 1-16, Utrecht, Netherlands, September 1995. Springer-Verlag.
30. -lpai.
31. M. Leuschel and D. De Schreye. Towards creating specialised integrity checks through partial evaluation of meta-interpreters. In Proceedings of PEPM'95, the ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 253-263, La Jolla, California, June 1995. ACM Press.
32. M. Leuschel, D. De Schreye, and A. de Waal. A conceptual embedding of folding into partial deduction: Towards a maximal integration. Technical Report CW 225, Departement Computerwetenschappen, K.U. Leuven, Belgium, February 1996. Submitted.
33. M. Leuschel and B. Martens. Global control for partial deduction through characteristic atoms and global trees. In this volume.
34. -lpai.
35. J. Lloyd. Foundations of Logic Programming. Springer Verlag, 1987.
36. J. W. Lloyd and J. C. Shepherdson. Partial evaluation in logic programming. The Journal of Logic Programming, 11:217-242, 1991.
37. B. Martens and D. De Schreye. Automatic finite unfolding using well-founded measures. Journal of Logic Programming, 1995. To Appear.
38. B. Martens and J. Gallagher. Ensuring global termination of partial deduction while allowing flexible polyvariance. In L. Sterling, editor, Proceedings ICLP'95, pages 597-613, Kanagawa, Japan, June 1995. MIT Press.
39. T. Mogensen and A. Bondorf. Logimix: A self-applicable partial evaluator for Prolog. In K.-K. Lau and T. Clement, editors, Logic Program Synthesis and Transformation. Proceedings of LOPSTR'92, pages 214-227. Springer-Verlag, 1992.
40. G. Neumann. Transforming interpreters into compilers by goal classification. In M. Bruynooghe, editor, Proceedings of Meta90 Workshop on Meta Programming in Logic, pages 205-217, Leuven, Belgium, 1990.
41. G. Neumann. A simple transformation from Prolog-written metalevel interpreters into compilers and its implementation. In A. Voronkov, editor, Logic Programming. Proceedings of the First and Second Russian Conference on Logic Programming, LNCS 592, pages 349-360. Springer-Verlag, 1991.
42. A. Pettorossi and M. Proietti. Transformation of logic programs: Foundations and techniques. The Journal of Logic Programming, 19 & 20:261-320, May 1994.
43. S. Prestwich. The PADDY partial deduction system. Technical Report ECRC-92-6, ECRC, Munich, Germany, 1992.
44. S. A. Romanenko. A compiler generator produced by a self-applicable special-iiser can have a surprisingly natural and understandable structure. In D. Bjorner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 445-463. North-Holland, 1988.
45. D. Sahlin. Mixtus: An automatic partial evaluator for full Prolog. Nem Generation Computing, 12(1):7-51, 1993.
46. M. Sorensen and R. Gliick. An algorithm of generalization in positive supercom-pilation. In J. Lloyd, editor, Proceedings of ILPS'95, the International Logic Programming Symposium, pages 465-479, Portland, USA, December 1995. MIT Press.
47. V. Turchin. The concept of a supercompiler. ACM Transactions on Programming Languages and Systems, 8(3):292-325, 1986.