Hi Mehdi:

thank you for  your invitation to the Dagstuhl seminar on Generic
Programming. I plan to come.

From the Dagstuhl seminar invitation:
===========
Key ideas include:

expressing algorithms with minimal assumptions about data 
abstractions, and vice versa, thus making them as interoperable as possible.

lifting of a concrete algorithm to as general a level as possible 
without losing efficiency; i.e., the most abstract form such that when specialized back to the concrete case the result is just as efficient as 
the original algorithm.
===========

These two topics are also addressed directly by adaptive programming but our
vocabulary is quite different than the vocabulary of STL. We use a vocabulary
like: class graphs, strategies, constraint maps, name maps etc.
to solve the problem. Our recent work in this are is in:

ftp://ftp.ccs.neu.edu/pub/people/lieber/strategies.ps

Our techniques are complementing the STL techniques and I hope an
alternative vocabulary and solution will be welcome by the organizers.

I would like to give a talk on:

Generic Programming using Adaptive and Aspect-Oriented Programming

Best regards,
-- Karl