What we all are doing:

========================
Doug is refining the AP library getting several bugs out and making it complete.
========================
Johan and I talked about regular expressions versus strategies.

Johan is working on the following conjecture:
Regular expressions are more expressive than strategies

He will make this conjecture precise and prove it by a counterexample.
A counterexample includes a class graph and a path set
in the class graph (think of the path set as being described as
a regular expression in terms of the class graph) and a
"high-level" regular expression that defines that path set
and a proof that no strategy can express that path set.

Alternatively, he shows that regular expressions and strategies have
equal expressiveness.
========================

Josh is studying APPCs and thinking about how they work and are implemented.
He focusses on APPC beans.

Chris Turkanu reported problem with DisplayVisitor that needs to be repaired.


-- Karl