Hi Boaz:

The implementation of Ridl for Demeter/Java requires a solution
of the following problem:

Given a strategy graph S, and a class graph G.
Required is an algorithm MARSHAL[S,G](O)
which takes an object graph O and which
encodes the subobject O' traversed by S as a string m so that from
S, G and m, we can quickly reconstruct O'.

Are there some intresting tradeoffs in this problem? Can we reconstruct
O' faster if we know the strategy which produced it?
The overall  goal is to make the string m = MARSHAL[S,G](O) small
and the reconstruction algorithm fast.

Crista uses the traversal specifications to reconstruct the object.

-- Karl