From mboxrd@z Thu Jan 1 00:00:00 1970 X-Msuck: nntp://news.gmane.io/gmane.science.mathematics.categories/1998 Path: news.gmane.org!not-for-mail From: Frank Atanassow Newsgroups: gmane.science.mathematics.categories Subject: Re: graph term rewriting Date: Mon, 4 Jun 2001 14:23:13 +0200 Message-ID: <20010604142313.B8040@cs.uu.nl> References: NNTP-Posting-Host: main.gmane.org Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit X-Trace: ger.gmane.org 1241018271 1654 80.91.229.2 (29 Apr 2009 15:17:51 GMT) X-Complaints-To: usenet@ger.gmane.org NNTP-Posting-Date: Wed, 29 Apr 2009 15:17:51 +0000 (UTC) To: categories@mta.ca Original-X-From: rrosebru@mta.ca Mon Jun 4 22:12:33 2001 -0300 Return-Path: Original-Received: (from Majordom@localhost) by mailserv.mta.ca (8.11.1/8.11.1) id f550aj208617 for categories-list; Mon, 4 Jun 2001 21:36:45 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Content-Disposition: inline User-Agent: Mutt/1.2.5i In-Reply-To: ; from bhalchin@hotmail.com on Mon, Jun 04, 2001 at 02:14:54AM +0000 Original-Sender: cat-dist@mta.ca Precedence: bulk X-Keywords: X-UID: 8 Original-Lines: 38 Xref: news.gmane.org gmane.science.mathematics.categories:1998 Archived-At: 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