From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,3ccb707f4c91a5f2
X-Google-Attributes: gid103376,public
From: bobduff@world.std.com (Robert A Duff)
Subject: Re: Java vs Ada 95 (Was Re: Once again,
 Ada absent from DoD SBIR solicitation)
Date: 1996/11/19
Message-ID: <E14Dn3.84w@world.std.com>#1/1
X-Deja-AN: 197431075
references: <325BC3B3.41C6@hso.link.com> <dewar.848239512@merv>
 <E11CEy.Gou@world.std.com> <dewar.848352338@merv>
organization: The World Public Access UNIX, Brookline, MA
newsgroups: comp.lang.ada
Date: 1996-11-19T00:00:00+00:00
List-Id: <comp.lang.ada>


In article <dewar.848352338@merv>, Robert Dewar <dewar@merv.cs.nyu.edu> wrote:
>Such interpretation is usually guided by what you want, but I am not so
>sure I agree that I want a huge overhead of locking and unlocking just
>so that unbounded strings shared between tasks "work" right.

So implement a full garbage collector, and your problem is solved.  ;-)

- Bob