←back to thread

Anonymous recursive functions in Racket

(github.com)
88 points azhenley | 2 comments | 04 Sep 25 00:39 UTC | HN request time: 0.001s | source
Show context
CyberDildonics ◴[06 Sep 25 21:37 UTC] No.45153090[source]▶
I would rather use a loop so I can debug it.
replies(2): >>45153162 #>>45154253 #
treyd ◴[06 Sep 25 21:46 UTC] No.45153162[source]▶
Tail-recursive functions in Racket are optimized down to essentially for loops.
replies(1): >>45154267 #
1. stirfish ◴[07 Sep 25 00:44 UTC] No.45154267[source]▶
What's it like to debug them?
replies(1): >>45160586 #
2. rgherdt ◴[07 Sep 25 17:58 UTC] No.45160586[source]▶
One strategy is by "tracing" a function call:

https://docs.racket-lang.org/trace/