anchor.diff:          let list = match nk with Normal -> [] | Entry -> [String "(Entry)"] | Exit -> [String "(Exit)"] | EntryExit -> [String "(EntryExit)"]
           hsep [ id |> String
                  ([ id |> String
  -                  view |> printViewExpr printSVGView ] @ list)
  +                  view |> printViewExpr (printIteratedGView (printSym printVar)) ] @ list)
                   |> colonSep |> printLabel
                ]
           |> withSemi
  
positive.code: ///     This is wrapped in a Chessie result over <c>Error</c>.
  /// </returns>
  let axiomatiseGraph
    : Graph -> (string * Axiom<GView<Sym<Var>>, Command>) seq =
      mapEdges
          (fun { Name = n; SrcView = s ; DestView = t ; Command = c } ->
              (n, { Pre = match s with InnerView v -> v
  
negative.code: [<AutoOpen>]
  module Types =
      /// <summary>
      ///     A view of the type permitted in a Graph.
      /// </summary>
      type GraphView = IteratedGView<Sym<Var>>
  
      /// <summary>
      ///     A <see cref="ViewExpr"/> of the type permitted in a Graph.
      /// </summary>
      type GraphViewExpr = ViewExpr<GraphView>
  
      /// <summary>
      ///     An edge identifier.
  