Binding-time annotations without binding-time analysis

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

Volumn 2250, Issue , 2001, Pages 707-722

  Vanhoof, Wim ^a   Bruynooghe, Maurice ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LOGIC PROGRAMMING;

BINDING TIME; BINDING-TIME ANALYSIS; SPECIALISATION; TERMINATION ANALYSIS; UNFOLDINGS;

BINS;

EID: 84896398062     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45653-8_49     Document Type: Conference Paper

References (18)

1. Peter Holst Andersen and Carsten Kehler Holst. Termination analysis for offline partial evaluation of a higher order functional language. In Proceedings of the Third International Static Analysis Symposium (SAS), pages 67-82, 1996.
2. F. Benoy and A. King. Inferring argument size relationships with CLP (R). In Proceedings of LOPSTR'96, volume 1207 of Lecture Notes in Computer Science, pages 204-223, 1997.
3. Maurice Bruynooghe, Michael Leuschel, and Kostis Sagonas. A polyvariant binding-time analysis for off-line partial deduction. In C. Hankin, editor, Programming Languages and Systems, Proc. of ESOP'98, part of ETAPS'98, pages 27-41, Lisbon, Portugal, 1998. Springer-Verlag. LNCS 1381.
4. M. Codish and C. Taboch. A semantic basis for the termination analysis of logic programs. Journal of Logic Programming, 41(1):103-123, 1999.
5. D. De Schreye and S. Decorte. Termination of logic programs: the never-ending story. Journal of Logic Programming, 19/20:199-260, 1994.
6. S. Decorte, D. De Schreye, M. Leuschel, and B. Martens. Termination analysis for tabled logic programming. In N. Fuchs, editor, Proceedings of LOPSTR'97, number 1463 in Lecture Notes in Computer Science, pages 107-123, 1998.
7. S. Decorte and D. De Schreye. Termination analysis: Some practical properties of the norm and level mapping space. In Joxan Jaffar, editor, Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming (JICSLP-98), pages 235-249, Cambridge, 1998. MIT Press.
8. J. Gallagher and M. Bruynooghe. Some low-level source transformations for logic programs. In M. Bruynooghe, editor, Proceedings Meta' 90, pages 229-244, Leuven, 1990.
9. J. Jørgensen and M. Leuschel. Efficientlygenerating efficient generating extensions in Prolog. In O. Danvy, R. Glück, and P. Thiemann, editors, Proceedings Dagstuhl Seminar on Partial Evaluation, pages 238-262, Schloss Dagstuhl, Germany, 1996. Springer-Verlag, LNCS 1110.
10. Chin Soon Lee, Neil D. Jones, and Amir M. Ben-Amram. The size-change principle for program termination. In ACM Symposium on Principles of Programming Languages, volume 28, pages 81-92. ACM press, 2001.
11. M. Leuschel, B. Martens, and D. De Schreye. Controlling generalisation and polyvariance in partial deduction of normal logic programs. ACM Transactions on Programming Languages and Systems, 20(1):208-258, 1998.
12. Michael Leuschel. The ecce partial deduction system and the dppd libraryof benchmarks. Obtainable via http://www.cs.kuleuven. ac.be/~lpai, 1996.
13. Naomi Lindenstrauss and Yehoshua Sagiv. Automatic termination analysis of logic programs. In Lee Naish, editor, Proceedings of the 14th International Conference on Logic Programming, pages 63-77, Cambridge, 1997. MIT Press.
14. J. W. Lloyd and J. C. Shepherdson. Partial evaluation in logic programming. Journal of Logic Programming, 11(3&4):217-242, 1991.
15. Fred Mesnard. Inferring left-terminating classes of queries for constraint logic programs. In Michael Maher, editor, Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming, pages 7-21, Cambridge, 1996. MIT Press.
16. T. Mogensen and A. Bondorf. Logimix: A self-applicable partial evaluator for Prolog. In K.-K. Lau and T. Clement, editors, Proceedings LOPSTR' 92, pages 214-227. Springer-Verlag, Workshops in Computing Series, 1993.
17. D. Sahlin. Mixtus: An automatic partial evaluator for full Prolog. New Generation Computing, 12(1):7-51, 1993.
18. W. Vanhoof and M. Bruynooghe. Binding-time analysis for Mercury. In D. De Schreye, editor, 16th International Conference on Logic Programming, pages 500-514. MIT Press, 1999.