anchor.diff:  		false -> Seq0#c_seq{arg=Arg,body=B1}
   	    end
       end;
  -expr(#c_let{}=Let, Ctxt, Sub) ->
  +expr(#c_let{}=Let0, Ctxt, Sub) ->
  +    Let = opt_case_in_let(Let0),
       case simplify_let(Let, Sub) of
   	impossible ->
   	    %% The argument for the let is "simple", i.e. has no
  
positive.code: 	    bsm_problem(P, bin_partition)
      end;
  bsm_ensure_no_partition_after([], _) -> ok.
      
  bsm_could_match_binary(#c_alias{pat=P}) -> bsm_could_match_binary(P);
  bsm_could_match_binary(#c_cons{}) -> false;
  bsm_could_match_binary(#c_tuple{}) -> false;
  
negative.code: 			 sub_new_preserve_types(Sub));
  		true ->
  		    Let1 = Let0#c_let{vars=Vs,arg=Arg1,body=Body},
  		    Let2 = opt_bool_case_in_let(Let1, Sub),
  		    opt_case_in_let_arg(Let2, Ctxt, Sub)
  	    end
      end.
  