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: buffer1.nntp.dca1.giganews.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!usenet.blueworldhosting.com!feeder01.blueworldhosting.com!feeder.erje.net!1.eu.feeder.erje.net!newsfeed.fsmpi.rwth-aachen.de!newsfeed.straub-nv.de!eternal-september.org!feeder.eternal-september.org!mx02.eternal-september.org!.POSTED!not-for-mail From: "J-P. Rosen" Newsgroups: comp.lang.ada Subject: Re: Build language with weak typing, then add scaffolding later to strengthen it? Date: Tue, 26 May 2015 22:51:57 +0200 Organization: A noiseless patient Spider Message-ID: References: <127b004d-2163-477b-9209-49d30d2da5e1@googlegroups.com> <59a4ee45-23fb-4b0e-905c-cc16ce46b5f6@googlegroups.com> <46b2dce1-2a1c-455d-b041-3a9d217e2c3f@googlegroups.com> <3277d769-6503-4c7f-885f-3a730762b620@googlegroups.com> <048e1a3a-b034-4946-b6ec-0e7829330b73@googlegroups.com> Mime-Version: 1.0 Content-Type: text/plain; charset=windows-1252 Content-Transfer-Encoding: 8bit Injection-Date: Tue, 26 May 2015 20:50:47 +0000 (UTC) Injection-Info: mx02.eternal-september.org; posting-host="2b3884a634d8f846e0712b4e3a92507a"; logging-data="14975"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/9otEwqKoLV8/rjJy1p8Vu" User-Agent: Mozilla/5.0 (Windows NT 6.1; WOW64; rv:31.0) Gecko/20100101 Thunderbird/31.7.0 In-Reply-To: <048e1a3a-b034-4946-b6ec-0e7829330b73@googlegroups.com> Cancel-Lock: sha1:nyUFTBEZV1XER9kge+HM2e9KdRI= Xref: number.nntp.giganews.com comp.lang.ada:193322 Date: 2015-05-26T22:51:57+02:00 List-Id: Le 26/05/2015 18:19, Shark8 a écrit : > On Tuesday, May 26, 2015 at 7:39:08 AM UTC-6, J-P. Rosen wrote: >> >> (Note on the examples I took: in a previous life, I worked on an Ada83 >> compiler. It took me much more time to implement code generation for >> array aggregates than the whole design and implementation of the tasking >> system). > > That is amazing -- I never would have guessed that array aggregates would be more difficult than the entire tasking system. > Yes. The order of evaluation of ranges and components, and the rule about empty arrays not raising Constraint_Error, makes any naive evaluation order wrong. And the order of evaluation is not the same for a bidimensional array and an array of arrays that have the same aggregate! Note: I mentionned it was Ada83. IIRC, things have been a bit relaxed since - quite a long time I didn't look into it. -- J-P. Rosen Adalog 2 rue du Docteur Lombard, 92441 Issy-les-Moulineaux CEDEX Tel: +33 1 45 29 21 52, Fax: +33 1 45 29 25 00 http://www.adalog.fr