They set every node has a physical presences, bits in the machine. So they named the null character as the undersore, I think, _. This is also an indusry standard, macro started it, and it was used in maany assembly languages to mean, just like the other but different.
But I love it, and G adopts _ as its inhernet G graph. Want to know what G knows? _
While we are at it, lets make the convolution operator the lightest weight set perator, it always floats to he top and at the top of what G know then is: G itself knows
: _.(self@other) Written in TE. But sens @ is lightweight, this becomes
: _.self,_.other but @ is comutative, so that can be _.other@_.self.
Since both other and self are conformal nested diected graphs (Version 1.x) , then either form is equivalent, G is essentially one graph descending into two subgraphs, connected by the convolution operator. That is G (local). The question is do you want G fully expanded.
G simple convolves with the one or a while, then with the other until they have exhausted each other. This simplicity is built into G, that is why it is only 280 lines, each of two G graphs mainly carry their own state information.
Does G know Sql?
_select 'Hello world'; works my my G machine. Later that will become: _SQL:select 'Hello world'; when G internals admit of some specialization, then I use the schema. Hey, I am happy with SPARQL, they are getting it.
No comments:
Post a Comment