X-Git-Url: http://matita.cs.unibo.it/gitweb/?p=helm.git;a=blobdiff_plain;f=helm%2Focaml%2Fparamodulation%2Fequality_indexing.mli;fp=helm%2Focaml%2Fparamodulation%2Fequality_indexing.mli;h=d7c3bec5ec179db7cb33028b566f84ea694f8578;hp=0000000000000000000000000000000000000000;hb=792b5d29ebae8f917043d9dd226692919b5d6ca1;hpb=a14a8c7637fd0b95e9d4deccb20c6abc98e8f953

diff --git a/helm/ocaml/paramodulation/equality_indexing.mli b/helm/ocaml/paramodulation/equality_indexing.mli
new file mode 100644
index 000000000..d7c3bec5e
--- /dev/null
+++ b/helm/ocaml/paramodulation/equality_indexing.mli
@@ -0,0 +1,43 @@
+(* Copyright (C) 2005, 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/
+ *)
+
+module type EqualityIndex =
+  sig
+    module PosEqSet : Set.S with type elt = Utils.pos * Inference.equality
+    val arities : (Cic.term, int) Hashtbl.t
+    type key = Cic.term
+    type t = Discrimination_tree.DiscriminationTreeIndexing(PosEqSet).t
+    val empty : t
+    val retrieve_generalizations : t -> key -> PosEqSet.t
+    val retrieve_unifiables : t -> key -> PosEqSet.t
+    val init_index : unit -> unit
+    val remove_index : t -> Inference.equality -> t
+    val index : t -> Inference.equality -> t
+    val in_index : t -> Inference.equality -> bool
+  end
+
+module DT : EqualityIndex
+module PT : EqualityIndex
+