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: 
 border1.nntp.dca3.giganews.com!border3.nntp.dca.giganews.com!border1.nntp.dca.giganews.com!nntp.giganews.com!goblin2!goblin.stu.neva.ru!news.teledata-fn.de!newsfeed.arcor.de!newsspool2.arcor-online.net!news.arcor.de.POSTED!not-for-mail
Date: Tue, 09 Jul 2013 12:27:01 +0200
From: "G.B." <rm-dash-bau-haus@dash.futureapps.de>
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.7;
 rv:17.0) Gecko/20130620 Thunderbird/17.0.7
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: Re: The future of Spark . Spark 2014 : a wreckage
References: <d84b2eb2-eab3-4dec-917c-0498473c1e93@googlegroups.com>
 <87hag4ahu5.fsf@mid.deneb.enyo.de>
 <1rbbala6i0jcl$.dswyfcctu6vs$.dlg@40tude.net>
 <51dbca43$0$6572$9b4e6d93@newsspool3.arcor-online.net>
 <1gs2slsmkpvbf.a9h84b9jcowi$.dlg@40tude.net>
In-Reply-To: <1gs2slsmkpvbf.a9h84b9jcowi$.dlg@40tude.net>
Content-Type: text/plain; charset=Big5
Content-Transfer-Encoding: 8bit
Message-ID: <51dbe575$0$6565$9b4e6d93@newsspool3.arcor-online.net>
Organization: Arcor
NNTP-Posting-Date: 09 Jul 2013 12:27:01 CEST
NNTP-Posting-Host: e21f0ff1.newsspool3.arcor-online.net
X-Trace: DXC=0m>N`@l;
 T>F^B]`=U:WelBMcF=Q^Z^V3H4Fo<]lROoRA8kF<OcfhCOK5LCKWkH=]UOnc\616M64>JLh>_cHTX3jMVMNL_^M;
 diL
X-Complaints-To: usenet-abuse@arcor.de
X-Original-Bytes: 2275
Xref: number.nntp.dca.giganews.com comp.lang.ada:182368
Date: 2013-07-09T12:27:01+02:00
List-Id: <comp.lang.ada>

On 09.07.13 10:58, Dmitry A. Kazakov wrote:
> On Tue, 09 Jul 2013 10:30:59 +0200, Georg Bauhaus wrote:
> 
>> On 09.07.13 09:40, Dmitry A. Kazakov wrote:
>>> On Mon, 08 Jul 2013 22:59:30 +0200, Florian Weimer wrote:

>>>> This is nothing new.  Boolean implication p ¡÷ q is already written as
>>>> P <= Q in Ada.
>>>
>>> Where?
>>
>> In Boolean expressions. With obvious, I think, abbreviations
>> and referring to ordering of (False, True), and (0, 1),
>>
>> p q | p ¡÷ q   (p <= q)
>> -----------------------
>> 1 1 |   1       True
>> 1 0 |   0       False
>> 0 1 |   1       True
>> 0 0 |   1       True
> 
> This is p=>q
>
>      p=>q  =def=  not p or q

"Boolean implication p ¡÷ q is already written as
 P <= Q in Ada."

As shown above. "=>" has no "Boolean" meaning in Ada.
(It has, in Prolog.) In implementation defined aspects,
GNAT is free to assign "depends" to "=>", UML style.

I guess we need to adapt to even many overloadings
if symbolophobia is part of Ada culture.