Stefan Plantikow

Many real world knowledge graphs will be "mixed graphs", in the sense that they contain different types of nodes connected via different types of edges. Usually such graphs will assume...

Interesting, so I understand you to suggest to rather limit the set of valid expressions of the algebra instead of modifying the algebra itself to implicitly uphold schema (e.g. by...

What I meant was: This way none of the laws of the algebra _prior_ to the use of the invalidation procedure are invalidated. On a second thought, maybe this isn't...

Another direction is to come up with a better name for the instances instead of renaming the classes, like `AlgGraph`, or `Ind(uctive)Graph`, or even `FreeGraph`. I like this better as...

Happy new year! We need to watch out that we are not trying to solve a deeper problem here (cf. http://degoes.net/articles/kill-data). Type classes are what haskell provides for abstracting over...

No, not per se. I was more reacting to what you wrote above and make sure we don't try to fix a problem that's more related to haskell than to...

Just realized... using round parenthesis for scalar subqueries seems not well aligned with `EXISTS {}` which also returns a single value... in a way.. Not sure how to solve this...

Yes, that's the goal of this proposal which I expect to also become a part of GQL. It may happen eventually in Neo4j but note this repository is about language...

I can see that sometimes an infix operator form may feel more natural as it gets less in the way of the intent of an expression. Scala uses `OR ELSE`...

Throwing in some more operator suggestions: `v1 // v2 // v3` or `v1 :+: v2 :+: v3` (monoidal combine operator)