home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.parallel
- Path: sparky!uunet!gatech!hubcap!fpst
- From: Steven Zenith <zenith@kai.com>
- Subject: Re: CSP to STRAND/Parlog
- Message-ID: <1992Jul23.134920.4944@hubcap.clemson.edu>
- Sender: fpst@hubcap.clemson.edu (Steve Stevenson)
- Organization: Clemson University
- Date: Wed, 22 Jul 1992 10:15:31 -0500
- Approved: parallel@hubcap.clemson.edu
- Lines: 33
-
- 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)?
-
- > >> In fact
- > >> part of my current work is considering methods of translating
- > >> from CSP to Strand/Parlog,
-
- > ... What's the rationale here?
- >
- > I would have thought the usefulness of the
- > transformation is obvious.
-
- It wasn't clear from your earlier posts that execution was your primary
- interest. I'm still not sure that if I was considering a target language for
- the execution of CSP scripts that STRAND or Parlog would be a good choice. So,
- we should clarify what you are interested in when executing CSP scripts. Is
- performance an important issue? Behavioral correctness? Perhaps you are
- deriving something from the execution of the program that you can't derive
- from static analysis? etc..
-
- Steven Ericsson Zenith
- Disclaimer: Opinions expressed are my own and not necessarily those of KAI.
-
-