The calculus nodes and the binders -- a derivative, an integral, a limit, a sum, a product, an extremum over a
set, a lambda and its application -- have no compiled form, and both compilers refuse them alike. Each is
computed by evaluation, which compiling them would have to repeat at every call, as slowly as evaluating; so the
caller evaluates once and compiles what comes back. The LINQ compiler reached the bound variable first and said
it was not among the arguments, which named the symptom rather than the node.
https://github.com/asc-community/AngouriMath/issues/2195