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.9 required=5.0 tests=BAYES_00 autolearn=unavailable autolearn_force=no version=3.4.4 Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!news.eternal-september.org!feeder.eternal-september.org!1.eu.feeder.erje.net!feeder.erje.net!2.us.feeder.erje.net!nntp.club.cc.cmu.edu!micro-heart-of-gold.mit.edu!newsswitch.lcs.mit.edu!nntp.TheWorld.com!.POSTED!not-for-mail From: Robert A Duff Newsgroups: comp.lang.ada Subject: Re: C# new features (v.7) Date: Sat, 17 Dec 2016 16:56:37 -0500 Organization: The World Public Access UNIX, Brookline, MA Message-ID: References: <5f542dff-8dd0-49b8-8228-3ccc8248c57d@googlegroups.com> <276a2153-b81f-4e19-9615-530e798e5798@googlegroups.com> <1533893062.503569684.598007.laguest-archeia.com@nntp.aioe.org> <877f6y3lzo.fsf@nightsong.com> NNTP-Posting-Host: shell02.theworld.com Mime-Version: 1.0 Content-Type: text/plain X-Trace: pcls7.std.com 1482011797 21069 192.74.137.72 (17 Dec 2016 21:56:37 GMT) X-Complaints-To: abuse@TheWorld.com NNTP-Posting-Date: Sat, 17 Dec 2016 21:56:37 +0000 (UTC) User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/24.3 (gnu/linux) Cancel-Lock: sha1:z1hxrQWaWDHF3V8x9PcOOhyfunw= Xref: news.eternal-september.org comp.lang.ada:32907 Date: 2016-12-17T16:56:37-05:00 List-Id: "Nasser M. Abbasi" writes: > On 12/17/2016 4:09 AM, Paul Rubin wrote: > >> Younger programmers (those who didn't grow up dealing with old slow >> machines with little memory) generally use lower performance but more >> convenient languages rather than C, Ada, etc. They're protected from >> integer overflow by bignums, memory errors by bounds checking, > ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ >> alloc/free errors by garbage collection, etc. > > Which one of these so called "modern" and "fun" languages > that Younger programmers use has bounds checking built in? "bounds checking" means "array bounds checking". Almost all languages have that (C being a notable exception). I think you're thinking of "range checking", as in Ada where you declare something to be "range 1..Integer'Last", and it checks that you didn't assign 0 or -123 to it. Fewer languages have that. > Can one even declare a variable in these languages with restricted > bounds? May be I am misunderstanding the context you are thinking > of here. > > I thought Ada was unique in this area, one of the few language > if not only one. Not unique. Ada got the idea from Pascal. And Modula-N and other Wirthian languages have it. > ...Ada also has got too complex from its > original1983 version. It was already too complex in 1983. > --Nasser - Bob