Path: utzoo!attcan!uunet!tut.cis.ohio-state.edu!ucbvax!TERRA.OSCS.MONTANA.EDU!iphwk
From: iphwk@TERRA.OSCS.MONTANA.EDU (Bill Kinnersley)
Newsgroups: comp.lang.misc
Subject: Re: CSP
Message-ID: <8912161925.AA04979@terra.oscs.montana.edu>
Date: 16 Dec 89 19:25:38 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Lines: 22

[In "Re: CSP", rlk@telesoft.com (Bob Kitzberger said:]
: 
: grichard@hockey.cis.ohio-state.edu (Golden Richard) writes:
: 
: >I'm looking for an implementation of a (super?)set of Hoare's
: >CSP notation.  It need be neither distributed nor very robust.
: 
: Ada's tasking model is largely based on Communicating Sequential Processes.
: Most of the current tasking implementations are robust; some even support 
: distribution of Ada tasks over multiple CPU's.
: 
I doubt that Hoare would enjoy seeing Ada proposed as a substitute for
CSP!  He has been one of the most vocal critics of Ada.  While both CSP
and Ada deal with communication between sequential processes, they are
at opposite extremes in terms of complexity.


-- 
--Bill Kinnersley
  Physics Department   Montana State University    Bozeman, MT 59717
  INTERNET: iphwk@terra.oscs.montana.edu      BITNET: IPHWK@MTSUNIX1
226 Transfer complete.