|
|
|
|
|
|
by gus_massa
678 days ago
|
|
|
I'm not sure what you want, but Racket/Scheme (and perhaps Clojure) have continuations that can be used for something similar [1]. Perhaps you need continuation marks and advanced macrology, that I'm afraid of. > (no) return all; // proceeds right after a call into recursion What about f -> g -> f -> g -> f -> g -> f -> g -> f ? And f -> g -> f -> g -> f -> X -> f -> g -> f -> g -> f ? [1] https://docs.racket-lang.org/guide/conts.html |
|
|