Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!decvax!decwrl!ucbvax!rice-titan.ARPA!rbbb
From: rbbb@rice-titan.ARPA.UUCP
Newsgroups: mod.ai
Subject: String Reduction
Message-ID: <266.rbbb.titan@Rice>
Date: Sun, 11-May-86 22:02:05 EDT
Article-I.D.: Rice.266.rbbb.titan
Posted: Sun May 11 22:02:05 1986
Date-Received: Fri, 16-May-86 01:39:39 EDT
Sender: usenet@ucbvax.BERKELEY.EDU
Organization: The ARPA Internet
Lines: 13
Approved: ailist@sri-ai.arpa

See ``Equational Logic as a Programming Language'' by Mike O'Donnell.  He
writes about using and implementing ``equational logic'', and this makes
heavy use of pattern matching and replacement (not necessarily string
reduction). (MIT Press, summer 1985)

Gyula Mago's FFP machine is a string reduction machine for functional
languages.

(I'm rather surprised that no one else mentioned these two references; are
these not what you had in mind?)

David Chase
Rice University