anchor.diff:  
   .Example query 2:
   
  -Given a database containing two nodes, and the following query, the sequence below describes a non-obvious query execution.
  +Given a database containing two nodes, we illustrate the subtleties of query execution with the following query.
   
   [source,cypher]
   ----
  
positive.code: 
  ===== Definition
  
  We call the concept discussed in this CIP _Eagerness_.
  The meaning here is that each clause is logically consuming _all_ incoming rows _eagerly_, without producing any output until the input is exhausted.
  This concept is the opposite of link:https://en.wikipedia.org/wiki/Lazy_evaluation[_lazy evaluation_], which applied to Cypher means that each clause only processes as much input as is necessary for the first record of output to be sent to the subsequent clause.
  
  === Proposal
  
  
negative.code: [abstract]
  .Abstract
  --
  This CIP formalises the behaviour of state changes within a Cypher query.
  --
  
  toc::[]
  
  === Background
  
  Cypher allows clauses that read from the graph to be interleaved with clauses that write to the graph.
  Some clauses can also do both - read the graph and write to it at the same time.
  
  To allow the user to understand what the outcome will be at an abstract, logical level, semantics for the visibility of these changes should be clear.
  