Compile-time memory reuse in logic programming languages through update in place

ACM Transactions on Programming Languages and Systems

Volumn 21, Issue 3, 1999, Pages 430-501

  Gudjónsson, Gudjón ^a   Winsborough, William H ^b  

^a OZ Interactive Inc   (Iceland)

^b Transarc Corp   (United States)

Author keywords

Compile time garbage collection; Local reuse; Prolog; Reuse map; Update in place

Indexed keywords

GARBAGE COLLECTION; MATRIX TRANSPOSITION;

AUTOMATIC PROGRAMMING; DATA STORAGE EQUIPMENT; DATA STRUCTURES; HEURISTIC METHODS; MATHEMATICAL TRANSFORMATIONS; PROLOG (PROGRAMMING LANGUAGE);

LOGIC PROGRAMMING;

EID: 0041914113     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/319301.319309     Document Type: Article

References (36)

1. AIT-KACI, H. 1991. Warren's Abstract Machine: A Tutorial Reconstruction. MIT Press.
2. BLOSS, A. 1989. Path analysis and optimization of non-strict functional languages. Ph.D. thesis, Department of Computer Science, Yale University.
3. BRUYNOOGHE, M. 1986. Compile-time garbage collection or how to transform programs in an assignment-free language into code with assignments. In Program specification and transformation. The IFIP TC2/WG 2.1 Working Conference, Bad Tolz, Germany. North-Holland, 113-129.
4. BURTON, B., GUDJÓNSSON, G., AND WINSBOROUGH, W. 1992. An algorithm for computing alternating closure. Tech. Rep. CS-92-15, Department of Computer Science, The Pennsylvania State University. June.
5. CHARLIER, B. L., MUSUMBU, K., AND HENTENRYCK, P. V. 1991. A generic abstract interpretation algorithm and its complexity analysis. In Proceedings 8th International Conference on Logic Programming, K. Furukawa, Ed. MIT Press, 64-78.
6. CODISH, M., DAMS, D., AND YARDENI, E. 1991. Derivation and safety of an abstract unification algorithm for groundness and aliasing analysis. In Proceedings 8th International Conference on Logic Programming, K. Furukawa, Ed. MIT Press, 79-93.
7. DEBRAY, S. K. 1993. On copy avoidance in single assignment languages. In Proceedings of the 10th International Conference on Logic Programming, D. S. Warren, Ed. The MIT Press, Budapest, Hungary, 393-407.
8. DEBRAY, S. K. 1994. On the complexity of a compile-time memory reuse problem. Tech. rep., University of Arizona. January.
9. DUVVURU, S., SUNDARARAJAN, R., TICK, E., SASTRY, A. V. S., HANSEN, L., AND ZHONG, X. 1992. A compile-time memory-reuse scheme for concurrent logic programs. In Memory Management: International Workshop IWMM92. Number 637 in LNCS. Springer-Verlag, 264-276.
10. FOSTER, I. AND WINSBOROUGH, W. 1991. Copy avoidance through compile-time analysis and local reuse. In Proceedings 1991 International Logic Programming Symposium, V. Saraswat and K. Ueda, Eds. MIT Press, 455-469.
11. GAREY, M. R. AND JOHNSON, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman.
12. GROVES, R. B. 1992. Transforming Prolog predicates to perform update in place. M.S. thesis, Department of Computer Science, The Pennsylvania State University.
13. GUDJÓNSSON, G. 1996 Compile-time memory reuse in single-assignment programming languages: Updating recursive data structures in place. Ph.D. thesis, Pennsylvania State University.
14. HAYGOOD, R. 1992. Aquarius Prolog User Manual. Advanced Computer Architecture Laboratory, University of Southern California.
15. HUANG, I.-J. AND DESPAIN, A. M. 1992. High level synthesis of pipelined instruction set processors and back-end compilers. In 29th Design Automation Conference. IEEE Computer Society Press, 135-140.
16. HUDAK, P. 1987. A semantic model of reference counting and its abstraction. In Abstract Interpretation of Declarative Languages, S. Abramsky and C. Hankin, Eds. Ellis Horwood, 45-62.
17. HUDAK, P. AND BLOSS, A. 1985. The aggregate update problem in functional programming systems. In Conference Record of the 12th ACM Symposium on Principles of Programming Languages. ACM Press, 300-314.
18. INOUE, K. AND TORII, K. 1991. Implementation and analysis of compile-time garbage collection. New Generation Computing 10, 101-119.
19. JONES, S. B. AND LE METÁYER, D. 1989. Compile-time garbage collection by sharing analysis. In Record of the 1989 Conference on Functional Programming and Computer Architecture. ACM Press, London, 54-74.
20. KLUŹNIAK, F. 1988. Compile-time garbage collection for ground Prolog. In Proceedings 5th International Conference and Symposium on Logic Programming, R. A. Kowalski and K. A. Bowen, Eds. MIT Press, 1490-1505.
21. LIBLIT, B. 1993. Transformation of prolog programs to perform update in place: A prototype code synthesizer. M.S. thesis, Department of Computer Science, The Pennsylvania State University.
22. LLOYD, J. W. 1987. Foundations of Logic Programming, 2 ed. Springer, Berlin, Heidelberg.
23. MARIEN, A. JANSSENS, G., MULKERS, A., AND BRUYNOOGHE, M. 1989. The impact of abstract interpretation: An experiment in code generation. In Proceedings 6th International Conference on Logic Programming, G. Levi and M. Martelli, Eds. MIT Press, 33-47.
24. MULKERS A., WINSBOROUGH, W., AND BRUYNOOGHE, M. 1990. Analysis of shared data structures for compile-time garbage collection in logic programs. In Proceedings 7th International Conference on Logic Programming, D. H. D. Warren and P. Szeredi, Eds. MIT Press, 747-762.
25. MULKERS, A., WINSBOROUGH, W., AND BRUYNOOGHE, M. 1994. Live-structure dataflow analysis. toplas 16, 2 (Mar.), 205-258.
26. O'KEEFE, R. A. 1990. The Craft of Prolog. MIT Press.
27. PARK, Y. G. AND GOLDBERG, B. 1992. Escape analysis on lists. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM Press, 116-127.
28. STERLING, L. AND SHAPIRO, E. 1986. The Art of Prolog. MIT Press.
29. SUNDARARAJAN, R., SASTRY, A. V. S., AND TICK, E. 1992. Variable threadedness analysis for concurrent logic programs. In Proceedings Joint International Conference and Symposium on Logic Programming. MIT Press, 493-508.
30. TAN, J. 1993. Personal communication.
31. THRÁINSSON, B. R. 1991. A simple approach to shared-structure analysis in logic programs. M.S. thesis, Department of Computer Science, The Pennsylvania State University.
32. TICK, E. 1992. Parallel Logic Programming. MIT Press.
33. VAN ROY, P. L. 1990. Can logic programming execute as fast as imperative programming. Ph.D. thesis, University of California, Berkeley.
34. VATAJA, P. AND UKKONEN, E. 1984. Finding temporary terms in Prolog programs. In Proceedings International Conference on 5th Generation Computing Systems. Ohmsha Ltd, Tokyo, 275-282.
35. WARREN, D. H. D. 1977. Implementing prolog - compiling predicate logic programs. Tech. Rep. 40, University of Edinburgh. May.
36. WINSBOROUGH, W. 1992. Multiple specialization using minimal-function graph semantics. JLP 13, 2-3 (July), 259-290.