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 (* TODO se ce n'e' piu' di una, prende la prima che trova... sarebbe meglio
30 chiedere: find dovrebbe restituire una lista di hyp (?) da passare all'utonto con una
31 funzione di callback che restituisce la (sola) hyp da applicare *)
34 let module PET = ProofEngineTypes in
35 let assumption_tac status =
36 let (proof, goal) = status in
38 let module R = CicReduction in
39 let module S = CicSubstitution in
40 let module PT = PrimitiveTactics in
41 let _,metasenv,_,_ = proof in
42 let _,context,ty = CicUtil.lookup_meta goal metasenv in
43 let rec find n = function
46 (Some (_, C.Decl t)) when
47 fst (R.are_convertible context (S.lift n t) ty
48 CicUniv.empty_ugraph) -> n
49 | (Some (_, C.Def (_,Some ty'))) when
50 fst (R.are_convertible context (S.lift n ty') ty
51 CicUniv.empty_ugraph) -> n
52 | (Some (_, C.Def (t,None))) ->
53 let ty_t, u = (* TASSI: FIXME *)
54 CicTypeChecker.type_of_aux' metasenv context (S.lift n t)
55 CicUniv.empty_ugraph in
56 let b,_ = R.are_convertible context ty_t ty u in
57 if b then n else find (n+1) tl
60 | [] -> raise (PET.Fail (lazy "Assumption: No such assumption"))
61 in PET.apply_tactic (PT.apply_tac ~term:(C.Rel (find 1 context))) status
63 PET.mk_tactic assumption_tac
66 (* ANCORA DA DEBUGGARE *)
68 exception UnableToDetectTheTermThatMustBeGeneralizedYouMustGiveItExplicitly;;
69 exception TheSelectedTermsMustLiveInTheGoalContext
70 exception AllSelectedTermsMustBeConvertible;;
71 exception GeneralizationInHypothesesNotImplementedYet;;
74 ?(mk_fresh_name_callback = FreshNamesGenerator.mk_fresh_name ~subst:[])
77 let module PET = ProofEngineTypes in
78 let generalize_tac mk_fresh_name_callback
79 ~pattern:(term,hyps_pat,concl_pat) status
81 if hyps_pat <> [] then raise GeneralizationInHypothesesNotImplementedYet;
82 let (proof, goal) = status in
84 let module P = PrimitiveTactics in
85 let module T = Tacticals in
86 let uri,metasenv,pbo,pty = proof in
87 let (_,context,ty) as conjecture = CicUtil.lookup_meta goal metasenv in
88 let subst,metasenv,u,selected_hyps,terms_with_context =
89 ProofEngineHelpers.select ~metasenv ~ugraph:CicUniv.empty_ugraph
90 ~conjecture ~pattern in
91 let context = CicMetaSubst.apply_subst_context subst context in
92 let metasenv = CicMetaSubst.apply_subst_metasenv subst metasenv in
93 let pbo = CicMetaSubst.apply_subst subst pbo in
94 let pty = CicMetaSubst.apply_subst subst pty in
95 let status = (uri,metasenv,pbo,pty),goal in
100 Some (fun context metasenv ugraph ->
101 let term, metasenv, ugraph = term context metasenv ugraph in
102 CicMetaSubst.apply_subst subst term, metasenv, ugraph)
104 let u,typ,term, metasenv =
105 let context_of_t, (t, metasenv, u) =
106 match terms_with_context, term with
109 UnableToDetectTheTermThatMustBeGeneralizedYouMustGiveItExplicitly
110 | [], Some t -> context, t context metasenv u
111 | (context_of_t, _)::_, Some t ->
112 context_of_t, t context_of_t metasenv u
113 | (context_of_t, t)::_, None -> context_of_t, (t, metasenv, u)
115 let t,subst,metasenv' =
117 CicMetaSubst.delift_rels [] metasenv
118 (List.length context_of_t - List.length context) t
120 CicMetaSubst.DeliftingARelWouldCaptureAFreeVariable ->
121 raise TheSelectedTermsMustLiveInTheGoalContext in
122 (*CSC: I am not sure about the following two assertions;
123 maybe I need to propagate the new subst and metasenv *)
125 assert (metasenv' = metasenv);
126 let typ,u = CicTypeChecker.type_of_aux' ~subst metasenv context t u in
130 1. whether they live in the context of the goal;
131 if they do they are also well-typed since they are closed subterms
132 of a well-typed term in the well-typed context of the well-typed
134 2. whether they are convertible
139 (fun u (context_of_t,t) ->
141 let t,subst,metasenv' =
143 CicMetaSubst.delift_rels [] metasenv
144 (List.length context_of_t - List.length context) t
146 CicMetaSubst.DeliftingARelWouldCaptureAFreeVariable ->
147 raise TheSelectedTermsMustLiveInTheGoalContext in
148 (*CSC: I am not sure about the following two assertions;
149 maybe I need to propagate the new subst and metasenv *)
151 assert (metasenv' = metasenv);
153 let b,u1 = CicReduction.are_convertible ~subst context term t u in
155 raise AllSelectedTermsMustBeConvertible
158 ) u terms_with_context) ;
164 (mk_fresh_name_callback metasenv context C.Anonymous ~typ:typ),
166 (ProofEngineReduction.replace_lifting_csc 1
168 ~what:(List.map snd terms_with_context)
169 ~with_what:(List.map (function _ -> C.Rel 1) terms_with_context)
173 [(P.apply_tac ~term:(C.Appl [C.Rel 1; CicSubstitution.lift 1 term])) ;
177 PET.mk_tactic (generalize_tac mk_fresh_name_callback ~pattern)