anchor.diff:  a1 = b1 && a2 = b2 && ...
   ----
   
  -For clarity, we also repeat the current equality semantics of maps here. Two maps `m1` and `m2` are considered equal if
  +For clarity, we also repeat the current equality semantics of maps here (at the time of writing this CIP). Two maps `m1` and `m2` are considered equal if
   
   * `m1` and `m2` must have the same keys.
   * For each key `k`,
  
positive.code: === Orderability
  
  We further propose that orderability be defined between any pair of values, where the result is always `true` or `false`; i.e. always defined.
  To accomplish this, there must be a pre-determined type order and each value must fall under exactly one type in this order. We propose to use the following ascending global sort order:
  
  * `NODE`
  * `RELATIONSHIP`
  
negative.code:     ** In equality, `null = null` is `null`.
      ** In equivalence, used by grouping and `DISTINCT`, instances of `null` are always treated as being the same value.
      ** However, equality treats `null` values differently if they are an element of a list or a map value.
      ** Similar rules apply for `NaN`.
  
  == Proposal
  
  === Comparability
  
  We propose that comparability be defined between any pair of values, as specified below (Please note that `null` is interpreted as meaning "unknown" or "could be any value" in the context of comparability):
  
  * Integers are compared numerically.
  * Floats (excluding `NaN` and the Infinities) are compared numerically.
  