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=-0.3 required=5.0 tests=BAYES_00, REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!mx02.eternal-september.org!feeder.eternal-september.org!aioe.org!.POSTED!not-for-mail From: "Dmitry A. Kazakov" Newsgroups: comp.lang.ada Subject: Re: Languages don't matter. A mathematical refutation Date: Thu, 9 Apr 2015 11:38:10 +0200 Organization: cbb software GmbH Message-ID: References: <871tk1z62n.fsf@theworld.com> <87oan56rpn.fsf@jester.gateway.sonic.net> <877fts7fvm.fsf@jester.gateway.sonic.net> <87twwv66pk.fsf@jester.gateway.sonic.net> <32ecaopodr1g.1xqh7ssdpa2ud.dlg@40tude.net> <87pp7j62ta.fsf@jester.gateway.sonic.net> <87pp7hb2xo.fsf@jester.gateway.sonic.net> <5rxvgyes5xg8.1mqq86gacbsb1.dlg@40tude.net> <87lhi5ayuv.fsf@jester.gateway.sonic.net> <87oan0aote.fsf@jester.gateway.sonic.net> <878ue3ff6y.fsf@jester.gateway.sonic.net> Reply-To: mailbox@dmitry-kazakov.de NNTP-Posting-Host: w2sqUGEBZqsVBYNL7Ky3Kg.user.speranza.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit X-Complaints-To: abuse@aioe.org User-Agent: 40tude_Dialog/2.0.15.1 X-Notice: Filtered by postfilter v. 0.8.2 Xref: news.eternal-september.org comp.lang.ada:25487 Date: 2015-04-09T11:38:10+02:00 List-Id: On Thu, 09 Apr 2015 10:55:38 +0200, Georg Bauhaus wrote: > On 08.04.15 23:16, Randy Brukardt wrote: >> That's what I call "trained ape" programming. It's so easy, anyone can do >> it, so anyone does, and we get the mounds of crapware out there that barely >> works and steals your identity at the same time. Bah-humbug.;-) > > Suppose > > (1) there exists an implementation of Ada that supports automatic > memory management(*), and > > (2) that doing all of the following becomes really easy: > - to specify a pool for objects that are handled automatically, > - to explain what that means, and > - to pick a pool that exists and is portable (sort of). > > Then, I think, these conditions will describe something one might > have come to expect of Ada: it keeps promises (to be GC-able) and > makes everything explicit in source. > > In addition, the properties of the collector and how it affects the > program might be much more visible and manageable than in many other > main stream languages. > > (Or else, at least provide more efficient, more predictable containers > based on contracts. ;-) And the smiley means? You certainly know that there is no way to contract [*] GC. GC is non-functional and unrelated to the program behavior, which is another way to explain why GC is neither low nor high level. It is non-existent. -------------------- * True or false contracts equally. -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de