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,b3f07bd1ad77d438
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!news4.google.com!fu-berlin.de!uni-berlin.de!individual.net!not-for-mail
From: Niklas Holsti <niklas.holsti@tidorum.invalid>
Newsgroups: comp.lang.ada
Subject: Re: The state of functional programming
Date: Fri, 30 Jul 2010 12:17:29 +0300
Organization: Tidorum Ltd
Message-ID: <8bfjlaFemlU1@mid.individual.net>
References: 
 <2adc4d8d-210e-429c-8188-9b1e99c2718e@d17g2000yqb.googlegroups.com>
 <g24nvegdi17t$.1azxwn1rwjixi$.dlg@40tude.net>
 <Xns9DC39A29C4AD7WarrensBlatherings@85.214.73.210>
 <1oubrlamjqe8q$.bdwkb9i7ys6b$.dlg@40tude.net>
 <Xns9DC47362DB91WarrensBlatherings@85.214.73.210>
 <a3iznu9uq49d$.1m9cupr81yhut$.dlg@40tude.net>
 <Xns9DC49BF262AB5WarrensBlatherings@81.169.183.62>
 <17hhchqy1a2si.1akul43vk1sd9.dlg@40tude.net>
 <Xns9DC4AD33D2F87WarrensBlatherings@81.169.183.62>
 <10uxuyvx8jhq5.1fhpgyjccj85g$.dlg@40tude.net>
Mime-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
X-Trace: individual.net nPo+7AZ/TGFLtrvi9xlTRghO84MlMi1kDPrONRJackJEF7F6d9
Cancel-Lock: sha1:dwo1aBbsHjERRfUOHwMO8ue/JWc=
User-Agent: Mozilla-Thunderbird 2.0.0.24 (X11/20100328)
In-Reply-To: <10uxuyvx8jhq5.1fhpgyjccj85g$.dlg@40tude.net>
Xref: g2news1.google.com comp.lang.ada:12707
Date: 2010-07-30T12:17:29+03:00
List-Id: <comp.lang.ada>

Dmitry A. Kazakov wrote:
> On Thu, 29 Jul 2010 21:01:35 +0000 (UTC), Warren wrote:
> 
>> Dmitry A. Kazakov expounded in
>> news:17hhchqy1a2si.1akul43vk1sd9.dlg@40tude.net: 
>>
>>> On Thu, 29 Jul 2010 19:19:49 +0000 (UTC), Warren wrote:
> 
>>>> But FP cannot always solve that "problem".
>>> Same in Ada. Not every legal Ada program is compilable. 
>> If an Ada program doesn't compile, then the programmer
>> hasn't spelled out the "how" correctly has he?  
> 
>    X : constant := 2**(2**(2**(2**9999_9999))) + 1:
> 
> is pretty much clear "how", legal, but not compilable.

... because the binary representation of the value of X needs too many 
bits, you mean? But I don't think that a compiler is required to 
represent the value in binary form *at compile time*; it could use a 
formulaic representation, which needs only a small amount of memory, as 
shown by your source line. Depending on how X is used in the rest of the 
program, this could make it possible to compile the program.

Of course I agree that a normal Ada compiler will not be able to compile 
such things.

-- 
Niklas Holsti
Tidorum Ltd
niklas holsti tidorum fi
       .      @       .