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)
32 UriManager.uri option * Cic.metasenv * Cic.substitution * Cic.term Lazy.t * Cic.term * Cic.attribute list
33 (** current goal, integer index *)
35 type status = proof * goal
37 let initial_status ty metasenv attrs =
38 let rec aux max = function
40 | (idx, _, _) :: tl ->
46 let newmeta_idx = aux 0 metasenv in
49 None, (newmeta_idx, [], ty) :: metasenv, _subst,
50 lazy (Cic.Meta (newmeta_idx, [])), ty, attrs
55 a tactic: make a transition from one status to another one or, usually,
56 raise a "Fail" (@see Fail) exception in case of failure
58 (** an unfinished proof with the optional current goal *)
59 type tactic = status -> proof * goal list
61 (** creates an opaque tactic from a status->proof*goal list function *)
64 type reduction = Cic.context -> Cic.term -> Cic.term
66 let const_lazy_term t =
67 (fun _ metasenv ugraph -> t, metasenv, ugraph)
70 Cic.context -> Cic.metasenv -> CicUniv.universe_graph ->
71 reduction * Cic.metasenv * CicUniv.universe_graph
73 let const_lazy_reduction red =
74 (fun _ metasenv ugraph -> red, metasenv, ugraph)
76 type ('term, 'lazy_term) pattern =
77 'lazy_term option * (string * 'term) list * 'term option
79 type lazy_pattern = (Cic.term, Cic.lazy_term) pattern
81 let hole = Cic.Implicit (Some `Hole)
83 let conclusion_pattern t =
87 | Some t -> Some (const_lazy_term t)
92 exception Fail of string Lazy.t
95 calls the opaque tactic on the status
97 let apply_tactic t status =
98 let (uri,metasenv,subst,bo,ty, attrs), gl = t status in
100 CicRefine.pack_coercion_obj
101 (Cic.CurrentProof ("",metasenv,Cic.Rel ~-1,ty,[],attrs))
103 | Cic.CurrentProof (_,metasenv,_,ty,_, attrs) ->
104 (uri,metasenv,subst,bo,ty, attrs), gl
108 (** constraint: the returned value will always be constructed by Cic.Name **)
109 type mk_fresh_name_type =
110 Cic.metasenv -> Cic.context -> Cic.name -> typ:Cic.term -> Cic.name
112 let goals_of_proof (_,metasenv,_subst,_,_,_) = List.map (fun (g,_,_) -> g) metasenv