Erlang is _the_ disruptive technology...

[Marc Feeley]

> Documentation about Will Executors can be found at...
> 
> http://download.plt-scheme.org/doc/202/html/mzscheme/mzscheme-Z-H-13.html#%_chap_13

I would like to point out that "wills" first appeared in the Gambit-C
Scheme system over 5 years ago.  The basic idea is that you can create
an object called a will which contains a reference to an object X and
a function (the "executor").  When the GC sees that there are no
references to X except through the will, the executor is called with X
as an argument.  The executor can do any sort of finalization on X and
can even "resurect" it by simply storing it somewhere that is
accessible from the roots.  Aside from finalization, you can use wills
to implement other interesting things like hash tables, extensible
objects and pools.

Marc