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/.
29 current proof (proof uri * metas * (in)complete proof * term to be prooved)
31 type proof = UriManager.uri option * Cic.metasenv * Cic.term * Cic.term
32 (** current goal, integer index *)
34 type status = proof * goal
36 let initial_status ty metasenv =
37 let rec aux max = function
39 | (idx, _, _) :: tl ->
45 let newmeta_idx = aux 0 metasenv in
47 None, (newmeta_idx, [], ty) :: metasenv, Cic.Meta (newmeta_idx, []), ty
52 a tactic: make a transition from one status to another one or, usually,
53 raise a "Fail" (@see Fail) exception in case of failure
55 (** an unfinished proof with the optional current goal *)
56 type tactic = status -> proof * goal list
58 (** creates an opaque tactic from a status->proof*goal list function *)
61 type reduction = Cic.context -> Cic.term -> Cic.term
63 let const_lazy_term t =
64 (fun _ metasenv ugraph -> t, metasenv, ugraph)
67 Cic.context -> Cic.metasenv -> CicUniv.universe_graph ->
68 reduction * Cic.metasenv * CicUniv.universe_graph
70 let const_lazy_reduction red =
71 (fun _ metasenv ugraph -> red, metasenv, ugraph)
73 type ('term, 'lazy_term) pattern =
74 'lazy_term option * (string * 'term) list * 'term option
76 type lazy_pattern = (Cic.term, Cic.lazy_term) pattern
78 let conclusion_pattern t =
82 | Some t -> Some (fun _ m u -> t, m, u)
84 t',[],Some (Cic.Implicit (Some `Hole))
87 exception Fail of string Lazy.t
90 calls the opaque tactic on the status
92 let apply_tactic t status =
93 let (uri,metasenv,bo,ty), gl = t status in
95 CicRefine.pack_coercion_obj
96 (Cic.CurrentProof ("",metasenv,bo,ty,[],[]))
98 | Cic.CurrentProof (_,metasenv,bo,ty,_,_) ->
99 (uri,metasenv,bo,ty), gl
103 (** constraint: the returned value will always be constructed by Cic.Name **)
104 type mk_fresh_name_type =
105 Cic.metasenv -> Cic.context -> Cic.name -> typ:Cic.term -> Cic.name
107 let goals_of_proof (_,metasenv,_,_) = List.map (fun (g,_,_) -> g) metasenv