matitaprover

[helm.git] / components / tactics / paramodulation / equality.mli

diff --git a/components/tactics/paramodulation/equality.mli b/components/tactics/paramodulation/equality.mli
index c86cbdeaccb0114af41db35d3389121a7043902a..1a909dfc4b387c40465d5743bfc940964ba5e79c 100644 (file)
--- a/components/tactics/paramodulation/equality.mli
+++ b/components/tactics/paramodulation/equality.mli
@@ -31,10 +31,16 @@ and proof =
     Exact of Cic.term
   | Step of Subst.substitution * (rule * int * (Utils.pos * int) * Cic.term)
 
-and goal_proof = (Utils.pos * int * Subst.substitution * Cic.term) list
+and goal_proof = (rule * Utils.pos * int * Subst.substitution * Cic.term) list
 
-val pp_proof: (Cic.name option) list -> goal_proof -> proof -> string
+type goal = goal_proof * Cic.metasenv * Cic.term
 
+val pp_proof: 
+  (Cic.name option) list -> goal_proof -> proof -> Subst.substitution -> int ->
+    Cic.term -> string
+
+val pp_proofterm: Cic.term -> string
+    
 val reset : unit -> unit
 
 val mk_equality :
@@ -54,22 +60,30 @@ val open_equality :
     Cic.metasenv * int
 val depend : equality -> int -> bool
 val compare : equality -> equality -> int
+val max_weight_in_proof : int-> proof -> int
+val max_weight : goal_proof -> proof -> int
 val string_of_equality : ?env:Utils.environment -> equality -> string
 val string_of_proof : 
   ?names:(Cic.name option)list -> proof -> goal_proof -> string
-val build_proof_term: 
-  proof -> Cic.term
 (* given a proof and a list of meta indexes we are interested in the
  * instantiation gives back the cic proof and the list of instantiations *)  
-(* build_goal_proof [goal_proof] [initial_proof] [ty] 
+(* build_goal_proof [eq_URI] [goal_proof] [initial_proof] [ty] 
  *  [ty] is the type of the goal *)
 val build_goal_proof: 
-  goal_proof -> Cic.term -> Cic.term-> int list -> Cic.term * Cic.term list
-val refl_proof: Cic.term -> Cic.term -> Cic.term 
+  UriManager.uri -> goal_proof -> proof -> Cic.term-> int list -> 
+    Cic.context -> Cic.metasenv -> 
+    Cic.term * Cic.term list
+val build_proof_term : 
+  UriManager.uri -> (int * Cic.term) list -> int -> proof -> Cic.term
+val refl_proof: UriManager.uri -> Cic.term -> Cic.term -> Cic.term 
 (** ensures that metavariables in equality are unique *)
+val fix_metas_goal: int -> goal -> int * goal
 val fix_metas: int -> equality -> int * equality
 val metas_of_proof: proof -> int list
 
+(* this should be used _only_ to apply (efficiently) this subst on the 
+ * initial proof passed to build_goal_proof *)
+val add_subst : Subst.substitution -> proof -> proof
 exception TermIsNotAnEquality;;
 
 (**
@@ -81,7 +95,7 @@ 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_of_equality: UriManager.uri -> equality -> Cic.term
 val term_is_equality: Cic.term -> bool
 
 (** tests a sort of alpha-convertibility between the two terms, but on the
@@ -93,3 +107,27 @@ val meta_convertibility_eq: equality -> equality -> bool
 
 val is_weak_identity: equality -> bool
 val is_identity: Utils.environment -> equality -> bool
+
+(* symmetric [eq_ty] [l] [id] [uri] [m] 
+ *
+ * given an equality (_,p,(_,[l],r,_),[m],[id]) of 'type' l=r
+ * returns the proof of the symmetric (r=l).
+ *
+ * [uri] is the uri of eq
+ * [eq_ty] the ty of the equality sides
+ *)
+val symmetric:
+  Cic.term -> Cic.term -> int -> UriManager.uri ->
+    Cic.metasenv -> proof
+
+(* takes 3 lists of alive ids (they are threated the same way, the type is
+ * funny just to not oblige you to concatenate them) and drops all the dead
+ * equalities *)
+val collect: int list -> int list -> int list -> unit
+
+(* given an equality, returns the numerical id *)
+val id_of: equality -> int
+
+(* profiling statistics *)
+val get_stats: unit -> string
+