X-Git-Url: http://matita.cs.unibo.it/gitweb/?p=helm.git;a=blobdiff_plain;f=helm%2Focaml%2Ftactics%2FnewConstraints.mli;fp=helm%2Focaml%2Ftactics%2FnewConstraints.mli;h=e57d6b1e0a03532d2b09522a929b9b145f7802b7;hp=0000000000000000000000000000000000000000;hb=90a88a05bb66c0e14a95d54929a4b545c8f2a36c;hpb=5930f13b2d863abbff240ffa985bcc064c7a5ab8

diff --git a/helm/ocaml/tactics/newConstraints.mli b/helm/ocaml/tactics/newConstraints.mli
new file mode 100644
index 000000000..e57d6b1e0
--- /dev/null
+++ b/helm/ocaml/tactics/newConstraints.mli
@@ -0,0 +1,54 @@
+(* Copyright (C) 2000-2002, 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://cs.unibo.it/helm/.
+ *)
+
+(*********************************************************************)
+(*                                                                   *)
+(*                           PROJECT HELM                            *)
+(*                                                                   *)
+(*               Andrea Asperti <asperti@cs.unibo.it>                *)
+(*                            18/03/2004                             *)
+(*                                                                   *)
+(*                                                                   *)
+(*********************************************************************)
+
+
+module StringSet : Set.S with type elt = string
+
+module SetSet : Set.S with type elt = StringSet.t
+
+val pp_SetSet : SetSet.t -> string
+
+val inspect_term : int -> Cic.term -> string option * SetSet.t
+
+val prefixes : int -> Cic.term -> string option * ((int * (StringSet.elt list)) list) 
+
+(* (constants_of t) returns a pair (b,n) where n is the number of 
+   constants in the conclusion of t, and b is true if in MainConclusion
+   we have an equality *)
+
+val constants_of : Cic.term -> bool * StringSet.t
+
+val pp_prefixes : ((int * (StringSet.elt list)) list) -> string
+