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,FREEMAIL_FROM
	autolearn=ham autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,38fc011071df5a27
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2003-06-15 11:21:03 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!newsfeed.stueberl.de!news-FFM2.ecrc.net!news.cesnet.cz!crax.cesnet.cz!news.felk.cvut.cz!not-for-mail
From: Sergey Koshcheyev <serko84@hotmail.com>
Newsgroups: comp.lang.ada
Subject: Re: Ideas for Ada 200X
Date: Sun, 15 Jun 2003 20:05:28 +0200
Organization: Czech Technical University
Message-ID: <bcich6$309c$1@ns.felk.cvut.cz>
References: <bebbba07.0306041438.6cf89e79@posting.google.com>
 <uznkwflx8.fsf@nasa.gov> <bebbba07.0306060915.c4e478d@posting.google.com>
 <wccsmqnj6ub.fsf@shell01.TheWorld.com>
 <bebbba07.0306062224.3d470927@posting.google.com> <uhe6zw201.fsf@nasa.gov>
 <bebbba07.0306092233.2365dbd5@posting.google.com>
 <slrnbebc2b.ht.randhol+abuse@kiuk0152.chembio.ntnu.no>
 <bebbba07.0306101640.19178e81@posting.google.com>
 <3EE7CC70.E1FD3A67@adaworks.com>
 <bebbba07.0306121116.33e4741@posting.google.com>
 <bcbu9i$hgu5j$1@ID-175126.news.dfncis.de> <AwvGa.1228118$F1.143267@sccrnsc04>
 <3EECA772.4B662024@adaworks.com>
NNTP-Posting-Host: r2c113.mistral.cz
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii; format=flowed
Content-Transfer-Encoding: 7bit
X-Trace: ns.felk.cvut.cz 1055700326 98604 62.245.66.113 (15 Jun 2003 18:05:26
 GMT)
X-Complaints-To: usenet@ns.felk.cvut.cz
NNTP-Posting-Date: Sun, 15 Jun 2003 18:05:26 +0000 (UTC)
User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.4b) Gecko/20030520
X-Accept-Language: en, ru, cs
In-Reply-To: <3EECA772.4B662024@adaworks.com>
Xref: archiver1.google.com comp.lang.ada:39204
Date: 2003-06-15T20:05:28+02:00
List-Id: <comp.lang.ada>

Richard Riehle wrote:
> So, if there is some approach that will ensure that my i += 1 could not be a
> mistake
> for i := 1,  that would go a long way toward making it an acceptable construct.

But is there any approach that can ensure that i := i + 1 could not be 
mistaken for i := i - 1? Why was "+" and "-" included in the language 
then? :-)

Sergey.