Added the computation of max_weight for equations in proofs.

[helm.git] / helm / software / components / tactics / paramodulation / inference.mli

diff --git a/helm/software/components/tactics/paramodulation/inference.mli b/helm/software/components/tactics/paramodulation/inference.mli
index b08054ca4f2c90c72dc97ade2d53e493b8ed0260..5c6a1979b5c4a38c0ebe3c6dab3d8ae181c59fac 100644 (file)
--- a/helm/software/components/tactics/paramodulation/inference.mli
+++ b/helm/software/components/tactics/paramodulation/inference.mli
@@ -23,57 +23,24 @@
  * http://cs.unibo.it/helm/.
  *)
 
-val metas_of_proof_time : float ref
-
-(* type substitution = Cic.substitution *)
-type substitution = (int * Cic.term) list 
-
-type equality =
-    int *                (* weight *)
-    proof *              (* proof *)
-    (Cic.term *          (* type *)
-     Cic.term *          (* left side *)
-     Cic.term *          (* right side *)
-     Utils.comparison) * (* ordering *)  
-    Cic.metasenv        (* environment for metas *)
-
-and proof =
-  | NoProof   (* no proof *)
-  | BasicProof of substitution * Cic.term (* already a proof of a goal *)
-  | ProofBlock of (* proof of a rewrite step *)
-      substitution * UriManager.uri * (* eq_ind or eq_ind_r *)
-        (Cic.name * Cic.term) * Cic.term * (Utils.pos * equality) * proof
-  | ProofGoalBlock of proof * proof
-      (* proof of the new meta, proof of the goal from which this comes *)
-  | ProofSymBlock of Cic.term list * proof (* expl.named subst, proof *)
-  | SubProof of Cic.term * int * proof
-      (* parent proof, subgoal, proof of the subgoal *)
-
-type environment = Cic.metasenv * Cic.context * CicUniv.universe_graph
-
-(** builds the Cic.term encoded by proof *)
-val build_proof_term: ?noproof:Cic.term -> proof -> Cic.term
-
-val string_of_proof: proof -> string
-
-val filter : substitution -> Cic.metasenv -> Cic.metasenv
-
 exception MatchingFailure
 
 (** matching between two terms. Can raise MatchingFailure *)
 val matching:
-  Cic.metasenv -> Cic.metasenv -> Cic.context -> Cic.term -> Cic.term ->
+  Cic.metasenv -> Cic.metasenv -> Cic.context -> 
+  Cic.term -> Cic.term ->
   CicUniv.universe_graph ->
-  substitution * Cic.metasenv * CicUniv.universe_graph
+    Subst.substitution * Cic.metasenv * CicUniv.universe_graph
 
 (**
    special unification that checks if the two terms are "simple", and in
    such case should be significantly faster than CicUnification.fo_unif
 *)
 val unification:
-  Cic.metasenv -> Cic.metasenv -> Cic.context -> Cic.term -> Cic.term ->
+  Cic.metasenv -> Cic.metasenv -> Cic.context -> 
+  Cic.term -> Cic.term ->
   CicUniv.universe_graph ->
-  substitution * Cic.metasenv * CicUniv.universe_graph
+    Subst.substitution * Cic.metasenv * CicUniv.universe_graph
 
     
 (**
@@ -83,64 +50,29 @@ val unification:
    fresh metas...
 *)
 val find_equalities:
-  Cic.context -> ProofEngineTypes.proof -> int list * equality list * int
+  Cic.context -> ProofEngineTypes.proof -> 
+    int list * Equality.equality list * int
 
 (**
    searches the library for equalities that can be applied to the current goal
 *)
 val find_library_equalities:
-  HMysql.dbd -> Cic.context -> ProofEngineTypes.status -> int ->
-  UriManager.UriSet.t * (UriManager.uri * equality) list * int
+  bool -> HMysql.dbd -> Cic.context -> ProofEngineTypes.status -> int ->
+    UriManager.UriSet.t * (UriManager.uri * Equality.equality) list * int
 
 (**
    searches the library for theorems that are not equalities (returned by the
    function above)
 *)
 val find_library_theorems:
-  HMysql.dbd -> environment -> ProofEngineTypes.status -> UriManager.UriSet.t ->
-  (Cic.term * Cic.term * Cic.metasenv) list
+  HMysql.dbd -> Utils.environment -> ProofEngineTypes.status -> 
+  UriManager.UriSet.t ->
+    (Cic.term * Cic.term * Cic.metasenv) list
 
 (**
    searches the context for hypotheses that are not equalities
 *)
 val find_context_hypotheses:
-  environment -> int list -> (Cic.term * Cic.term * Cic.metasenv) list
-
-
-exception TermIsNotAnEquality;;
-
-(**
-   raises TermIsNotAnEquality if term is not an equation.
-   The first Cic.term is a proof of the equation
-*)
-val equality_of_term: Cic.term -> Cic.term -> equality
-
-(**
-   Re-builds the term corresponding to this equality
-*)
-val term_of_equality: equality -> Cic.term
-
-val term_is_equality: Cic.term -> bool
-
-(** tests a sort of alpha-convertibility between the two terms, but on the
-    metavariables *)
-val meta_convertibility: Cic.term -> Cic.term -> bool
-
-(** meta convertibility between two equations *)
-val meta_convertibility_eq: equality -> equality -> bool
-
-val is_weak_identity: environment -> equality -> bool
-val is_identity: environment -> equality -> bool
-
-val string_of_equality: ?env:environment -> equality -> string
-
-
-val metas_of_term: Cic.term -> int list
-val metas_of_proof: proof -> int list
-
-(** ensures that metavariables in equality are unique *)
-val fix_metas: int -> equality -> int * equality
+  Utils.environment -> int list -> (Cic.term * Cic.term * Cic.metasenv) list
 
-val apply_subst: substitution -> Cic.term -> Cic.term
-val apply_subst_metasenv: substitution -> Cic.metasenv -> Cic.metasenv
-val ppsubst: substitution -> string
+val get_stats: unit -> string