Optimizing compilation of CLP(R)

ACM Transactions on Programming Languages and Systems

Volumn 20, Issue 6, 1998, Pages 1223-1250

  Kelly, Andrew D ^a   Marriott, Kim ^a   Macdonald, Andrew ^b   Stuckey, Peter J ^b   Yap, Roland ^c  

^a MONASH UNIVERSITY   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; OPTIMIZATION; PROGRAM COMPILERS; PROGRAMMING THEORY;

CONSTRAINT LOGIC PROGRAMMING (CLP); SOURCE-TO-SOURCE PROGRAM TRANSFORMATION;

LOGIC PROGRAMMING;

EID: 0032256524     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/295656.295661     Document Type: Article

References (27)

1. AÏT-KACI, H. 1991. Warren's Abstract Machine: A Tutorial Reconstruction. MIT Press, Cambridge, Mass.
2. ARMSTRONG, T., MARRIOTT, K., SCHACHTE, P., AND SØNDERGAARD, H. 1994. Boolean functions for dependency analysis: Algebraic properties and efficient representation. In Proceedings of the 1st International Static Analysis Symposium, B. Le Charlier, Ed. Lecture Notes in Computer Science, vol. 864. Springer-Verlag, Berlin, 266-280.
3. COUSOT, P. AND COUSOT, R. 1992. Abstract interpretation and application to logic programs. J. Logic Program. 13, 2/3 (July), 103-179.
4. CRNOGORAC, L., KELLY, A., AND SØNDEGAARD, H. 1996. A comparison of three occur-check analysers. In Proceedings of the 3rd International Static Analysis Symposium, R. Cousot and D. Schmidt, Eds. Lecture Notes in Computer Science, vol. 1145. Springer-Verlag, Berlin, 159-173.
5. GARCÍA, DE LA BANDA, M., HERMENEGILDO, M., BRUYNOOGHE, M., DUMORTIER, V., JANSSENS, G., AND SIMOENS, W. 1996. Global analysis of contraint logic programs. ACM Trans. Program. Lang. Syst. 18, 5 (September), 564-615.
6. HERMENEGILDO, M. 1994. Some methodological issues in the design of CIAO, a generic, parallel concurrent constraint logic programming system. In Proceedings of the 2nd International Workshop on Principles and Practice of Constraint Programming, A Borning, Ed. Lecture Notes in Computer Science, vol. 874. Springer-Verlag, Berlin, 123-133.
7. HERMENEGILDO, M., PUEBLA, G., MARRIOTT, K., AND STUCKEY, P. 1995. Incremental analysis of logic programs. In Logic Programming: Proceedings of the 12th International Conference, L. Sterling Ed. MIT Press, Cambridge, Mass., 797-814.
8. JAFFAR, J., MICHAYLOV, S., STUCKEY, P., AND YAP, R. 1992a. An abstract machine for CLP(R). In Proceedings of the ACM Conference on Programming Languauge Design and Implementation. ACM, New York, 128-139.
9. JAFFAR, J., MICHAYLOV, S., STUCKEY, P., AND YAP, R. 1992b. The CLP(R) language and system. ACM Trans. Program. Lang. Syst. 14, 3, 339-395.
10. JØRGENSEN, N., MARRIOTT, K., AND MICHAYLOV, S. 1991. Some global compile-time optimizations for CLP(R). In Logic Programming: Proceedings of the 1991 International Symposium, V. Saraswat and K. Ueda, Eds. MIT Press, Cambridge, Mass., 420-434.
11. KELLY, A., MACDONALD, A., MARRIOTT, K., SONDERGAARD, H., STUCKEY, P., AND YAP, R. 1995. An optimizing compiler for CLP(R). In Proceedings of the 1st International Conference on Principles and Practices of Constraint Programming. Lecture Notes in Computer Science, vol. 976. Springer-Verlag, Berlin, 222-239.
12. KELLY, A., MACDONALD, A., MARRIOTT, K., STUCKEY, P., AND YAP, R. 1996. Effectiveness of optimizing compilation of CLP(R). In Logic Programming: Proceedings of the 1992 Joint International Conference and Symposium, M. Maher, Ed. MIT Press, Cambridge, Mass., 37-51.
13. KELLY, A., MARRIOTT, K., SØNDERGAARD, H., AND STUCKEY, P. 1997. A generic object oriented incremental analyser for constraint logic programs. In Proceedings of the 20th Australasian Computer Science Conference. 92-101.
14. LE CHARLIER, B. AND VAN HENTENRYCK, P. 1994. Experimental evaluation of a generic abstract interpretation algorithm for Prolog. ACM Trans. Program. Lang. Syst. 16, 1, 35-101.
15. MACDONALD, A., AND STUCKEY, P. AND YAP, R. 1993. Redundancy of variables in CLP(R). In Logic Programming: Proceedings of the 1993 International Symposium. MIT Press, Cambridge, Mass., 75-93.
16. MARRIOTT, K., AND SØNDERGAARD, H. 1990. Analysis of constraint logic programs. In Logic Programming: Proceedings of the North American Conference 1990, S. Debray and M. Hermenegildo, Eds. MIT Press, Cambridge, Mass., 531-547.
17. MARRIOTT, K., SØNDERGAARD, H., STUCKEY, P. J., AND YAP, R. 1994. Optimizing compilation for CLP(R). In Proceedings of the 17th Australian Computer Science Conference, G. Gupta, Ed. 551-560.
18. MARRIOTT, K. AND STUCKEY, P. 1993. The 3 R's of optimizing constraint logic programs: Refinement, removal and reordering. In Proceedings of the 20th ACM Symposium on Principles of Programming Languages. ACM, New York, 334-344.
19. MARRIOTT, K. AND STUCKEY, P. 1998. Programming with Constraints: an Introduction. MIT Press, Cambridge, Mass.
20. MUTHUKUMAR, K. AND HERMENEGILDO, M. 1992. Compile-time derivation of variable dependency using abstract interpretation. J. Logic Program. 13, 2/3 (July), 315-347.
21. PUEBLA, G. AND HERMENEGILDO, M. 1995. Implementation of multiple specialization in logic programs. In Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation. ACM, New York, 77-87.
22. PUEBLA, G. AND HERMENEGILDO, M. 1997. Abstract specialization and its application to program parallelization. In Sixth International Workshop on Logic Program Synthesis and Transformation, J. Gallagher, Ed. Lecture Notes in Computer Science, vol. 1207. Springer-Verlag, Berlin, 169-186.
23. RAMACHANDRAN, V. AND VAN HENTENRYCK, P. 1995. Source to source optimizations of CLP(RLin). Brown University Technical Report.
24. SØNDERGAARD, H. 1986. An application of abstract interpretation of logic programs: Occur check reduction. In Proceedings of the European Symposium on Programming. Lecture Notes in Computer Science, vol. 213. Springer-Verlag, Berlin, 327-338.
25. TAYLOR, A. 1990. LIPS on a MIPS: Results from a Prolog compiler for a RISC. In Logic Programming: Proceedings of the 7th International Conference, D. Warren and P. Szeredi, Eds. MIT Press, Cambridge, Mass., 174-185.
26. VAN ROY, P. AND DESPAIN, A. 1990. The benefits of global dataflow analysis for an optimizing Prolog compiler. In Logic Programming: Proceedings of the North American Conference 1990, S. Debray and M. Hermenegildo, Eds. MIT Press, Cambridge, Mass., 501-515.
27. WINSBOROUGH, W. 1992. Multiple specialization using minimal-function graph semantics. J. Logic Program. 13, 2/3 (July), 259-290.