Logic program specialisation: How to be more specific

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

Volumn 1140, Issue , 1996, Pages 137-151

  Leuschel, Michael ^a   De Schreye, Danny ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTATIONAL LINGUISTICS; MODEL CHECKING;

ABSTRACT INTERPRETATION TECHNIQUES; ABSTRACT INTERPRETATIONS; ADVANCED APPLICATIONS; LOGIC PROGRAMS; PARTIAL DEDUCTION; PROGRAM CONSTRUCTION; SPECIALISATION; TOPDOWN;

LOGIC PROGRAMMING;

EID: 84957653750     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61756-6_82     Document Type: Conference Paper

References (21)

1. M. Bruynooghe. A practical framework for the abstract interpretation of logic programs. The Journal of Logic Programming, 10:91-124, 1991.
2. P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. The Journal of Logic Programming, 13(2 & 3):103-179, 1992.
3. S. Debray and D. Warren. Functional computations in logic programs. ACM Transactions on Programming Languages and Systems, 11(3):451-481, 1989.
4. J. Gallagher. A system for specialising logic programs. Technical Report TR-91- 32, University of Bristol, November 1991.
5. J. Gallagher and D. A. de Waal. Fast and precise regular approximations of logic programs. In P. Van Hentenryck, editor, Proceedings of the International Conference on Logic Programming, pages 599-613. The MIT Press, 1994.
6. R. Glück, J. Jørgensen, B. Martens, and M. Sørensen. Controlling conjunctive partial deduction of definite logic programs. In this Volume.
7. N. Heintze. Practical aspects of set based analysis. In Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 765-779, Washington D.C., 1992. MIT Press.
8. G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. The Journal of Logic Programming, 13(2 & 3):205-258, 1992.
9. M. Leuschel. The ecce partial deduction system and the DPPD library of benchmarks. Obtainable via http://www.ee.kuleuven.ac.be/~lpai, 1996.
10. M. Leuschel, D. De Schreye, and A. de Waal. A conceptual embedding of folding into partial deduction: Towards a maximal integration. In Proceedings of the Joint International Conference and Symposium on Logic Programming, Bonn, Germany, September 1996. MIT Press. To Appear. Extended version as Technical Report CW 225, Departement Computerwetenschappen, K.U. Leuven. Accessible via http: //www.cs.kuleuven.ac.be/~lpai.
11. M. Leuschel and B. Martens. Partial deduction of the ground representation and its application to integrity checking. In J. Lloyd, editor, Proceedings of the International Logic Programming Symposium, pages 495-509, Portland, USA, December 1995. MIT Press.
12. M. Leuschel and B. Martens. Global control for partial deduction through characteristic atoms and global trees. In O. Danvy, R. Glück, and P. Thiemann, editors, Proceedings of the 1996 Dagstuhl Seminar on Partial Evaluation, LNCS, Schloß Dagstuhl, 1996. To Appear.
13. M. Leuschel and D. Schreye. Logic program specialisation: How to be more specific. Technical Report CW 232, Departement Computerwetenschappen, K.U. Leuven, Belgium, May 1996. Accessible via http://HHH.cs.kuleuven.ac.be/'lpai.
14. J. W. Lloyd and J. C. Shepherdson. Partial evaluation in logic programming. The Journal of Logic Programming, 11:217-242, 1991.
15. K. Marriott, L. Naish, and J.-L. Lassez. Most specific logic programs. Annals of Mathematics and Artificial Intelligence, 1:303-338, 1990. Preliminary version in Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 909-923, Seattle, 1988. IEEE, MIT Press.
16. A. Mulkers, W. Winsborough, and M. Bruynooghe. Live-structure data-flow analysis for Prolog. ACM Transactions on Programming Languages and Systems, 16(2):205-258, 1994.
17. A. Pettorossi and M. Proietti. Transformation of logic programs: Foundations and techniques. The Journal of Logic Programming, 19 & 20:261-320, May 1994.
18. M. Proietti and A. Pettorossi. Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs. In J. Maluszyński and M. Wirsing, editors, Proceedings of PLILP'91, LNCS 528, Springer Verlag, pages 347-358, 1991.
19. T. C. Przymusinksi. On the declarative and procedural semantics of logic programs. Journal of Automated Reasoning, 5(2):167-205, 1989.
20. V. Turchin. Program transformation with metasystem transitions. Journal of Functional Programming, 3(3):283-313, 1993.
21. P. Wadler. Deforestation: Transforming programs to eliminate intermediate trees. Theoretical Computer Science, 73:231-248, 1990.