J. Barklund. A Garbage Collection Algorithm for Tricia. Technical Report 37B, UPMAIL, Uppsala University, 1987.  Home/Search   Document Details and Download   Summary   Related Articles

....heap, g(a) and f(a) are marked and kept in memory (see figure 4) 4.2 Ignoring useless bindings, early reset To comply with principle 2, some binding values may become useless , it is necessary to consider the binding status of goal statements. Several authors have implemented this principle [15, 8, 6, 37, 5, 3, 42]. The condition for applying early reset of variables is shown in figure 5. It shows that the variables which can be reset are those that are not seen by a goal statement older than the variable binding. The early reset technique consists in traversing each choice point (goal statement) in the ....

....substitutions thereof. The mechanism is usually implemented using a so called value trail, c.f. x5.2. 5. 1 Attributed variables In order to implement extensions to Prolog, a new type of variable has been introduced; we call it attributed variables, as in [29] It has also been called closures in [5] or suspensions in [18] In these systems, attributed variables have been used to implement delay and constraint extensions into Prolog. An attributed variable is like a variable with an extra term attached to it, its attribute. Attributed variables have been generalized in [38] under the name of ....

[Article contains additional citation context not shown here]

J. Barklund. A Garbage Collection Algorithm for Tricia. Technical Report 37B, UPMAIL, Uppsala University, 1987.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC