Currently, there are many functions which follow a similar recursive processing of the syntax tree (nearly identical to Hadley's bquote2 function in Advanced R: Expressions.
Instead of iteratively performing operations across the same datastructure, it would drastically reduce the performance cost of running the static code analysis if all of these operations could be composed into a single operation (or a minimal subset of operations) which can then be lifted over the syntax tree in a minimal set of passes.
This is a long-term goal once the core functionality has stabilized.
Currently, there are many functions which follow a similar recursive processing of the syntax tree (nearly identical to Hadley's
bquote2function in Advanced R: Expressions.Instead of iteratively performing operations across the same datastructure, it would drastically reduce the performance cost of running the static code analysis if all of these operations could be composed into a single operation (or a minimal subset of operations) which can then be lifted over the syntax tree in a minimal set of passes.
This is a long-term goal once the core functionality has stabilized.