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/.
28 module PEH = ProofEngineHelpers
30 module TC = CicTypeChecker
31 module PET = ProofEngineTypes
32 module S = CicSubstitution
33 module PT = PrimitiveTactics
35 module FNG = FreshNamesGenerator
36 module MI = CicMkImplicit
37 module PESR = ProofEngineStructuralRules
40 let fail_msg0 = "unexported clearbody: invalid argument"
41 let fail_msg2 = "fwd: no applicable simplification"
43 let error msg = raise (PET.Fail (lazy msg))
45 (* unexported tactics *******************************************************)
48 let id_tac (proof,goal) =
50 let _, metasenv, _subst, _, _, _ = proof in
51 let _, _, _ = CicUtil.lookup_meta goal metasenv in
53 with CicUtil.Meta_not_found _ -> (proof, [])
57 let clearbody ~index =
58 let rec find_name index = function
59 | Some (Cic.Name name, _) :: _ when index = 1 -> name
60 | _ :: tail when index > 1 -> find_name (pred index) tail
61 | _ -> error fail_msg0
63 let clearbody status =
64 let (proof, goal) = status in
65 let _, metasenv, _subst, _, _, _ = proof in
66 let _, context, _ = CicUtil.lookup_meta goal metasenv in
67 PET.apply_tactic (PESR.clearbody ~hyp:(find_name index context)) status
69 PET.mk_tactic clearbody
71 (* lapply *******************************************************************)
73 let strip_prods metasenv context ?how_many to_what term =
74 let irl = MI.identity_relocation_list_for_metavariable context in
75 let mk_meta metasenv its_type =
76 let index = MI.new_meta metasenv [] in
77 let metasenv = [index, context, its_type] @ metasenv in
78 metasenv, Cic.Meta (index, irl), index
80 let update_counters = function
81 | None, [] -> None, false, id_tac, []
82 | None, to_what :: tail -> None, true, PT.apply_tac ~term:to_what, tail
83 | Some hm, [] -> Some (pred hm), false, id_tac, []
84 | Some hm, to_what :: tail -> Some (pred hm), true, PT.apply_tac ~term:to_what, tail
86 let rec aux metasenv metas conts tw = function
87 | Some hm, _ when hm <= 0 -> metasenv, metas, conts
88 | xhm, Cic.Prod (Cic.Name _, t1, t2) ->
89 let metasenv, meta, index = mk_meta metasenv t1 in
90 aux metasenv (meta :: metas) (conts @ [id_tac, index]) tw (xhm, (S.subst meta t2))
91 | xhm, Cic.Prod (Cic.Anonymous, t1, t2) ->
92 let xhm, pos, tac, tw = update_counters (xhm, tw) in
93 let metasenv, meta, index = mk_meta metasenv t1 in
94 let conts = if pos then (tac, index) :: conts else conts @ [tac, index] in
95 aux metasenv (meta :: metas) conts tw (xhm, (S.subst meta t2))
96 | _, t -> metasenv, metas, conts
98 aux metasenv [] [] to_what (how_many, term)
100 let get_clearables context terms =
103 | Cic.Appl (Cic.Rel i :: _) -> PEH.get_name context i
106 HEL.list_rev_map_filter aux terms
108 let lapply_tac_aux ?(mk_fresh_name_callback = FreshNamesGenerator.mk_fresh_name ~subst:[])
109 (* ?(substs = []) *) ?how_many ?(to_what = []) what =
110 let letin_tac term = PT.letin_tac ~mk_fresh_name_callback term in
111 let lapply_tac (proof, goal) =
112 let xuri, metasenv, _subst, u, t, attrs = proof in
113 let _, context, _ = CicUtil.lookup_meta goal metasenv in
114 let lemma, _ = TC.type_of_aux' metasenv context what U.oblivion_ugraph in
115 let lemma = FNG.clean_dummy_dependent_types lemma in
116 let metasenv, metas, conts = strip_prods metasenv context ?how_many to_what lemma in
118 match metas with [] -> what | _ -> Cic.Appl (what :: List.rev metas)
121 T.then_ ~start:(letin_tac conclusion)
122 ~continuation:(clearbody ~index:1)
124 let proof = (xuri, metasenv, _subst, u, t, attrs) in
125 let aux (proof, goals) (tac, goal) =
126 let proof, new_goals = PET.apply_tactic tac (proof, goal) in
127 proof, goals @ new_goals
129 List.fold_left aux (proof, []) ((tac, goal) :: conts)
131 PET.mk_tactic lapply_tac
133 let lapply_tac ?(mk_fresh_name_callback = FreshNamesGenerator.mk_fresh_name ~subst:[])
134 (* ?(substs = []) *) ?(linear = false) ?how_many ?(to_what = []) what =
135 let lapply_tac status =
136 let proof, goal = status in
137 let _, metasenv, _subst, _, _, _ = proof in
138 let _, context, _ = CicUtil.lookup_meta goal metasenv in
139 let lapply = lapply_tac_aux ~mk_fresh_name_callback ?how_many ~to_what what in
142 let hyps = get_clearables context (what :: to_what) in
143 T.then_ ~start:lapply
144 ~continuation:(PESR.clear ~hyps) (* T.try_tactic ~tactic: *)
148 PET.apply_tactic tac status
150 PET.mk_tactic lapply_tac
152 (* fwd **********************************************************************)
155 ?(mk_fresh_name_callback = FNG.mk_fresh_name ~subst:[])
157 let lapply_tac to_what lemma =
158 lapply_tac ~mk_fresh_name_callback ~how_many:1 ~to_what:[to_what] lemma
160 let fwd_simpl_tac status =
161 let (proof, goal) = status in
162 let _, metasenv, _subst, _, _, _ = proof in
163 let _, context, ty = CicUtil.lookup_meta goal metasenv in
164 let index, major = PEH.lookup_type metasenv context hyp in
165 match FwdQueries.fwd_simpl ~dbd major with
166 | [] -> error fail_msg2
168 Printf.eprintf "fwd: %s\n" (UriManager.string_of_uri uri); flush stderr;
169 let start = lapply_tac (Cic.Rel index) (Cic.Const (uri, [])) in
170 let tac = T.then_ ~start ~continuation:(PESR.clear ~hyps:[hyp]) in
171 PET.apply_tactic tac status
173 PET.mk_tactic fwd_simpl_tac