From: Peter Chapin <PChapin@vtc.vsc.edu>
Subject: Re: Lazy evaluation
Date: Fri, 19 Sep 2014 09:51:21 -0400
Date: 2014-09-19T09:51:21-04:00 [thread overview]
Message-ID: <85idneIsZeZHqYHJRVn_vwA@giganews.com> (raw)
In-Reply-To: <lvfb0p$tsc$1@speranza.aioe.org>
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
next prev parent reply other threads:[~2014-09-19 13:51 UTC|newest]
Thread overview: 5+ messages / expand[flat|nested] mbox.gz Atom feed top
2014-09-18 19:15 Lazy evaluation Victor Porton
2014-09-19 13:51 ` Peter Chapin [this message]
2014-09-19 14:47 ` Dmitry A. Kazakov
2014-09-23 12:01 ` Victor Porton
2014-09-23 19:12 ` Dmitry A. Kazakov
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox