Remove warnings

simulation/rule_interpreter.ml

@@ -111,8 +111,8 @@ let all_injections ?excp edges roots cca =
     (excp,[Connected_component.Matching.empty,[]]) cca
 
 let apply_negative_transformation (side_effects,edges) = function
-  | Primitives.Transformation.Agent nc ->
-     let edges' = Edges.remove_agent nc edges in
+  | Primitives.Transformation.Agent (id,_) ->
+     let edges' = Edges.remove_agent id edges in
      (side_effects,edges')
   | Primitives.Transformation.Freed ((id,_),s) -> (*(n,s)-bottom*)
      let edges' = Edges.remove_free id s edges in

siteGraphs/edges.ml

@@ -120,7 +120,7 @@ let add_link (ag,ty) s (ag',ty') s' graph =
     free_id = graph.free_id;
   }
 
-let remove_agent (ag,ty) graph =
+let remove_agent ag graph =
   let () = assert (not graph.outdated) in
   let () = graph.outdated <- true in
   let () = LargeArray.set graph.connect ag [||] in

siteGraphs/edges.mli

@@ -19,7 +19,7 @@ val add_internal : int -> int -> int -> t -> t
 val add_link : agent -> int -> agent -> int -> t -> t
 (** [add_link ag1 s1 ag2 s2 t] *)
 
-val remove_agent : agent -> t -> t
+val remove_agent : int -> t -> t
 val remove_free : int -> int -> t -> t
 val remove_internal : int -> int -> t -> t
 val remove_link : int -> int -> int -> int -> t -> t

term/connected_component.mli

@@ -71,8 +71,8 @@ module Matching : sig
 
   val get_all : Edges.t -> t -> cc -> int -> int list
   (** [get_all graph matching_of_previous_cc cc root ]*)
-  val get_all_with_types : Edges.t -> t -> cc -> int -> (int * int) list
 
+  val get_all_with_types : Edges.t -> t -> cc -> int -> (int * int) list
 
   type cache
   val empty_cache : cache