anchor.diff:      Fvs = make_vars(Free),
       Arity = length(Vs) + length(Free),
       {Fname,St} =
  -	case lists:keyfind(id, 1, A) of 
  +        case keyfind(id, 1, A) of 
   	    {id,{_,_,Fname0}} ->
   		{Fname0,St1};
   	    false ->
  
positive.code: 	end, {Osub0, St0}, Ces0),
      %% It is later assumed that these keys are term sorted
      %% so we need to sort them here
      Kes1 = lists:sort(fun
  	    (#k_map_pair{key=KkA},#k_map_pair{key=KkB}) ->
  		A = map_key_clean(KkA),
  		B = map_key_clean(KkB),
  
negative.code: 	     undefined ->
  		 Func;
  	     _ ->
                   case keyfind(id, 1, A) of
  		     {id,{_,_,Name}} -> Name;
  		     _ ->
                           case keyfind(letrec_name, 1, A) of
  			     {letrec_name,Name} -> Name;
  			     _ -> unknown_fun
  			 end
  