feat: (WIP) Static evaluation via constant folding

[acl-cqc]

So far:

• Inlining of direct Calls, Conditionals, TailLoops and (trivially) DFGs
• ...sufficient to evaluate a doubly-recursive fibonacci and an iterative factorial
• Hacky extension of constant-folding to allow specifying entry points
• Fix constant-folding not to eliminate unused Cases
• And simplify find_needed_nodes

TODO:

• Fix up paths for python-generated example .json's
• CallIndirect...this probably depends upon outcome of Make Value::Function contain only the Node (index) of a FuncDefn #1856, we may need a different notion of Value, and/or there is just devirtualization
• CFG
• Handle incoming nonlocal edges - see Method for copying a subgraph respecting nonlocal edges #1833