Under the "Known limitations" section, the author mentions that anonymous functions get skipped. That might be a dealbreaker for some. Since this program just

Under the "Known limitations" section, the author mentions that anonymous functions get skipped. That might be a dealbreaker for some. Since this program just walks the statically apparent callgraph, you'll get an under-approximation of the behavior of your program. If you'd like an over-approximation, something like control-flow analysis can handle cases with anonymous functions. [^1] [^2] [^3] There are still some limitations, but CFA is really powerful. (Anyone curious can contact me (see my blog) if you want more information on CFA.) [^1]: https://lambdaland.org/posts/2021-05-20_cfa/ https://lambdaland.org/posts/2021-05-20_cfa/ [^2]: https://en.wikipedia.org/wiki/Control_flow_analysis https://en.wikipedia.org/wiki/Control_flow_analysis [^3]: https://www.ccs.neu.edu/home/shivers/papers/pldi88.pdf https://www.ccs.neu.edu/home/shivers/papers/pldi88.pdf