Re: IS Occam3 recursive?

Article View: comp.sys.transputer

Article #1746

Back to comp.sys.transputer Previous Next

#1746

From: Rob Kurver
Date: Mon, 23 Nov 1992 15:13

24 lines
1381 bytes

In <2306@eagle.ukc.ac.uk> wgd@ukc.ac.uk (W.G.Day) writes:

>>Not necessarily.  A smart enough compiler system may well be able to
>>support recursion at a small price if used, but without any overhead if

>Why should there have to be a price.

Few things in life are free.

>>not used.  This can be implemented by a smart linker, which uses a call
>                                         slow

I don't think building a call-graph during linking gives a noticeable
performance difference.  The time required is certainly negligible
compared to the time needed for file I/O.  If you have data that shows
otherwise, please post it.

Rob

--
     PACT                   Rob Kurver
    Foulkeslaan 87         rob@pact.nl
   2625 RB Delft     ph: +31 15 616864 
  The Netherlands   fax: +31 15 610032

Technical Details

Message-ID: <rob.722531598@dutncp8>

Path: arc1-ca.pugleaf.net!sparky!uunet!paladin.american.edu!news.univie.ac.at!hp4at!mcsun!sun4nl!dutrun!dutrun2!dutncp8!rob

References: <MICHAEL.92Nov16185558@lucrece.uk.ac.oxford> <2292@eagle.ukc.ac.uk> <rob.722034771@dutncp8> <2306@eagle.ukc.ac.uk>

Show Full Headers

Complete Article Headers

Newsgroups: comp.sys.transputer
Path: arc1-ca.pugleaf.net!sparky!uunet!paladin.american.edu!news.univie.ac.at!hp4at!mcsun!sun4nl!dutrun!dutrun2!dutncp8!rob
From: rob@pact.nl (Rob Kurver)
Subject: Re: IS Occam3 recursive?
Message-ID: <rob.722531598@dutncp8>
Sender: news@dutrun2.tudelft.nl (UseNet News System)
Nntp-Posting-Host: dutncp8.tn.tudelft.nl
Organization: PACT, Delft, The Netherlands
References: <MICHAEL.92Nov16185558@lucrece.uk.ac.oxford> <2292@eagle.ukc.ac.uk> <rob.722034771@dutncp8> <2306@eagle.ukc.ac.uk>
Date: Mon, 23 Nov 1992 15:13:18 GMT
Lines: 24

Reply to Parent Message