home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.parallel
- Path: sparky!uunet!gatech!hubcap!fpst
- From: steve@compsci.bristol.ac.uk
- Subject: Re: CSP to STRAND/Parlog
- Message-ID: <1992Jul27.140857.25826@hubcap.clemson.edu>
- Sender: fpst@hubcap.clemson.edu (Steve Stevenson)
- Organization: Clemson University
- References: <1992Jul23.134920.4944@hubcap.clemson.edu>
- Date: Mon, 27 Jul 1992 14:08:57 GMT
- Approved: parallel@hubcap.clemson.edu
- Lines: 26
-
- In article <1992Jul23.134920.4944@hubcap.clemson.edu> zenith@kai.com (Steven Zenith) writes:
- >In article <1992Jul20.075511.17628@dcs.qmw.ac.uk>, mmh@cs.qmw.ac.uk
- >Matthew Huntbach writes:
- >
- >> If you think that Strand or Parlog are basically
- >> "parallel Prologs", you are completely wrong. Many people who
- >> program in them, such as myself, think of them more in CSP-like
- >> terms than in Prolog-like terms.
- >
- >I'm pleased to hear it, I don't dispute that a parallel between CSP and
- >Strand or Parlog can be drawn - but you don't answer my question: why is the
- >parallel between committed choice concurrent logic languages closer than any
- >other (say, CSP and functional or concurrent imperative languages)?
- >
-
- The "parallel" between CSP and concurrent logic programming languages is
- no coincidence: the design of Parlog began in 1979/80 as a deliberate
- attempt to recast CSP (Hoare, 1978) in a logic programming framework.
- As it turned out, the differences between CSP and CLP proved to be more
- interesting than their obvious similarities. There are plenty of other
- languages around (including logic-based and imperative ones) that have
- more in common with CSP. (Not functional languages, of course: they
- don't have non-determinism.)
-
- steve gregory
-
-