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 X-Google-Thread: 103376,5fe352a7b58a0dd6 X-Google-Attributes: gid103376,public X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!news1.google.com!proxad.net!news.tele.dk!news.tele.dk!small.news.tele.dk!uninett.no!news.net.uni-c.dk!sunsite.dk!dotsrc.org!news.dotsrc.org!not-for-mail Message-ID: <1360923.fGEqWSjcJk@linux1.krischik.com> From: Martin Krischik Subject: Re: Bye, bye? Newsgroups: comp.lang.ada Reply-To: martin@krischik.com Date: Thu, 03 Feb 2005 16:49:23 +0100 References: <36atatF4uinkuU1@individual.net> <36dnnkF52miv2U1@individual.net> <4202374f@news101.his.com> Organization: None User-Agent: KNode/0.8.0 MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7Bit NNTP-Posting-Host: 83.169.148.166 X-Trace: DXC=E G. Vincent Castellano wrote: > Wes Groleau wrote: >> Sometimes, reading a perl book, I am surprised that it's >> able to do something Ada-like (though not as pretty to >> Ada-accustomed eyes). > > I remember hearing a rumour that Larry Wall seriously considered writing > Perl 6 > in Ada. One of his quotes on the language: > > I remember being impressed with Ada because you could write an > infinite loop without a faked up condition. The idea being that in Ada > the typical infinite loop would normally be terminated by detonation. Maybe he found out how to do it in C/C++: for (;;) { } Martin -- mailto://krischik@users.sourceforge.net http://www.ada.krischik.com