src/Tools/Code/code_namespace.ML

         Graph.default_node (module_name, (Graph.empty, []))
         #> (Graph.map_node module_name o apfst) (Graph.new_node (name, (base, stmt)))
       end;
     fun add_dependency name name' =
       let
-        val (module_name, base) = dest_name name;
-        val (module_name', base') = dest_name name';
+        val (module_name, _) = dest_name name;
+        val (module_name', _) = dest_name name';
       in if module_name = module_name'
         then (Graph.map_node module_name o apfst) (Graph.add_edge (name, name'))
         else (Graph.map_node module_name o apsnd) (AList.map_default (op =) (module_name', []) (insert (op =) name'))
       end;
     val proto_program = Graph.empty

       in
         (map_module name_fragments o apsnd) (Graph.new_node (name, (base, Stmt stmt)))
       end;
     fun add_dependency name name' =
       let
-        val (name_fragments, base) = dest_name name;
-        val (name_fragments', base') = dest_name name';
+        val (name_fragments, _) = dest_name name;
+        val (name_fragments', _) = dest_name name';
         val (name_fragments_common, (diff, diff')) =
           chop_prefix (op =) (name_fragments, name_fragments');
         val is_module = not (null diff andalso null diff');
         val dep = pairself hd (diff @ [name], diff' @ [name']);
         val add_edge = if is_module andalso not cyclic_modules