Hi Tim:

sorry for the long delay. Here is my position statement:

Karl Lieberherr 
http://www.ccs.neu.edu/home/lieber/
is interested in adaptive programming
http://www.ccs.neu.edu/research/demeter/
which is a powerful form of generic programming.
In adaptive programming a program is split into a class graph
and other aspectual descriptions and the class graph is referenced
in those descriptions
through traversal strategies, also called succinct path set
specifications. Since the class graph is referenced
through strategies, the program can be used with infinitely
many other class graphs defining "similar" objects. 
Our latest work on strategies is at:
ftp://ftp.ccs.neu.edu/pub/people/lieber/strategies.ps
which describes a recent breakthrough: our earlier compilation 
algorithm developed with Jens Palsberg and Cun Xiao
has been exponentially improved
in the worst-case (at the cost of some execution speed)
and we developed a better model for describing traversals succinctly.

-- Karl




http://www.cse.ogi.edu/PacSoft/conf/wgp/

Workshop on Generic Programming
June 18th 1998
Marstrand, Sweden
Call for papers 
Generic programming is about making programs more adaptable by making them more general. Generic
programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by
suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic programs
are often quite rich in structure. For example they may be other programs, types or type constructors, or even
programming paradigms.