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: 
 eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!news.eternal-september.org!feeder.eternal-september.org!aioe.org!.POSTED!not-for-mail
From: Victor Porton <porton@narod.ru>
Newsgroups: comp.lang.ada
Subject: Re: Generators/coroutines in future Ada?
Date: Mon, 10 Jul 2017 16:38:37 +0300
Organization: Aioe.org NNTP Server
Message-ID: <ok001a$rhm$1@gioia.aioe.org>
References: <oju353$b75$1@gioia.aioe.org>
NNTP-Posting-Host: UZPBofpaGWLolaA02L4QDw.user.gioia.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.10
X-Notice: Filtered by postfilter v. 0.8.2
Xref: news.eternal-september.org comp.lang.ada:47341
Date: 2017-07-10T16:38:37+03:00
List-Id: <comp.lang.ada>

Victor Porton wrote:

> Is it possible to implement generators and coroutines (like as in Python)
> in a future version of Ada?
> 
> I am not an expert on how generators are implemented. Is it possible in a
> language like Ada?
> 
> Well, I think it could add additional reliability, because programming of
> processing of different "streams" becomes easier and thus less error
> prone.

Don't generators require closures?

But AFAIK Ada does not support closures.

Are closures really needed to implement generators?

It is nearly impossible to add closures to Ada, right?

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