parameter sintax added to axiom statement

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

diff --git a/helm/software/components/tactics/paramodulation/equality.mli b/helm/software/components/tactics/paramodulation/equality.mli
index 1a62ee2ff0e2a7e159e059ca2db41cafe7a95e7b..d601646894897e9c8e8188b475d4bc66b3bd37de 100644 (file)
--- a/helm/software/components/tactics/paramodulation/equality.mli
+++ b/helm/software/components/tactics/paramodulation/equality.mli
@@ -25,6 +25,12 @@
 
 type rule = SuperpositionRight | SuperpositionLeft | Demodulation
 
+(* every equality group has its own bag. the bag contains the infos necessary
+ * for building the proof. FIXME: should also contain maxmeta! *)
+type equality_bag
+
+val mk_equality_bag: unit -> equality_bag
+
 type equality 
 
 and proof =
@@ -36,19 +42,33 @@ and goal_proof = (rule * Utils.pos * int * Subst.substitution * Cic.term) list
 type goal = goal_proof * Cic.metasenv * Cic.term
 
 val pp_proof: 
+  equality_bag ->
   (Cic.name option) list -> goal_proof -> proof -> Subst.substitution -> int ->
     Cic.term -> string
 
-val reset : unit -> unit
-
+val draw_proof:
+  equality_bag ->
+  (Cic.name option) list -> goal_proof -> proof -> int -> unit
+
+val pp_proofterm: Cic.term -> string
+
+val mk_eq_ind : 
+    UriManager.uri ->
+    Cic.term ->
+    Cic.term -> 
+    Cic.term -> 
+    Cic.term -> 
+    Cic.term -> 
+    Cic.term -> 
+    Cic.term
+    
 val mk_equality :
-  int * proof * 
+  equality_bag -> int * proof * 
   (Cic.term * Cic.term * Cic.term * Utils.comparison) *
-  Cic.metasenv -> 
-    equality
+  Cic.metasenv -> equality_bag * equality
 
 val mk_tmp_equality :
-  int * (Cic.term * Cic.term * Cic.term * Utils.comparison) * Cic.metasenv -> 
+ int * (Cic.term * Cic.term * Cic.term * Utils.comparison) * Cic.metasenv -> 
     equality
     
 val open_equality :
@@ -56,25 +76,33 @@ val open_equality :
     int * proof * 
     (Cic.term * Cic.term * Cic.term * Utils.comparison) *
     Cic.metasenv * int
-val depend : equality -> int -> bool
+val depend : equality_bag -> equality -> int -> bool
 val compare : equality -> equality -> int
-val string_of_equality : ?env:Utils.environment -> equality -> string
+val max_weight_in_proof : equality_bag -> int -> proof -> int
+val max_weight : equality_bag -> 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
+  ?names:(Cic.name option)list -> equality_bag -> proof -> goal_proof -> string
 (* 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 [eq_URI] [goal_proof] [initial_proof] [ty] 
  *  [ty] is the type of the goal *)
 val build_goal_proof: 
+  ?contextualize:bool -> 
+  ?forward:bool ->
+  equality_bag ->
   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 build_proof_term :
+  equality_bag ->
+  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
+val fix_metas_goal: equality_bag -> goal -> equality_bag * goal
+val fix_metas: equality_bag -> equality -> equality_bag * equality
+val metas_of_proof: equality_bag -> proof -> int list
 
 (* this should be used _only_ to apply (efficiently) this subst on the 
  * initial proof passed to build_goal_proof *)
@@ -85,7 +113,9 @@ 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
+val equality_of_term: 
+   equality_bag -> Cic.term -> Cic.term -> Cic.metasenv ->
+    equality_bag * equality
 
 (**
    Re-builds the term corresponding to this equality
@@ -93,16 +123,28 @@ val equality_of_term: Cic.term -> Cic.term -> equality
 val term_of_equality: UriManager.uri -> equality -> Cic.term
 val term_is_equality: Cic.term -> bool
 
+val saturate_term : 
+     equality_bag -> Cic.metasenv -> Cic.substitution -> Cic.context -> Cic.term ->
+         equality_bag * Cic.term * Cic.metasenv * Cic.term list
+
+val push_maxmeta : equality_bag -> int -> equality_bag 
+val maxmeta : equality_bag -> int 
+val filter_metasenv_gt_maxmeta: equality_bag -> Cic.metasenv -> Cic.metasenv
+
 (** 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 meta_convertibility_subst: 
+  Cic.term -> Cic.term -> Cic.metasenv -> Cic.substitution option
 
 val is_weak_identity: equality -> bool
 val is_identity: Utils.environment -> equality -> bool
 
+val is_in: equality_bag -> int -> bool
+
 (* symmetric [eq_ty] [l] [id] [uri] [m] 
  *
  * given an equality (_,p,(_,[l],r,_),[m],[id]) of 'type' l=r
@@ -112,13 +154,13 @@ val is_identity: Utils.environment -> equality -> bool
  * [eq_ty] the ty of the equality sides
  *)
 val symmetric:
-  Cic.term -> Cic.term -> int -> UriManager.uri ->
-    Cic.metasenv -> proof
+  equality_bag -> Cic.term -> Cic.term -> int -> UriManager.uri ->
+    Cic.metasenv -> equality_bag * 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
+val collect: equality_bag -> int list -> int list -> int list -> equality_bag 
 
 (* given an equality, returns the numerical id *)
 val id_of: equality -> int