Path: utzoo!attcan!uunet!mcsun!ukc!edcastle!cs.ed.ac.uk!vaila!nick From: nick@vaila.cs.ed.ac.uk (Nick Rothwell) Newsgroups: comp.sys.transputer Subject: Re: Was: C to Occam translator Message-ID: <501@skye.cs.ed.ac.uk> Date: 2 Oct 90 13:28:02 GMT References: <4739@baird.cs.strath.ac.uk> Sender: nnews@cs.ed.ac.uk Reply-To: nick@lfcs.ed.ac.uk Organization: Wavetables 'R' Us Lines: 21 In article <4739@baird.cs.strath.ac.uk>, charles@cs.strath.ac.uk (Charles X. Chen) writes: |>(have you |>ever heard anybody solve the Honoi tower problem in Occam? Just as a matter of interest, you can solve Towers of Hanoi without recursion, so it could be done. Don't think much of OCCAM myself. I don't see what it really has to offer over some kind of parallel C, and it's missing a hell of a lot. Ideally, you want a garbage-collected language with first-class closures so that you can get proper communication abstraction, pass functions through channels, or pass channels through channels to implement remote call-and-return, and this kind of thing. Neither OCCAM nor C come close for this kind of thing. Nick Rothwell, Laboratory for Foundations of Computer Science, Edinburgh. nick@lfcs.ed.ac.uk !mcsun!ukc!lfcs!nick ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ "Now remember - and this is most important - you must think in Russian."