1 (* Copyright (C) 2000-2002, 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://cs.unibo.it/helm/.
26 exception Bad_pattern of string
28 (* Returns the first meta whose number is above the *)
29 (* number of the higher meta. *)
30 val new_meta_of_proof : proof:ProofEngineTypes.proof -> int
32 val subst_meta_in_proof :
33 ProofEngineTypes.proof ->
34 int -> Cic.term -> Cic.metasenv ->
35 ProofEngineTypes.proof * Cic.metasenv
36 val subst_meta_and_metasenv_in_proof :
37 ProofEngineTypes.proof ->
38 int -> (Cic.term -> Cic.term) -> Cic.metasenv ->
39 ProofEngineTypes.proof * Cic.metasenv
41 (* returns the list of goals that are in newmetasenv and were not in
43 val compare_metasenvs :
44 oldmetasenv:Cic.metasenv -> newmetasenv:Cic.metasenv -> int list
48 * A pattern is a Cic term in which Cic.Implicit terms annotated with `Hole
51 (** create a pattern from a term and a list of subterm.
52 * @param equality equality function used while walking the term. Defaults to
53 * physical equality (==) *)
55 ?equality:(Cic.term -> Cic.term -> bool) -> term:Cic.term -> Cic.term list ->
58 (** select all subterms of a given term matching a given pattern (i.e. subtrees
59 * rooted at pattern's holes. The first component is the context the term lives
60 * in). raise Bad_pattern (pattern_entry, term_entry) *)
61 val select: term:Cic.term -> pattern:Cic.term -> (Cic.context * Cic.term) list
64 (** Finds the _pointers_ to subterms that are alpha-equivalent to wanted in t.
65 * wanted is properly lifted when binders are crossed *)
67 eq:(Cic.term -> Cic.term -> bool) ->
68 wanted:Cic.term -> Cic.term ->