Ada has garbage collection

From: Wes Groleau (groleau+news_at_freeshell.org)
Date: 08/24/04 

Date: Mon, 23 Aug 2004 22:49:22 -0500

OK, we could argue semantics, but every language with
parameters/data on the call stack has garbage collection
for all those objects.

And Ada makes it far less necessary than some languages
to avoid pointers and use locals instead.

Many vendors use the heap for large things, but AFAIK,
they keep it transparent and do the "garbage collection"
just as well as if the objects stayed on the stack.

Of course, some problems/data structures almost demand
pointers, but with sensible encapsulation and package
designed, controlled types provide all the GC those things need.

How does that differ from C++ destructors?

Java couldn't afford to be without universal GC, because
it makes almost everything on the heap, and allows no
definition of destructors. 

-- 
Wes Groleau
Even if you do learn to speak correct English,
whom are you going to speak it to?
                     -- Clarence Darrow

Relevant Pages

  • Re: Is C99 the final C? (some suggestions)
    ... You mean vague terminologies like "stack"? ... wrap whatever "spawn" mechanism you have in your language (or use some ... >> and because of Java's bignum class, it meant that exposing a widening multiply ... >> you use to determine this is just related to examining the carry flag. ...
    (comp.lang.c)
  • Re: The Promise of Forth
    ... Do you think Ada and PL/1 would be as high as they are ... They can keep a language alive at the fringes. ... still another bunch of complications when the stack holds mixed types. ... For a different data type it would have to be *completely* rewritten: ...
    (comp.lang.forth)
  • Re: FORTH levels
    ... Most working on a collaborative project do not choose the programming language they are using: it is thrust upon them by the needs of the collaboration. ... When Iverson and Hui came up with J-- in part to remove APL's special character set and make it more "user friendly" not much of a community formed around it. ... But RPN does not require a visible stack, any more than any language requires a visible stack to rebuild its semantic trees from its flat expression. ...
    (comp.lang.forth)
  • Re: Statement on Schildt submitted to wikipedia today
    ... the C language definition clearly says otherwise. ... stack functionality at a minimum ... There was because it became unfashionably "racist" to speak of German ... have an appropriate newsgroups line in your header for your mail to be seen, ...
    (comp.lang.c.moderated)
  • Re: [OT] PostLisp, a language experiment
    ... a preconception that there isn't a language for which longer ... > latter method in Lisp, and C and many other languages so that the code ... >> apparently no runtime checks for stack mismatches, ... > the complexity and number of stack items for each definition. ...
    (comp.lang.lisp)