The form I originally proposed is a generalization of let/let* where
the compiler figures out the dependencies.  If the graph is not
acyclic, it would be an error.

Of course, one could add letrec pieces for strongly connected
components of the dependency graph.  One has to check that this
wouldn't muddle the scoping rules for such a construct.

Am Di., 15. Nov. 2022 um 21:23 Uhr schrieb Lassi Kortela <xxxxxx@lassi.io>:
>
> BTW, how is self-recursion expressed? These don't work in Scheme:
>
> (let ((! (lambda (n) (if (<= n 1) 1 (* n (! (- n 1)))))))
>    (! 10))
>
> (let* ((! (lambda (n) (if (<= n 1) 1 (* n (! (- n 1)))))))
>    (! 10))
>
> We need this:
>
> (letrec ((! (lambda (n) (if (<= n 1) 1 (* n (! (- n 1)))))))
>    (! 10))
>
> Would you need this:
>
> (let-values (((!) (using ! (lambda (n) (if (<= n 1) 1 (* n (! (- n 1))))))))
>    (! 10))