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=unavailable autolearn_force=no version=3.4.4
Path: 
 border1.nntp.dca1.giganews.com!nntp.giganews.com!news.snarked.org!feeder.erje.net!us.feeder.erje.net!goblin1!goblin2!goblin.stu.neva.ru!aioe.org!.POSTED!not-for-mail
From: Victor Porton <porton@narod.ru>
Newsgroups: comp.lang.ada
Subject: Lazy evaluation
Date: Thu, 18 Sep 2014 22:15:41 +0300
Organization: Aioe.org NNTP Server
Message-ID: <lvfb0p$tsc$1@speranza.aioe.org>
NNTP-Posting-Host: eoFKaNinZfc2iCCySkk0UQ.user.speranza.aioe.org
Mime-Version: 1.0
Content-Type: text/plain; charset="ISO-8859-1"
Content-Transfer-Encoding: 7Bit
X-Complaints-To: abuse@aioe.org
User-Agent: KNode/4.14
X-Notice: Filtered by postfilter v. 0.8.2
Xref: number.nntp.dca.giganews.com comp.lang.ada:189051
Date: 2014-09-18T22:15:41+03:00
List-Id: <comp.lang.ada>

Can we incorporate into Ada some kind of lazy evaluation (as in Haskell), 
without breaking backward compatibility?

If yes, would this be much useful?

-- 
Victor Porton - http://portonvictor.org