1 (* Copyright (C) 2006, HELM Team.
3 * This file is part of HELM, an Hypertextual, Electronic
4 * Library of Mathematics, developed at the Computer Science
5 * Department, University of Bologna, Italy.
7 * HELM is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version 2
10 * of the License, or (at your option) any later version.
12 * HELM is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with HELM; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
22 * For details, see the HELM World-Wide-Web page,
23 * http://helm.cs.unibo.it/
26 type rule = SuperpositionRight | SuperpositionLeft | Demodulation
32 | Step of Subst.substitution * (rule * int * (Utils.pos * int) * Cic.term)
34 and goal_proof = (rule * Utils.pos * int * Subst.substitution * Cic.term) list
36 type goal = goal_proof * Cic.metasenv * Cic.term
39 (Cic.name option) list -> goal_proof -> proof -> Subst.substitution -> int ->
42 val reset : unit -> unit
46 (Cic.term * Cic.term * Cic.term * Utils.comparison) *
51 int * (Cic.term * Cic.term * Cic.term * Utils.comparison) * Cic.metasenv ->
57 (Cic.term * Cic.term * Cic.term * Utils.comparison) *
59 val depend : equality -> int -> bool
60 val compare : equality -> equality -> int
61 val string_of_equality : ?env:Utils.environment -> equality -> string
63 ?names:(Cic.name option)list -> proof -> goal_proof -> string
64 (* given a proof and a list of meta indexes we are interested in the
65 * instantiation gives back the cic proof and the list of instantiations *)
66 (* build_goal_proof [eq_URI] [goal_proof] [initial_proof] [ty]
67 * [ty] is the type of the goal *)
69 UriManager.uri -> goal_proof -> proof -> Cic.term-> int list ->
70 Cic.term * Cic.term list
71 val build_proof_term : UriManager.uri -> (int * Cic.term) list -> int -> proof -> Cic.term
72 val refl_proof: UriManager.uri -> Cic.term -> Cic.term -> Cic.term
73 (** ensures that metavariables in equality are unique *)
74 val fix_metas_goal: int -> goal -> int * goal
75 val fix_metas: int -> equality -> int * equality
76 val metas_of_proof: proof -> int list
78 (* this should be used _only_ to apply (efficiently) this subst on the
79 * initial proof passed to build_goal_proof *)
80 val add_subst : Subst.substitution -> proof -> proof
81 exception TermIsNotAnEquality;;
84 raises TermIsNotAnEquality if term is not an equation.
85 The first Cic.term is a proof of the equation
87 val equality_of_term: Cic.term -> Cic.term -> equality
90 Re-builds the term corresponding to this equality
92 val term_of_equality: UriManager.uri -> equality -> Cic.term
93 val term_is_equality: Cic.term -> bool
95 (** tests a sort of alpha-convertibility between the two terms, but on the
97 val meta_convertibility: Cic.term -> Cic.term -> bool
99 (** meta convertibility between two equations *)
100 val meta_convertibility_eq: equality -> equality -> bool
102 val is_weak_identity: equality -> bool
103 val is_identity: Utils.environment -> equality -> bool
105 (* symmetric [eq_ty] [l] [id] [uri] [m]
107 * given an equality (_,p,(_,[l],r,_),[m],[id]) of 'type' l=r
108 * returns the proof of the symmetric (r=l).
110 * [uri] is the uri of eq
111 * [eq_ty] the ty of the equality sides
114 Cic.term -> Cic.term -> int -> UriManager.uri ->
115 Cic.metasenv -> proof
117 (* takes 3 lists of alive ids (they are threated the same way, the type is
118 * funny just to not oblige you to concatenate them) and drops all the dead
120 val collect: int list -> int list -> int list -> unit
122 (* given an equality, returns the numerical id *)
123 val id_of: equality -> int
125 (* profiling statistics *)
126 val get_stats: unit -> string