From: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: Cumbersome Polymorphism
Date: 1997/01/29
Date: 1997-01-29T00:00:00+00:00 [thread overview]
Message-ID: <dewar.854545926@merv> (raw)
In-Reply-To: JSA.97Jan27145652@alexandria
"> It is perfectly possible to hide allocation and deallocatoin from an
> Ada programmer -- just look at Ada.Unbounded.Strings as an example.
> Note that this also shows that variable length items can be handled
> in a completely transparent manner."
It is not at all clear that garbage collection would increase the efficiency
of an implementatoin of unbounded strings in the general case, what other
data do you have besides intuition for such a claim (and remember from my
SPITBOL background that I am a little familiar with GC, also see the 1977
paper in SP&E :-)
next prev parent reply other threads:[~1997-01-29 0:00 UTC|newest]
Thread overview: 12+ messages / expand[flat|nested] mbox.gz Atom feed top
1997-01-23 0:00 Cumbersome Polymorphism Richard Irvine
[not found] ` <5c9put$48t@hetre.wanadoo.fr>
1997-01-25 0:00 ` Robert A Duff
1997-01-25 0:00 ` James O'Connor
1997-01-26 0:00 ` Brian Rogoff
1997-01-26 0:00 ` Robert Dewar
1997-01-25 0:00 ` James O'Connor
1997-01-27 0:00 ` Jon S Anthony
1997-01-29 0:00 ` Robert Dewar [this message]
1997-01-27 0:00 ` Norman H. Cohen
1997-01-28 0:00 ` Richard Irvine
1997-01-28 0:00 ` Dave Gibson
1997-01-28 0:00 ` Jon S Anthony
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox