"... We survey basic garbage collection algorithms, and variations such as incremental and generational collection; we then discuss low-level implementation considerations and the relationships between storage management systems, languages, and compilers. Throughout, we attempt to present a uni ed view b ..."

We survey basic garbagecollection algorithms, and variations such as incremental and generational collection; we then discuss low-level implementation considerations and the relationships between storage management systems, languages, and compilers. Throughout, we attempt to present a uni ed view

by
Neng-Fa Zhou
- In Proceedings of the First Workshop on Memory Management in Logic Programming Implementations

"... We present the garbage collector (GC) implemented in B-Prolog. It is based on the incremental GC algorithm proposed for the WAM by Older and Rummell, but modifications are made to adapt the algorithm to the ATOAM, the abstract machine adopted in B-Prolog. The criterion on when to invoke GC is re ..."

We present the garbage collector (GC) implemented in B-Prolog. It is based on the incremental GC algorithm proposed for the WAM by Older and Rummell, but modifications are made to adapt the algorithm to the ATOAM, the abstract machine adopted in B-Prolog. The criterion on when to invoke GC

"... languages, segment order presereing copying garbage collec-tion, WAM based Prolog implementation. We present a bottom-up copying garbage collector for WAM based Prolog. In contrast to the top-down copying garbage collector of Bevemyr and Lindgren, it preserves the order of the heap segments in the W ..."

languages, segment order presereing copying garbagecollec-tion, WAMbasedProlog implementation. We present a bottom-up copying garbage collector for WAMbasedProlog. In contrast to the top-down copying garbage collector of Bevemyr and Lindgren, it preserves the order of the heap segments

"... Abstract We present an incremental copying garbage collector for the heap in WAM-based Prologsystems. We describe a heap layout in which the heap is divided in a number of equal-sized blocks. Other changes to the standard WAM allow to garbage collect these blocks independentlyfrom each other. Indepe ..."

Abstract We present an incremental copying garbage collector for the heap in WAM-based Prologsystems. We describe a heap layout in which the heap is divided in a number of equal-sized blocks. Other changes to the standard WAM allow to garbagecollect these blocks independentlyfrom each other

"... Abstract. In this paper we present a series of tiny programs that verify that a Prolog heap garbage collector can find specific forms of garbage. Only 2 out of our tested 7 Prolog systems pass all tests. Comparing memory usage on realistic programs dealing with finite datastructures using both poor ..."

and precise garbagecollection shows only a small difference, providing a plausible explanation why many Prolog implementors did not pay much attention to this issue. Attributed variables allow for creating infinite lazy datastructures. We prove that such datastructures have great practical value

by
Robert H. Halstead
- ACM Transactions on Programming Languages and Systems, 1985

"... Multilisp is a version of the Lisp dialect Scheme extended with constructs for parallel execution. Like Scheme, Multilisp is oriented toward symbolic computation. Unlike some parallel programming languages, Multilisp incorporates constructs for causing side effects and for explicitly introducing par ..."

prototypes including up to eight processors. Concert Multilisp uses novel techniques for task scheduling and garbagecollection. The task scheduler helps control excessive resource utilization by means of an unfair scheduling policy; the garbage collector uses a multiprocessor algorithm based

"... We propose a novel formalism, called Frame Logic (abbr., F-logic), that accounts in a clean and declarative fashion for most of the structural aspects of object-oriented and frame-based languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, ..."

We propose a novel formalism, called Frame Logic (abbr., F-logic), that accounts in a clean and declarative fashion for most of the structural aspects of object-oriented and frame-based languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods

"... This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world. This allo ..."

for applications in high level control of robots and industrial processes, intelligent software agents, discrete event simulation, etc. It is based on a formal theory of action specified in an extended version of the situation calculus. A prototype implementation in Prolog has been developed.

"... Garbage collection by copying is becoming more and more popular for Prolog. In principle copying requires a marking phase in order to be safe. However, some systems use a copying garbage collector without marking prior to copying, and instead postpone the copying of cells that might cause problem ..."

Garbagecollection by copying is becoming more and more popular for Prolog. In principle copying requires a marking phase in order to be safe. However, some systems use a copying garbage collector without marking prior to copying, and instead postpone the copying of cells that might cause