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-Thread: 103376,81bb2ce65a3240c3
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Received: by 10.68.125.233 with SMTP id mt9mr2686116pbb.5.1335359459331;
        Wed, 25 Apr 2012 06:10:59 -0700 (PDT)
Path: 
 r9ni96944pbh.0!nntp.google.com!news2.google.com!news4.google.com!feeder2.cambriumusenet.nl!feeder1.cambriumusenet.nl!feed.tweaknews.nl!194.109.133.85.MISMATCH!newsfeed.xs4all.nl!newsfeed6.news.xs4all.nl!xs4all!feeds.phibee-telecom.net!eternal-september.org!feeder.eternal-september.org!mx04.eternal-september.org!.POSTED!not-for-mail
From: Nicholas Paul Collin Gloucester <Colin_Paul_Gloster@ACM.org>
Newsgroups: comp.lang.ada
Subject: Re: What would you like in Ada202X?
Date: Wed, 25 Apr 2012 13:10:58 +0000 (UTC)
Organization: A noiseless patient Spider
Message-ID: <jn8t52$vbe$1@dont-email.me>
References: <3637793.35.1335340026327.JavaMail.geo-discussion-forums@ynfi5>
Mime-Version: 1.0
Injection-Date: Wed, 25 Apr 2012 13:10:58 +0000 (UTC)
Injection-Info: mx04.eternal-september.org;
 posting-host="2Srru0s+AZlVUiMc87MPvA";
	logging-data="32110"; mail-complaints-to="abuse@eternal-september.org";
	posting-account="U2FsdGVkX1/hqYFhnxjoOD1h7uPxQz2KzhCiz6+ozuLcJ+KPzTX76g=="
User-Agent: slrn/0.9.9p1 (Linux)
Cancel-Lock: sha1:7QqjbE6Xja/SQtYEBS6O07f/XNM=
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Date: 2012-04-25T13:10:58+00:00
List-Id: <comp.lang.ada>

I would like infinite precision; infinite accuracy; and infinite
speed. In practice, I may need to compromise on at least one of
those. If I resort to a compromise, then I would benefit from being
able to absolutely trivially have different executables of the same
source code which differ in their mathematical implementations (such
as one executable using fixed-point numbers and another executable
exploiting fractions to represent real numbers etc.). I can already
substitute one reification of an abstract datatype by another, but I
want this without any overhead.