Advanced logic program specialisation

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

Volumn 1706, Issue , 1999, Pages 271-292

  Leuschel, Michael ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84958621263     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47018-2_11     Document Type: Conference Paper

References (49)

1. 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.
2. A. Bossi and N. Coceo. Replacement can Preserve Termination. In J. Gallagher, editor, Logic Program Synthesis and Transformation. Proceedings of LOPSTR'96, LNCS 1207, pages 104-129, Stockholm, Sweden, August 1996. Springer-Verlag.
3. A. Bossi, N. Coceo and S Etalle. Transformation of Left Terminating Programs: The Reordering Problem. In M. Proietti, editor, Logic Program Synthesis and Transformation. Proceedings of LOPSTR'95, LNCS 1048, pages 33-45, Utrecht, Netherlands, September 1995. Springer-Verlag.
4. M. Bruynooghe. A practical framework for the abstract interpretation of logic programs. The Journal of Logic Programming, 10:91-124, 1991.
5. W.-N. Chin. Towards an automated tupling strategy. In Proceedings of PEPM'93, the ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 119-132. ACM Press, 1993.
6. W.-N. Chin and S.-C. Khoo. Tupling functions with multiple recursion parameters. In Proceedings of the Third International Workshop on Static Analysis, number 724 in LNCS 724, pages 124-140, Padova, Italy, Sept. 1993. Springer-Verlag.
7. C. Consel and S. C. Khoo. Parameterized partial evaluation. ACM Transactions on Programming Languages and Systems, 15(3):463-493, 1993.
8. P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. The Journal of Logic Programming, 13(23):103-179, 1992.
9. D. De Schreye, R. Gliick, J. J0rgensen, M. Leuschel, B. Martens, and M. H. Sorensen. Conjunctive partial deduction: Foundations, control, algorithms and experiments. The Journal of Logic Programming, 1999. To appear.
10. D. A. de Waal and J. Gallagher. Specialisation of a unification algorithm. In T. Clement and K.-K. Lau, editors, Logic Program Synthesis and Transformation. Proceedings of LOPSTR'91, pages 205-220, Manchester, UK, 1991.
11. D. A. de Waal and J. Gallagher. The applicability of logic program analysis and transformation to theorem proving. In A. Bundy, editor, Automated Deduction-CADE-12, pages 207-221. Springer-Verlag, 1994.
12. J. Gallagher. A system for specialising logic programs. Technical Report TR-91-32, University of Bristol, November 1991.
13. J. Gallagher and M. Bruynooghe. The derivation of an algorithm for program specialisation. New Generation Computing, 9(34):305-333, 1991.
14. J. Gallagher and D. A. de Waal. Deletion of redundant unary type predicates from logic programs. In K.-K. Lau and T. Clement, editors, Logic Program Synthesis and Transformation. Proceedings of LOPSTR'92, pages 151-167, Manchester, UK, 1992.
15. J. Gallagher and D. A. de Waal. Fast and precise regular approximations of logic programs. In P. Van Hentenryck, editor, Proceedings of the Eleventh International Conference on Logic Programming, pages 599-613. The MIT Press, 1994.
16. R. Gliick and J. J0rgensen. Generating transformers for deforestation and super-compilation. In B. Le Charlier, editor, Proceedings of SAS'9Ą, LNCS 864, pages 432-448, Namur, Belgium, September 1994. Springer-Verlag.
17. R. Gliick, J. J0rgensen, B. Martens, and M. H. S0rensen. Controlling conjunctive partial deduction of definite logic programs. In H. Kuchen and S. Swierstra, editors, Proceedings of the International Symposium on Programming Languages, Implementations, Logics and Programs (PLILP'96), LNCS 1140, pages 152-166, Aachen, Germany, September 1996. Springer-Verlag.
18. R. Gliick and M. H. S0rensen. Partial deduction and driving are equivalent. In M. Hermenegildo and J. Penjam, editors, Programming Language Implementation and Logic Programming. Proceedings, Proceedings of PLILP'94, LNCS 844, pages 165-181, Madrid, Spain, 1994. Springer-Verlag.
19. R. Gliick and M. H. S0rensen. A roadmap to supercompilation. In O. Danvy, R. Gliick, and P. Thiemann, editors, Proceedings of the 1996 Dagstuhl Seminar on Partial Evaluation, LNCS 1110, pages 137-160, Schlofi Dagstuhl, 1996. Springer-Verlag.
20. 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.
21. J. Jaffar and M. J. Maher. Constraint logic programming: A survey. The Journal of Logic Programming 20:503-581, 1994.
22. G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. The Journal of Logic Programming, 13(23):205-258, 1992.
23. N. D. Jones. Combining abstract interpretation and partial evaluation. In P. Van Hentenryck, editor, Static Analysis, Proceedings of SAS'97, LNCS 1302, pages 396-405, Paris, 1997. Springer-Verlag.
24. J. J0rgensen, M. Leuschel, and B. Martens. Conjunctive partial deduction in practice. In J. Gallagher, editor, Proceedings of the International Workshop on Logic Program Synthesis and Transformation (LOPSTR'96), LNCS 1207, pages 59-82, Stockholm, Sweden, August 1996. Springer-Verlag.
25. 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, The Netherlands, September 1995. Springer-Verlag.
26. M. Leuschel. The ecce partial deduction system and the dppd library of benchmarks. Obtainable via http://www.cs.kuleuven.ac.be/~dtai, 1996.
27. M. Leuschel. Advanced Techniques for Logic Program Specialisation. PhD thesis, K.U. Leuven, May 1997. Accessible via http://www.es.kuleuven.ac.be/~michael.
28. M. Leuschel. Logic Program Specialisation. In J. Hatcliff, T. Mogensen, and P. Thiemann, editors, DIKU 1998 International Summerschool on Partial Evaluation, LNCS 1706, pages 155-188, Copenhagen, Denmark, July 1998. Springer-Verlag. In this volume.
29. M. Leuschel. Program specialisation and abstract interpretation reconciled. In J. Jaffar, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming JICSLP'98, pages 220-234, Manchester, UK, June 1998. MIT Press.
30. M. Leuschel and D. De Schreye. Logic program specialisation: How to be more specific. In H. Kuchen and S. Swierstra, editors, Proceedings of the International Symposium on Programming Languages, Implementations, Logics and Programs (PLILP'96), LNCS 1140, pages 137-151, Aachen, Germany, September 1996. Springer-Verlag.
31. M. Leuschel and D. De Schreye. Constrained partial deduction and the preservation of characteristic trees. New Generation Computing, 16(3):283-342, 1998.
32. M. Leuschel, D. De Schreye, and A. Waal. A conceptual embedding of folding into partial deduction: Towards a maximal integration. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming JICSLP'96, pages 319-332, Bonn, Germany, September 1996. MIT Press.
33. M. Leuschel, B. Martens, and D. De Schreye. Controlling generalisation and poly-variance in partial deduction of normal logic programs. ACM Transactions on Programming Languages and Systems, 20(l):208-258, January 1998.
34. M. Leuschel and M. H. Sprensen. Redundant argument filtering of logic programs. In J. Gallagher, editor, Proceedings of the International Workshop on Logic Program Synthesis and Transformation (LOPSTR'96), LNCS 1207, pages 83-103, Stockholm, Sweden, August 1996. Springer-Verlag.
35. J. W. Lloyd and J. C. Shepherdson. Partial evaluation in logic programming. The Journal of Logic Programming, 11(34):217-242, 1991.
36. K. Marriott, L. Naish, and J.-L. Letssez. Most specific logic programs. Annals of Mathematics and Artificial Intelligence, 1:303-338, 1990.
37. A. Mulkers, W. Winsborough, M. Bruynooghe. Live-structure data-flow analysis for prolog. ACM Transactions on Programming Languages and Systems, 16(2):205-258, 1994.
38. S. Owen. Issues in the p2irtial evaluation of meta-interpreters. In H. Abramson and M. Rogers, editors, Meta-Programm,ing in Logic Programming, Proceedings of the Meta88 Workshop, June 1988, pages 319-339. MIT Press, 1989.
39. A. Pettorossi and M. Proietti. Transformation of logic programs: Foundations and techniques. The Journal of Logic Programming, 20:261-320, May 1994.
40. G. Puebia, J. Gallagher, and M. Hermenegildo. Towards integrating partial evaluation in a specialization fi-amework beised on generic abstract interpretation. In M. Leuschel, editor. Proceedings of the ILPS'97 Workshop on Specialisation of Declarative Programs and its Application, K.U. Leuven, Tech. Rep. CW 255, pages 29-38, Port Jefferson, USA, October 1997.
41. G. Puebia and M. Hermenegildo. Abstract specieilization and its application to program parallelization. In J. Gallagher, editor. Proceedings of the International Workshop on Logic Program Synthesis and Transformation (LOPSTR'96), LNCS 1207, pages 169-186, Stockholm, Sweden, August 1996.
42. M. H. S0rensen and R. Gliick. Introduction to Supercompilation. In J. Hatcliff, T. Mogensen, and P. Thiemann, editors, DIKU 1998 International Summerscho olon Partial Evaluation, LNCS 1706, pages 246-270, Copenhagen, Denmark, July 1998. Springer-Verlag. In this volum,e.
43. M. H. S0rensen, R. Gliick, and N. D. Jones. A positive supercompiler. Journal of Functional Program,ming, 6(6):811-838, 1996.
44. V. F. Turchin. The concept of a supercompiler. ACM Transactions on Programm. ing Languages and System,s, 8(3):292-325, 1986.
45. V. F. Turchin. Program transformation with metasystem transitions. Journal of Functional Programming, 3(3):283-313, 1993.
46. V. F. Turchin. Metacomputation: MetJisystem transitions plus supercompilation. In O. Danvy, R. Gliick, and P. Thiemann, editors, Proceedings of the 1996 Dagstuhl Seminar on Partial Evaluation, LNCS 1110, pages 482-509, Schlofi Dagstuhl, 1996. Springer-Verlag.
47. W. Vanhoof. Bottom-up information propagation for partial deduction. In M. Leuschel, editor. Proceedings of the ILPS'97 Workshop on Specialisation of Declarative Programs and its Application, K.U. Leuven, Tech. Rep. CW 255, pages 73-82, Port Jefferson, USA, October 1997.
48. W. Vanhoof, B. Martens, D. De Schreye, and K. De Vlaminck. Specialising the other way Mound. In J. JaSax, editor. Proceedings of the Joint International Conference and Symposium on Logic Program,ming JICSLP'98, Manchester, UK, June 1998. MIT Press.
49. P. Wadler. Deforestation: Transforming progrsims to eliminate intermediate trees. Theoretical Computer Science, 73:231-248, 1990. Preliminary version in ESOP'88, LNCS 300.