We are very excited about the APPCs and we plan to implement them using the existing Demeter/Java and AP Studio implementations. Large parts of the old software will be reused in the implementation of APPCs. We need to design the implementation of APPCs in detail. We plan to implement the traversal driven APPCs using Java beans.

We need to polish the TG package, the core algorithm for compiling adaptive programs. We need to polish it more, improve its interface, add name maps, etc. It will be needed in the implementation of APPCs as well as in several other tools. It is a fast anchored graph matching algorithm. Frank Belz from TRW was pointing out that this algorithm would be useful to speed up the pattern matching algorithm in Rapide, another EDCS project. Jens Palsberg at Purdue University also plans to use the TG package for his JTB tool.

We need to further develop the graph theory behind adaptive programming