Live-structure Analysis for Logic Programming Languages with Declarations (1996)
Cached
Download Links
- [www.cs.kuleuven.ac.be]
- [ftp.cs.kuleuven.ac.be]
- DBLP
Other Repositories/Bibliography
| Venue: | Proceedings of the Fourteenth International Conference on Logic Programming (ICLP'97 |
| Citations: | 7 - 5 self |
BibTeX
@INPROCEEDINGS{Bruynooghe96live-structureanalysis,
author = {Maurice Bruynooghe and Gerda Janssens and Andreas Kagedal},
title = {Live-structure Analysis for Logic Programming Languages with Declarations},
booktitle = {Proceedings of the Fourteenth International Conference on Logic Programming (ICLP'97},
year = {1996},
pages = {33--47},
publisher = {MIT Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The advent of logic languages with type and mode declarations makes it worthwhile to analyse whether the live-structure analysis of Mulkers et al. can be elaborated in an efficient method for reclaiming memory. This paper develops a backward use analysis and makes several proposals which have potential for reducing the cost of the alias analysis. 1 Introduction To compete in speed with imperative languages, declarative languages need efficient methods for reclaiming unused memory. Mulkers et al. [16] developed a live-structure analysis for logic programs which can determine at compile-time when data structures become available for reuse. The advent of a language such as Mercury [18] motivates a refinement of this analysis, turning it into an efficient method. Though Mercury allows the programmer to control the reuse of data structures, the required declarations force the programmer to reason at a low level of memory management which is unusual and rather inconvenient for a declarative...
