Stefan Plantikow

Even more so, the intent is to not allow any shadowing, i.e. you cannot rebind variable from the outer query in the `RETURN` of the nested subquery. This is in...

@thobe passing subqueries as arguments to procedures is out of scope for this CIP. @thobe How do you envision replacing `UNION` with subqueries? I'm not seeing that. Besides having `UNION`...

Syntax idea: `min OF expr`

Worth pointing out though that choosing different syntax deviates from what people are used to that are coming from SQL.

Note that this CIP is in a heavy state of flux in order to allow for alignment with ongoing discussions.

Thanks for the very clear write up. This is a good start. Regarding Example 1, this feels like it could also be resolved by removing the other source of nondeterminism...

That makes me wonder if it might be (conceptually possible) to express `MERGE` using subquery operators like this: ``` MATCH (a) MATCH { MATCH { MATCH (a)-[-[:X]->(m {prop: n.prop}) RETURN...

Wasn't the main reason for that the order dependence? If we can fix that, wouldn't it be great to make them a proper part of the language?

I have edited my previous response because there were some items that were unclear. New Cypher features are being developed in close symbiosis with the GQL standard work, that is...

The GQL process for the creation of a graph query language standard is steered by the SQL committee. If you're interested in getting involved in GQL, please look into joining...