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
X-Received: by 10.42.197.69 with SMTP id ej5mr10778483icb.7.1411134682714;
 Fri, 19 Sep 2014 06:51:22 -0700 (PDT)
Path: 
 border1.nntp.dca1.giganews.com!h15no1747578igd.0!news-out.google.com!rp1ni1431igb.0!nntp.google.com!border1.nntp.dca.giganews.com!nntp.giganews.com!local2.nntp.dca.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Fri, 19 Sep 2014 08:51:22 -0500
Date: Fri, 19 Sep 2014 09:51:21 -0400
From: Peter Chapin <PChapin@vtc.vsc.edu>
User-Agent: Mozilla/5.0 (Windows NT 6.1; WOW64;
 rv:31.0) Gecko/20100101 Thunderbird/31.1.1
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: Re: Lazy evaluation
References: <lvfb0p$tsc$1@speranza.aioe.org>
In-Reply-To: <lvfb0p$tsc$1@speranza.aioe.org>
Message-ID: <85idneIsZeZHqYHJRVn_vwA@giganews.com>
X-Usenet-Provider: http://www.giganews.com
X-Trace: 
 sv3-MQwSOFjK8z/aQxm8+FRiI/DLHmb1togb7MYLscQn0oAH7DmbfLflA0TMKJnOoeiwMdOxvL1/y8hpaFS!oWvQpS401OXcubQH+sWzLQrxvr4cZn+FhWLtysaVvse6yZejHNOUS3g+kX4n1QQ=
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint
 properly
X-Postfilter: 1.3.40
X-Original-Bytes: 1711
Content-Type: text/plain; charset=utf-8
Content-Transfer-Encoding: 7bit
Xref: number.nntp.dca.giganews.com comp.lang.ada:189057
Date: 2014-09-19T09:51:21-04:00
List-Id: <comp.lang.ada>

On 2014-09-18 15:15, Victor Porton wrote:

> Can we incorporate into Ada some kind of lazy evaluation (as in Haskell), 
> without breaking backward compatibility?
> 
> If yes, would this be much useful?

Speaking in generalities lazy evaluation tends to make it difficult to
reason about the performance characteristics of a program. It is my
understand this is sometimes a problem for Haskell programs that have
significant performance requirements. Thus it appears that lazy
evaluation would be an anathema as far as Ada is concerned.

Peter