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!feeder.eternal-september.org!aioe.org!.POSTED!not-for-mail From: "Dmitry A. Kazakov" Newsgroups: comp.lang.ada Subject: Re: some trivial questions? Date: Thu, 23 Nov 2017 09:37:28 +0100 Organization: Aioe.org NNTP Server Message-ID: References: <6a5368c5-f015-4dcb-9291-e77b40fa1bf1@googlegroups.com> NNTP-Posting-Host: MyFhHs417jM9AgzRpXn7yg.user.gioia.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 7bit X-Complaints-To: abuse@aioe.org User-Agent: Mozilla/5.0 (Windows NT 6.1; WOW64; rv:52.0) Gecko/20100101 Thunderbird/52.4.0 Content-Language: en-US X-Notice: Filtered by postfilter v. 0.8.2 Xref: feeder.eternal-september.org comp.lang.ada:49096 Date: 2017-11-23T09:37:28+01:00 List-Id: On 23/11/2017 01:19, Randy Brukardt wrote: > I agree with your points, but how do you prove compatibility of whatever > model is adopted? Given that Ada is currently defined with English wording, > it is very hard to prove if any change is compatible other than the most > trivial ones. Is it really necessary? I mean it is not different from the promises each compiler vendors gives. We trust that Ada standard is possible to implement on a machine X. A more fundamental language core is kind of machine Y. Nothing to prove, actually. -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de