Article View: comp.sys.transputer
Article #1284Why Occam3 probably won't be recursive (was: IS Occam3 recursive?)
From: W.G.Day
Date: Thu, 12 Nov 1992 10:39
Date: Thu, 12 Nov 1992 10:39
19 lines
1436 bytes
1436 bytes
tsw@netcom.com (Tim Walker) writes: > Does anyone know if Occam3 will be recursive? This is a big drawback >in Occam2 when trying to implement things like parallel searchs. As the adding of recursion would prevent the compile-time-only memory allocation from being performed (occam programs should never run out of memory at runtime); I suspect not. However, having recently implemented the Towers of Hanoi on a processor farm and quicksort in occam (Tony Hoare's sort algorithm on C.S.P. hardware, hmm), I found the building of my own stack to hold the details of the recursing on to be the quite literally the easist part of the whole designing and writing process, and it's not something I've had to do before. Doing it all yourself means you can build a queue instead of a stack and do things breadth-first if you wish. > -- Tim Walker (tsw@netcom.com) Warren
Technical Details
Message-ID:
<2225@eagle.ukc.ac.uk>Path:
arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!agate!doc.ic.ac.uk!uknet!rook.ukc.ac.uk!eagle.ukc.ac.uk!wgdReferences:
<1992Nov11.033835.21118@netcom.com>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!agate!doc.ic.ac.uk!uknet!rook.ukc.ac.uk!eagle.ukc.ac.uk!wgd From: wgd@ukc.ac.uk (W.G.Day) Newsgroups: comp.sys.transputer Subject: Why Occam3 probably won't be recursive (was: IS Occam3 recursive?) Keywords: Occam3 recursive, no Message-ID: <2225@eagle.ukc.ac.uk> Date: 12 Nov 92 10:39:40 GMT References: <1992Nov11.033835.21118@netcom.com> Reply-To: wgd@ukc.ac.uk (Warren Day) Organization: Computing Lab., The University, Canterbury, Kent. CT2 7NF, UK. Lines: 19 Nntp-Posting-Host: eagle.ukc.ac.uk