Re: Ada GC

bobduff@world.std.com (Robert A Duff) wrote:
> Some have pointed out that is difficult to *require* GC in a language
> standard, because it's difficult to *formally* specify what it means
> to have GC.


Henry Baker <hbaker@netcom.com> wrote:
>It's no harder to formally specify what it means to 'have GC' than it
>is to specify what it means to be 'real-time'. Both storage & time
>are resources which have been quantified in a measurable manner.
>Since Ada/83/95 claims to be good for 'real-time', then I presume that
>the Ada specifications make clear what the bounds for the various
>primitive operations are, and which of these bounds are O(1), O(log
>n), O(n), etc. (Ada doesn't do this? Pity. Then I guess Ada can't
>be used for real-time systems. :-)


I admit I haven't read the specifications and definitions of all new
languages for the past twenty years. But I have *never* seen a language
specification that did this, except for certain assemblers that told you
how many machine cycles each instruction required to execute. I would
certainly appreciate some reference to a real-time programming language
that provides as part of its requirements/specifications bounds on the
various primitive operations it provides.


--
Kevin J. Weise kweise@colsa.com
COLSA Corp. Voice: 205-922-1512 ext. 2115
6726 Odyssey Drive
Huntsville, AL 35806
--

Return to the comp.compilers page.
Search the comp.compilers archives again.