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/.
26 let search_theorems_in_context ~status:((proof,goal) as status) =
28 let module R = CicReduction in
29 let module S = CicSubstitution in
30 prerr_endline "Entro in search_context";
31 let _,metasenv,_,_ = proof in
32 let _,context,ty = CicUtil.lookup_meta goal metasenv in
33 let rec find n = function
38 Some (PrimitiveTactics.apply_tac ~status ~term:(C.Rel n))
40 ProofEngineTypes.Fail _ -> None in
42 Some res -> res::(find (n+1) tl)
43 | None -> find (n+1) tl)
46 let res = find 1 context in
47 prerr_endline "Ho finito context";
50 prerr_endline ("SIAM QUI = " ^ s); []
54 exception NotApplicableTheorem;;
59 let rec auto_tac mqi_handle level proof goal =
60 prerr_endline "Entro in Auto_rec";
63 (prerr_endline ("NON ci credo");
66 (* choices is a list of pairs proof and goallist *)
68 (search_theorems_in_context ~status:(proof,goal))@
69 (TacticChaser.searchTheorems mqi_handle ~status:(proof,goal))
71 let rec try_choices = function
72 [] -> raise NotApplicableTheorem
73 | (proof,goallist)::tl ->
74 prerr_endline ("GOALLIST = " ^ string_of_int (List.length goallist));
77 (fun (proof,opengoals) goal ->
78 let newproof, newgoals = auto_tac mqi_handle (level-1) proof goal in
79 (newproof, newgoals@opengoals))
83 | NotApplicableTheorem ->
87 let auto_tac mqi_handle ~status:(proof,goal) =
88 prerr_endline "Entro in Auto";
90 let res = auto_tac mqi_handle depth proof goal in
91 prerr_endline "AUTO_TAC HA FINITO";
94 | MaxDepth -> assert false (* this should happens only if depth is 0 above *)
95 | NotApplicableTheorem ->
96 prerr_endline("No applicable theorem");
97 raise (ProofEngineTypes.Fail "No Applicable theorem");;
99 (* TODO se ce n'e' piu' di una, prende la prima che trova... sarebbe meglio
100 chiedere: find dovrebbe restituire una lista di hyp (?) da passare all'utonto con una
101 funzione di callback che restituisce la (sola) hyp da applicare *)
103 let assumption_tac ~status:((proof,goal) as status) =
104 let module C = Cic in
105 let module R = CicReduction in
106 let module S = CicSubstitution in
107 let _,metasenv,_,_ = proof in
108 let _,context,ty = CicUtil.lookup_meta goal metasenv in
109 let rec find n = function
112 (Some (_, C.Decl t)) when
113 (R.are_convertible context (S.lift n t) ty) -> n
114 | (Some (_, C.Def (_,Some ty'))) when
115 (R.are_convertible context ty' ty) -> n
116 | (Some (_, C.Def (t,None))) when
117 (R.are_convertible context
118 (CicTypeChecker.type_of_aux' metasenv context (S.lift n t)) ty) -> n
121 | [] -> raise (ProofEngineTypes.Fail "Assumption: No such assumption")
122 in PrimitiveTactics.apply_tac ~status ~term:(C.Rel (find 1 context))
125 (* ANCORA DA DEBUGGARE *)
127 exception AllSelectedTermsMustBeConvertible;;
129 (* serve una funzione che cerchi nel ty dal basso a partire da term, i lambda
130 e li aggiunga nel context, poi si conta la lunghezza di questo nuovo
131 contesto e si lifta di tot... COSA SIGNIFICA TUTTO CIO'?????? *)
134 ?(mk_fresh_name_callback = FreshNamesGenerator.mk_fresh_name)
135 terms ~status:((proof,goal) as status)
137 let module C = Cic in
138 let module P = PrimitiveTactics in
139 let module T = Tacticals in
140 let _,metasenv,_,_ = proof in
141 let _,context,ty = CicUtil.lookup_meta goal metasenv in
146 (* We need to check that all the convertibility of all the terms *)
149 if not (CicReduction.are_convertible context he t) then
150 raise AllSelectedTermsMustBeConvertible
152 (CicTypeChecker.type_of_aux' metasenv context he)
158 (mk_fresh_name_callback metasenv context C.Anonymous typ),
160 (ProofEngineReduction.replace_lifting_csc 1
163 ~with_what:(List.map (function _ -> C.Rel 1) terms)
166 ~continuations: [(P.apply_tac ~term:(C.Rel 1)) ; T.id_tac]