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 (* TODO se ce n'e' piu' di una, prende la prima che trova... sarebbe meglio
28 chiedere: find dovrebbe restituire una lista di hyp (?) da passare all'utonto con una
29 funzione di callback che restituisce la (sola) hyp da applicare *)
31 let assumption_tac ~status:((proof,goal) as status) =
33 let module R = CicReduction in
34 let module S = CicSubstitution in
35 let _,metasenv,_,_ = proof in
36 let _,context,ty = List.find (function (m,_,_) -> m=goal) metasenv in
37 let rec find n = function
40 (Some (_, C.Decl t)) when
41 (R.are_convertible context (S.lift n t) ty) -> n
42 | (Some (_, C.Def t)) when
43 (R.are_convertible context
44 (CicTypeChecker.type_of_aux' metasenv context (S.lift n t)) ty) -> n
47 | [] -> raise (ProofEngineTypes.Fail "Assumption: No such assumption")
48 in PrimitiveTactics.apply_tac ~status ~term:(C.Rel (find 1 context))
51 (* ANCORA DA DEBUGGARE *)
53 exception AllSelectedTermsMustBeConvertible;;
55 (* serve una funzione che cerchi nel ty dal basso a partire da term, i lambda
56 e li aggiunga nel context, poi si conta la lunghezza di questo nuovo
57 contesto e si lifta di tot... COSA SIGNIFICA TUTTO CIO'?????? *)
60 ?(mk_fresh_name_callback = ProofEngineHelpers.mk_fresh_name)
61 terms ~status:((proof,goal) as status)
64 let module P = PrimitiveTactics in
65 let module T = Tacticals in
66 let _,metasenv,_,_ = proof in
67 let _,context,ty = List.find (function (m,_,_) -> m=goal) metasenv in
72 (* We need to check that all the convertibility of all the terms *)
75 if not (CicReduction.are_convertible context he t) then
76 raise AllSelectedTermsMustBeConvertible
78 (CicTypeChecker.type_of_aux' metasenv context he)
84 (mk_fresh_name_callback context C.Anonymous typ),
86 (ProofEngineReduction.replace_lifting_csc 1
89 ~with_what:(List.map (function _ -> C.Rel 1) terms)
92 ~continuations: [(P.apply_tac ~term:(C.Rel 1)) ; T.id_tac]
97 (* IN FASE DI IMPLEMENTAZIONE *)
99 let decide_equality_tac =
100 (* il goal e' un termine della forma t1=t2\/~t1=t2; la tattica decide se l'uguaglianza
101 e' vera o no e lo risolve *)
106 let compare_tac ~term ~status:((proof, goal) as status) =
107 (* term is in the form t1=t2; the tactic leaves two goals: in the first you have to *)
108 (* demonstrate the goal with the additional hyp that t1=t2, in the second the hyp is ~t1=t2 *)
109 let module C = Cic in
110 let module U = UriManager in
111 let module P = PrimitiveTactics in
112 let module T = Tacticals in
113 let _,metasenv,_,_ = proof in
114 let _,context,gty = List.find (function (m,_,_) -> m=goal) metasenv in
115 let termty = (CicTypeChecker.type_of_aux' metasenv context term) in
117 (C.Appl [(C.MutInd (uri, 0, [])); _; t1; t2]) when (uri = (U.uri_of_string "cic:/Coq/Init/Logic/eq.ind")) ->
119 let term' = (* (t1=t2)\/~(t1=t2) *)
121 (C.MutInd ((U.uri_of_string "cic:/Coq/Init/Logic/or.ind"), 0, [])) ;
124 (C.MutInd ((U.uri_of_string "cic:/Coq/Init/Logic/eq.ind"), 1, [])) ;
126 C.Appl [C.Const ((U.uri_of_string "cic:/Coq/Init/Logic/not.con"), []) ; t2]
131 ~start:(P.cut_tac term')
133 T.then_ ~start:(P.intros_tac ()) ~continuation:(P.elim_intros_simpl_tac ~term:(C.Rel 1)) ;
135 | (C.Appl [(C.MutInd (uri, 0, [])); _; t1; t2]) when (uri = (U.uri_of_string "cic:/Coq/Init/Logic_Type/eqT.ind")) ->
136 let term' = (* (t1=t2) \/ ~(t1=t2) *)
138 (C.MutInd ((U.uri_of_string "cic:/Coq/Init/Logic/or.ind"), 0, [])) ;
141 (C.MutInd ((U.uri_of_string "cic:/Coq/Init/Logic_Type/eqT.ind"), 1, [])) ;
143 C.Appl [C.Const ((U.uri_of_string "cic:/Coq/Init/Logic/not.con"), []) ; t2]
148 ~start:(P.cut_tac term')
150 T.then_ ~start:(P.intros_tac ()) ~continuation:(P.elim_intros_simpl_tac ~term:(C.Rel 1)) ;
152 | _ -> raise (ProofEngineTypes.Fail "Compare: Not an equality")
156 let discriminate_tac ~term ~status:((proof, goal) as status) =
157 let module C = Cic in
158 let module U = UriManager in
159 let module P = PrimitiveTactics in
160 let module T = Tacticals in