1 (* Copyright (C) 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/.
27 current proof (proof uri * metas * (in)complete proof * term to be prooved)
30 UriManager.uri option * Cic.metasenv * Cic.substitution * Cic.term * Cic.term * Cic.attribute list
31 (** current goal, integer index *)
33 type status = proof * goal
36 * @param goal's metasenv
37 * @return initial proof status for the given goal *)
38 val initial_status: Cic.term -> Cic.metasenv -> Cic.attribute list -> status
41 a tactic: make a transition from one status to another one or, usually,
42 raise a "Fail" (@see Fail) exception in case of failure
44 (** an unfinished proof with the optional current goal *)
46 val mk_tactic: (status -> proof * goal list) -> tactic
48 type reduction = Cic.context -> Cic.term -> Cic.term
50 val const_lazy_term: Cic.term -> Cic.lazy_term
53 Cic.context -> Cic.metasenv -> CicUniv.universe_graph ->
54 reduction * Cic.metasenv * CicUniv.universe_graph
56 val const_lazy_reduction: reduction -> lazy_reduction
58 (** what, hypothesis patterns, conclusion pattern *)
59 type ('term, 'lazy_term) pattern =
60 'lazy_term option * (string * 'term) list * 'term option
62 type lazy_pattern = (Cic.term, Cic.lazy_term) pattern
64 (** conclusion_pattern [t] returns the pattern (t,[],%) *)
65 val conclusion_pattern : Cic.term option -> lazy_pattern
68 exception Fail of string Lazy.t
70 val apply_tactic: tactic -> status -> proof * goal list
72 (** constraint: the returned value will always be constructed by Cic.Name **)
73 type mk_fresh_name_type =
74 Cic.metasenv -> Cic.context -> Cic.name -> typ:Cic.term -> Cic.name
76 val goals_of_proof: proof -> goal list