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,640b65cbfbab7216 X-Google-Attributes: gid103376,domainid0,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!news1.google.com!news.glorb.com!news.cs.univ-paris8.fr!feeder1-2.proxad.net!proxad.net!feeder2-2.proxad.net!newsfeed.arcor.de!newsspool1.arcor-online.net!news.arcor.de.POSTED!not-for-mail From: "Dmitry A. Kazakov" Subject: Re: Ada.Strings.Bounded Newsgroups: comp.lang.ada User-Agent: 40tude_Dialog/2.0.15.1 MIME-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Reply-To: mailbox@dmitry-kazakov.de Organization: cbb software GmbH References: <47f7028d$1_6@news.bluewin.ch> <47F749CB.30806@obry.net> <96x8my4o4m7e.fskzcb6i31ty$.dlg@40tude.net> <276e98e3-3b3b-4cbf-b85c-dcae79f11ec5@b5g2000pri.googlegroups.com> <013e1d52-c25f-49ea-83ef-6ac4860858bf@s13g2000prd.googlegroups.com> <8g2rpvi2ahu0$.1ebsyq5yu1whf.dlg@40tude.net> <9a3ad8ca-9f44-42db-9f7c-c5f9e3ee60f3@w1g2000prd.googlegroups.com> <1jdzw15tbj376$.nyv9yml75wj4$.dlg@40tude.net> <80c6fdca-1a89-4d98-b61d-9a405e57d8e5@s13g2000prd.googlegroups.com> <1wh7cbu67y4wz$.7iu8likx0fct.dlg@40tude.net> <144w648u50r6q.1erjxxu0cplbw.dlg@40tude.net> Date: Wed, 16 Apr 2008 10:16:44 +0200 Message-ID: NNTP-Posting-Date: 16 Apr 2008 10:16:45 CEST NNTP-Posting-Host: 2e511dbc.newsspool3.arcor-online.net X-Trace: DXC=UdUS1N8A;WO2:OR3:3gaE@McF=Q^Z^V3H4Fo<]lROoRA^;5]aA^R6>BCiBhVgJ7BiI[6LHn;2LCVN7enW;^6ZC`DIXm65S@:3>OI8`fBHlPlF@ X-Complaints-To: usenet-abuse@arcor.de Xref: g2news1.google.com comp.lang.ada:20973 Date: 2008-04-16T10:16:45+02:00 List-Id: On Tue, 15 Apr 2008 19:46:12 -0700 (PDT), Eric Hughes wrote: > On Tue, 15 Apr 2008 06:56:57 -0700 (PDT), Eric Hughes wrote: >> I assert that that Ada as currently defined has no bound on the size >> of numbers within universal_integer. > > On Apr 15, 8:58 am, "Dmitry A. Kazakov" > wrote: >> It specifies the lower bound and leaves the upper bound up to the vendor. >> Which by no means imply that there were no upper bound. > > That's an upper bound for a compiler, not for "Ada as currently > defined". Please check my language carefully. > >> Moreover, >> because the number of all instances of all existed, existing and future Ada >> compilers is obviously finite, there also exists the upper bound of >> universal_integer as a whole. > > "All compilers that were, all that are, and all that will ever be"-- > these are not part of the Ada language definition. My assertion > stands. Neither a bound nor its absence is required. The former does not imply the latter. Try a certified Ada compiler on: X : constant := 2**(2**(2**(2**(2**1000)))); > I would still like to know what you think universal_integer actually is. Universal_Integer is merely an integer type. -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de