Bill Halchin wrote (on 04-06-01 02:14 +0000):
Research in graph term rewriting is being done in regard to functional language implementation. Have Category Theoretic methods been applied to graph term rewriting research? If so, can someone point me at papers?
You may wish to look at Wolfram Kahl's publications, and the HOPS project: http://ist.unibw-muenchen.de/kahl/ For example: Wolfram Kahl. A Fibred Approach to Rewriting - How the Duality between Adding and Deleting Cooperates with the Difference between Matching and Rewriting. Technical Report Nr. 9702, Fakultät für Informatik, Universität der Bundeswehr München, May 1997. Then there is Neil Ghani's work on categorical rewriting with Christopher Lüth, though I don't think it is specific to graph rewriting: http://www.mcs.le.ac.uk/~nghani/catrew.html And there is a lot of work on linear languages by Blute, Cockett, Seely et al. which touches on rewriting. For example, Natural Deduction and Coherence for Weakly Distributive Categories (Blute-Cockett-Seely-Trimble) (JPAA 113(1996)3, pp 229-296) which is available on Seely's page here: http://www.math.mcgill.ca/rags/ -- Frank Atanassow, Information & Computing Sciences, Utrecht University Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands Tel +31 (030) 253-3261 Fax +31 (030) 251-379