Web languages and graph convolution

Consider the following:
@(JaveRoutine,Arglist)

I interpret that to mean, take a Java routine, construed as a graph, and convolve it with an argument list and the result is a graph. I can change this a bit:
@(JaveRoutine(Arglist1,Arglit2,Arglist3,...)

My claim is that the TE above holds, that is a Java code can be construed as a convolving graph, one that tries to find matches in another convolving graph of arguments. The two are commutative.  Normally we see the java code as mobile against a fixed argument arrangement in memory. Bur, the virtual machine in reality the a graph convolver.

The graph machine, when is sees a BSON scrip, matches it against the next element, and runs the Statement, os SubQuery. Anything above the graph layer is construed as a query.

Related notes:
I still lurk within the web confines of the B ON,JSON,UBSON and variants.  They are getting real close, real close to something Cray XMT supercomputers could use. UBSON is an attempt, and demands strict adheranve to JSON.  One point to the BSON folks, do not forget that JSON is our TE, out string version of nested store. But the BSON folks anticipate variable expressions in graphs, so we are almost there. I have also seen the four of our basic ugly set used simultaneously as descriptive and query!!

But still, my message.  Remember, local sequences, local data, few look ups and very super fast sequencing through the expression tree.  Fixed format fields at the graph layer, keep the variable length data separate until you need it, expose the variable types and operator overloads in the fixed field.  I have called it the link, we can rename it the predicate. We need a node pointer, worried about space, make int16.

The ides is toabstract the graph layer out of XBSON. The fundamental data can be matched and is orangaized as a descending graph among a set of descending graphs.  That is,  in subject/predicate/object, the subject is a key string associated with the Dot and Comma at the predicate.  The object descending graph bound by the pointer.  The graph layer also knows about named graphs, that is the only reason it would ever open up the subject.

Everything above that, XBSON can have, and really, have at it