That's a great overview. Yeah they are asymmetric, Wikipedia says symmetric and asymmetric correspond to coroutines and semicoroutines. They are also stackful and delimited. They are single shot by design, though I could easily make it possible to restart the generator from scratch if needed.

As for single prompt vs multiprompt... I'm not too sure about this one. I have a check to prevent recursion but nesting generators shouldn't be a problem since they keep track of their own callers.

I think lone's generators have composability issues due to the stack separation. For example, calling a generator g2 inside another generator g1 doesn't transparently yield values from g2 to g1's caller. I've been wondering about how to fix this without a Python-like yield from primitive.

The idea is to create a language good enough to build a Lisp user space for Linux. I didn't dare to call it a lisp machine at first but other users suggested that when it was first submitted here on HN. Here's the discussion:

https://news.ycombinator.com/item?id=38126052

I'm doing some plumbing work on lone right now, then I'll start designing the iterator protocol. Gotta fix some usability details in the generators to make them more pleasant to use but I'm really proud of the fact that they even work at all. I'll read about typescript generators and try to understand what makes them great to use.

I love his blog. I think I've read almost the entirety of it. Here's his article about delimited continuations:

https://www.wingolog.org/archives/2010/02/26/guile-and-delim...

I even cited it in my own delimited continuations article:

https://www.matheusmoreira.com/articles/delimited-continuati...

After publishing that I actually emailed him about it. I wanted to show him how I solved the interleaving stacks problem he outlined in that article. No idea if he ever saw the email but his about page does mention the fact he doesn't check it often.