home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!saimiri.primate.wisc.edu!usenet.coe.montana.edu!news.u.washington.edu!stein.u.washington.edu!chuckb
- From: chuckb@stein.u.washington.edu (Charles Bass)
- Newsgroups: sci.math.symbolic
- Subject: References to pattern matching?
- Date: 24 Jan 1993 02:40:42 GMT
- Organization: University of Washington
- Lines: 17
- Message-ID: <1jsvjaINNfat@shelley.u.washington.edu>
- NNTP-Posting-Host: stein.u.washington.edu
-
- We are writing some code that mimics the Mathematica pattern
- matching paradigm. Using Scheme (lisp like language) we have a
- system running that is within a factor of 5 to 10 of Mathematica.
- We have many references to classical pattern matching (ie regex,
- grep etc) and the language Snobol which used a pattern matching
- style.
-
- Does anyone have a reference to a paper on modern pattern
- matching in symbolic math types of applications. We have been
- fairly unsuccessful at finding good references on this topic...
-
- Any insight would be appreciated.
-
- chuckb
-
- PS I don't usually follow this group so email would be nice but
- I will check back for the next week or so (1/23/93)
-