[qed] Subst.find is better

src/plugins/qed/logic.mli

@@ -334,7 +334,7 @@ sig
     val create : ?pool:pool -> unit -> t
 
     val fresh : t -> tau -> var
-    val get : t -> term -> term
+    val find : t -> term -> term
     val filter : t -> term -> bool
 
     val add : t -> term -> term -> unit

src/plugins/qed/term.ml

@@ -2251,7 +2251,7 @@ struct
       | FUN(f,s) -> (try call f e with Not_found -> compute e s)
       | MAP(m,s) -> (try Tmap.find e m with Not_found -> compute e s)
 
-    let get sigma a = compute a sigma.shared
+    let find sigma a = compute a sigma.shared
 
     let filter sigma a =
       List.for_all (fun f -> f a) sigma.filter
@@ -2302,7 +2302,7 @@ struct
     else e
 
   and compute mu sigma alpha e =
-    try Subst.get sigma e with Not_found ->
+    try Subst.find sigma e with Not_found ->
       let r =
         match e.repr with
         | Bvar(k,_) -> Intmap.find k alpha

src/plugins/wp/Lang.mli

@@ -376,7 +376,7 @@ sig
 
   module Subst :
   sig
-    val get : sigma -> term -> term
+    val find : sigma -> term -> term
     val add : sigma -> term -> term -> unit
     val add_map : sigma -> term Tmap.t -> unit
     val add_fun : sigma -> (term -> term) -> unit

src/plugins/wp/Letify.ml

@@ -311,7 +311,7 @@ struct
       }
 
   let mem_lit l sigma =
-    try F.Subst.get (subst sigma) l == e_true
+    try F.Subst.find (subst sigma) l == e_true
     with Not_found -> false
 
   let add_lit l sigma =