anchor.diff:           (match ts with 
             | [] -> head
             | _ -> U.mk_app head args)
  -       else (* otherwise compute *)
  -         readback (curry (translate ((mkAccuRec lb bs) :: bs) lb.lbdef) ts)
  +      
   // Zoe: Commenting out conflict with Danel
   // =======
   //     | Accu (Rec (lb, bs), ts) -> 
  
positive.code:   | ({v = Pat_cons (c', args)}, _, e) :: bs when (fv_eq c c') ->
      e
    | b :: bs -> pickBranch c bs
  
  (* XXX unused *)
  let rec mkBranches branches cont = 
  
negative.code: //         | _ -> failwith "Recursive definition not a function")
  // >>>>>>> 86f93ae6edc257258f376954fed7fba11f53ff83
      | _ -> failwith "Not yet implemented"
  
  let normalize (e:term) : term = readback (translate [] e)
  