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=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,1cf653444208df72
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2001-10-10 08:16:35 PST
Path: 
 archiver1.google.com!news1.google.com!sn-xit-02!supernews.com!news.tele.dk!small.news.tele.dk!130.133.1.3!fu-berlin.de!uni-berlin.de!ailinel.cbb-automation.DE!not-for-mail
From: dmitry@elros.cbb-automation.de (Dmitry Kazakov)
Newsgroups: comp.lang.ada
Subject: Re: ada vs. cpp
Date: Wed, 10 Oct 2001 15:16:32 GMT
Message-ID: <3bc461ef.27216781@news.cis.dfn.de>
References: <mailman.1002724898.8980.comp.lang.ada@ada.eu.org>
NNTP-Posting-Host: ailinel.cbb-automation.de (212.79.194.99)
X-Trace: fu-berlin.de 1002726992 22381613 212.79.194.99 (16 [77047])
X-Newsreader: Forte Free Agent 1.21/32.243
Xref: archiver1.google.com comp.lang.ada:14161
Date: 2001-10-10T15:16:32+00:00
List-Id: <comp.lang.ada>

On Wed, 10 Oct 2001 10:36:01 -0400, "Steven Deller"
<deller@smsail.com> wrote:

>I also believe one could create a symbolic processing type, which just
>collected operators without evaluation, and doing symbolic simplification
>before assignments.  True lazy evaluation.  Hmmm -- might be interesting to
>define, since there would have to be symbolic literals.

[OT]

Maybe for Ada 2100 (:-)). It could be interesting to add lazy
evaluation mode. Something like Algol's by-name parameters. If an
object is of lazy subtype it is evaluated each time one accesses it.
When the actual parameter is converted to a lazy subtype a
coresponding parameterless function is generated from its expression. 

Two main advantages would be definition of short-circuit operations in
the language terms thus making "and then" / "or else" overloadable
operations, and [of course (:-))] closures .

Regards,
Dmitry Kazakov