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
37 (Cic.name option) list -> goal_proof -> proof -> Subst.substitution -> int ->
40 val reset : unit -> unit
44 (Cic.term * Cic.term * Cic.term * Utils.comparison) *
49 int * (Cic.term * Cic.term * Cic.term * Utils.comparison) * Cic.metasenv ->
55 (Cic.term * Cic.term * Cic.term * Utils.comparison) *
57 val depend : equality -> int -> bool
58 val compare : equality -> equality -> int
59 val string_of_equality : ?env:Utils.environment -> equality -> string
61 ?names:(Cic.name option)list -> proof -> goal_proof -> string
62 (* given a proof and a list of meta indexes we are interested in the
63 * instantiation gives back the cic proof and the list of instantiations *)
64 (* build_goal_proof [goal_proof] [initial_proof] [ty]
65 * [ty] is the type of the goal *)
67 goal_proof -> proof -> Cic.term-> int list -> Cic.term * Cic.term list
68 val refl_proof: Cic.term -> Cic.term -> Cic.term
69 (** ensures that metavariables in equality are unique *)
70 val fix_metas: int -> equality -> int * equality
71 val metas_of_proof: proof -> int list
73 val add_subst : Subst.substitution -> proof -> proof
74 exception TermIsNotAnEquality;;
77 raises TermIsNotAnEquality if term is not an equation.
78 The first Cic.term is a proof of the equation
80 val equality_of_term: Cic.term -> Cic.term -> equality
83 Re-builds the term corresponding to this equality
85 val term_of_equality: equality -> Cic.term
86 val term_is_equality: Cic.term -> bool
88 (** tests a sort of alpha-convertibility between the two terms, but on the
90 val meta_convertibility: Cic.term -> Cic.term -> bool
92 (** meta convertibility between two equations *)
93 val meta_convertibility_eq: equality -> equality -> bool
95 val is_weak_identity: equality -> bool
96 val is_identity: Utils.environment -> equality -> bool
98 (* symmetric [eq_ty] [l] [id] [uri] [m]
100 * given an equality (_,p,(_,[l],r,_),[m],[id]) of 'type' l=r
101 * returns the proof of the symmetric (r=l).
103 * [uri] is the uri of eq
104 * [eq_ty] the ty of the equality sides
107 Cic.term -> Cic.term -> int -> UriManager.uri ->
108 Cic.metasenv -> proof