A new theory of "nested action graphs".

These are graphs where the nodes can recursively contain another (nested)
action graph.  The recursion has to eventually bottom out, either with
a nested empty graph, or with a "data" value of any other type you
want.

There is a recursion principle for defining recursive functions over
the node elements.