01:02 <dataangel> how difficult would it be with a #lang or macro to make it so given a defun I can extract all the defuns called by that defun recursively? it's fine if it only goes as far as tracking defuns in my lang and stops once it hits racket's bulitin/lib functions. I'm uncertain in a macro context how difficult it is to take a symbol and query "what would this resolve to in this lexical context?" which you would need to handle imported

01:02 <dataangel> functions

06:14 <dzoe> dataangel: it doesn't - it works in normal vector but access it concurrently from multiple hw threads

07:27 <dzoe> dataangel: the mastermind behind TR is on this channel as well, you can try asking him directly (samth) - however from the talk at RacketCon I got the impression that even TR is going strong ;-)

07:29 <dzoe> dataangel: and about the recursive evaluation of procedure calls - I think you more likely want to see the #%app usage in the fully expanded code. It sounds feasible but I do not have enough expertise to point you in the right direction here,

07:30 <dzoe> "Calling" is probably not gonna happen a lot of time as inlining and codegen gets in the way. (Which is actually a good thing)