On 2021-06-14 19:11 +0200, Marc Nieper-Wißkirchen wrote:
> >
> > That is a very nice example, though notably more complicated than the
> >> basic recursive version.  It's also unfortunate that we don't have
> >> portable access to delimited continuation operators.
> >>
> >
> > Is it much more complicated than the basic recursive version? The code
> > looks a bit blown up because I have used the bare, unsugared control
> > operators. One can probably come up with some syntax (or a single procedure
> > that packages everything) that allows recursion where a procedure called
> > deep inside is called in tail-context with respect to the outer call.
> >
> > If delimited control operators aren't available, one can still try an
> > emulation with call/cc. Besides, there doesn't seem to be a good excuse for
> > a Scheme not shipping with delimited continuations (or primitives on which
> > they can be built).
> >
>
> Alternatively, you can simply build the partial continuation by hand:

Thanks for the examples.  With (emulated) call-with-prompt it should
be pretty easy to implement all of this in the sample implementation.
I'll have a new draft ready soon.

Thanks again!

--
Wolfgang Corcoran-Mathe  <xxxxxx@sigwinch.xyz>

"In these days the angel of topology and the devil of abstract algebra
fight for the soul of each individual mathematical domain."
--Hermann Weyl