🚀 go-pugleaf

In article <3907@bingvaxu.cc.binghamton.edu> vu0310@bingvaxu.cc.binghamton.edu.cc.binghamton.edu (R. Kym Horsell) writes:
>In article <1990Aug29.095308.18522@sics.se> roland@sics.se (Roland Karlsson) writes:
>\\\
>>the trail will be effected at !.  So at backtracking (untrailing) you
>>will trap at the pointer to the heap.  The code on the heap will be
>>executed and thereby the old value restored.  So a ! will NOT make
>>the change permanent.
>
...
>The version of setarg/3 I have uses the *stack* to remember the
>fact that a given argument (i.e. part of the term structure
>stored on the heap) has been changed -- in this respect it's just
>like other backtrack points.
>
>A cut therefore will forget the fact that the change was done
>and therefore it *won't* be restored on backtracking.

This is interesting. Is no-one out there using the trail to store
directly the old value together with its address? This is the
so-called value-trailing, as opposed to the usual address trailing
where only the address is trailed and on untrailing its contents
is reset to a free variable. Value trailing is necessary to implement
efficiently coroutining systems (yes, I know that it is possible
without, but not fast enough). It was already present in MU-Prolog.
Once this mechanism is available, it can also be used to implement
backtrackable destructive assignment, if someone has to have it.
It seems to be much simpler and less space-consuming than
the two approaches mentioned above. Why to trail a pointer
to a code that restores the value if you can trail the value itself?
A cut of course does not prevent the restoring of the previous value,
like in Karlsson's approach.

--Micha Meier
--
USA     micha%ecrc.de@pyramid.com	MAIL	Micha Meier
						ECRC, Arabellastr. 17
EUROPE  micha@ecrc.de				8000 Munich 81
						West Germany