> Coming from a PL perspective, this is obvious. The solution is in fact _not_ obvious even from a PL perspective. [Xavier Leroy](https://xavierleroy.org/talks/compilation-agay.pdf), famous for his work on OCaml, outlines multiple closure representations including their handling of recursive and mutually recursive functions.
-- You are receiving this because you are subscribed to this thread. Reply to this email directly or view it on GitHub: https://github.com/apache/incubator-tvm/issues/4143#issuecomment-552700357
