Hi Johan:

here are action items for the technical report:

Type Checking of Adaptive programs
authors: Johan, Karl, Boaz, Doug + ?



1. Discuss s1<s2 => PathSet[s1](s2)

2. Show that  s1<s2 <= PathSet[s1](s2) is wrong

3. Show that Boaz' and my way to fix it does not work:
/proj/adaptive/www/design-decisions/traversal-strategies/substrategy/boaz1
   provide counter examples.

4. Show that s1<s2 <=> s1 contains a subgraph homeomorphic to s2
   or give a counter example.

5. Show the details of the proof that REGULAR PATH is in P.
  
6. Show that the check whether all paths in PathSet[G](S) have the
   property that X occurs before Y is in P.

-- Karl