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=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,7eaf9f2597de2259 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2001-10-04 20:22:15 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!cyclone.bc.net!sunqbc.risq.qc.ca!newsfeed.cwix.com!sjc-peer.news.verio.net!news.verio.net!sea-read.news.verio.net.POSTED!not-for-mail Newsgroups: comp.lang.ada From: Brian Rogoff Subject: Re: on package naming, should the word In-Reply-To: <9pivhi02j7f@drn.newsguy.com> Message-ID: <20011004200752.R19930-100000@shell5.ba.best.com> References: <9pif1o01btl@drn.newsguy.com> <3BBCC7EF.6C59C85D@otelco.net> <20011004150358.M14557-100000@shell5.ba.best.com> <9pivhi02j7f@drn.newsguy.com> MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Date: Fri, 05 Oct 2001 03:22:13 GMT NNTP-Posting-Host: 206.184.139.136 X-Complaints-To: abuse@verio.net X-Trace: sea-read.news.verio.net 1002252133 206.184.139.136 (Fri, 05 Oct 2001 03:22:13 GMT) NNTP-Posting-Date: Fri, 05 Oct 2001 03:22:13 GMT Organization: Verio Xref: archiver1.google.com comp.lang.ada:13761 Date: 2001-10-05T03:22:13+00:00 List-Id: On 4 Oct 2001 MM@MM wrote: > In article , Preben > says... > > > >On 4 Oct 2001 18:38:08 -0500, Larry Kilgallen wrote: > >>In article <20011004150358.M14557-100000@shell5.ba.best.com>, Brian Rogoff > >> writes: > >> > >>> About redundancy? Go to http://www.averstar.com/~stt/tools99lang.htm and > >>> click on the section titled "The Big Trick to Catching Errors Early". > > "And the winner is... [...snip...] > gee, Ada beat Java and C and C++, but we all knew that :) Actually, Tucker pointed out some places where Eiffel, Java and even C++ did well better than Ada. I really dislike Eiffel, and class obsessed languages (sounds commmunist to me! ;-) but I have to admit that it has a more elaborate assertion mechanism than Ada. Anyways, to digress a bit, if you're interested in some "academic fiddling" which may have some impact on the safety issues you should look up dependent types. Hongwei Xi has done some interesting work; start here http://www.ececs.uc.edu/~hwxi/ http://www.ececs.uc.edu/~hwxi/Xanadu/Xanadu.html Another intriguing avenue of research is proof carrying code. The bummer to me is that noone makes an Ada like language which incorporates these new concepts. Oh well, I like ML too I guess it isn't all bad :-) -- Brian