anchor.diff:       *)
       List.tryFind (fun vdm -> 
           (* We need to do list operations on the multiset contents,
  -             * so convert both sides to a (sorted) list.  We rely on the
  -             * sortedness to make the next step sound.
  -             *)
  +         * so convert both sides to a (sorted) list.  We rely on the
  +         * sortedness to make the next step sound.
  +         *)
           let vd = Multiset.toList vdm.CViews
           (* Do these two views have the same number of terms?
  -             * If not, using forall2 is an error.
  -             *)
  +         * If not, using forall2 is an error.
  +         *)
           List.length vd = List.length uview && List.forall2 (fun d s -> d.VName = s.VName) vd uview) model.DefViews
   
   /// Produces a map of substitutions that transform the parameters of a
  
positive.code: 
  /// Produces the reification of an unguarded view with regards to a
  /// given view definition.
  let instantiateDef ctx uview vdef = 
      // This corresponds to D in the theory.
      (* First, we figure out the mapping from viewdef parameters to
       * actual view expressions.
       *)
  
negative.code:         vdef.CZ3 vsubs
  
  /// Produces the reification of an unguarded view multiset.
  /// This corresponds to D^ in the theory.
  let reifyZUnguarded model uview = 
      let ctx = model.Context
      match findDefOfView model uview with
      | Some vdef -> instantiateDef ctx uview vdef
  