Fri Apr 3 16:51:13 CEST 2009


Partial values <-> Complete values.

The single-assignment store is remarkable (2.2 p. 42).  Especially the
use of assignment to both construct data structures and take them
apart.  See p80 2.6 : The binding operation performs [unification]
which is a symmetric operation.

Maybe I should try to implement it?  CTM p. 101 has the
algorithm.  In the context of an evaluator, the nontrivial part is the
implementation of the data structure (i.e. functional w. sharing
vs. imperative/hash).

[unification] http://en.wikipedia.org/wiki/Unification