X-Git-Url: http://matita.cs.unibo.it/gitweb/?p=helm.git;a=blobdiff_plain;f=components%2Ftactics%2Fparamodulation%2Fequality.mli;fp=components%2Ftactics%2Fparamodulation%2Fequality.mli;h=6eb48a036e7f8f0e539f5fb746a2a54879c0af32;hp=0000000000000000000000000000000000000000;hb=f61af501fb4608cc4fb062a0864c774e677f0d76;hpb=58ae1809c352e71e7b5530dc41e2bfc834e1aef1

diff --git a/components/tactics/paramodulation/equality.mli b/components/tactics/paramodulation/equality.mli
new file mode 100644
index 000000000..6eb48a036
--- /dev/null
+++ b/components/tactics/paramodulation/equality.mli
@@ -0,0 +1,147 @@
+(* Copyright (C) 2006, HELM Team.
+ * 
+ * This file is part of HELM, an Hypertextual, Electronic
+ * Library of Mathematics, developed at the Computer Science
+ * Department, University of Bologna, Italy.
+ * 
+ * HELM is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License
+ * as published by the Free Software Foundation; either version 2
+ * of the License, or (at your option) any later version.
+ * 
+ * HELM is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with HELM; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
+ * MA  02111-1307, USA.
+ * 
+ * For details, see the HELM World-Wide-Web page,
+ * http://helm.cs.unibo.it/
+ *)
+
+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 =
+    Exact of Cic.term
+  | Step of Subst.substitution * (rule * int * (Utils.pos * int) * Cic.term)
+
+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 draw_proof:
+  equality_bag ->
+  (Cic.name option) list -> goal_proof -> proof -> int -> unit
+
+val pp_proofterm: Cic.term -> string
+    
+val mk_equality :
+  equality_bag -> int * proof * 
+  (Cic.term * Cic.term * Cic.term * Utils.comparison) *
+  Cic.metasenv -> 
+    equality
+
+val mk_tmp_equality :
+ int * (Cic.term * Cic.term * Cic.term * Utils.comparison) * Cic.metasenv -> 
+    equality
+    
+val open_equality :
+  equality ->
+    int * proof * 
+    (Cic.term * Cic.term * Cic.term * Utils.comparison) *
+    Cic.metasenv * int
+val depend : equality_bag -> equality -> int -> bool
+val compare : equality -> equality -> int
+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 -> 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: 
+  equality_bag ->
+  UriManager.uri -> goal_proof -> proof -> Cic.term-> int list -> 
+    Cic.context -> Cic.metasenv -> 
+    Cic.term * Cic.term list
+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: equality_bag -> int -> equality -> int * 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 *)
+val add_subst : Subst.substitution -> proof -> proof
+exception TermIsNotAnEquality;;
+
+(**
+   raises TermIsNotAnEquality if term is not an equation.
+   The first Cic.term is a proof of the equation
+*)
+val equality_of_term: equality_bag -> Cic.term -> Cic.term -> equality
+
+(**
+   Re-builds the term corresponding to this equality
+*)
+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
+    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
+
+(* 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:
+  equality_bag -> 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: equality_bag -> 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
+