1 (* Copyright (C) 2003-2005, 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 module DTI = DoubleTypeInference
30 module TC = CicTypeChecker
32 module UM = UriManager
33 module Obj = LibraryObjects
34 module HObj = HelmLibraryObjects
37 module E = CicEnvironment
38 module PER = ProofEngineReduction
40 module Cl = ProceduralClassify
41 module M = ProceduralMode
42 module T = ProceduralTypes
43 module Cn = ProceduralConversion
46 sorts : (C.id, A.sort_kind) Hashtbl.t;
47 types : (C.id, A.anntypes) Hashtbl.t;
49 max_depth: int option;
56 (* helpers ******************************************************************)
60 let comp f g x = f (g x)
62 let cic = D.deannotate_term
64 let split2_last l1 l2 =
66 let n = pred (List.length l1) in
67 let before1, after1 = T.list_split n l1 in
68 let before2, after2 = T.list_split n l2 in
69 before1, before2, List.hd after1, List.hd after2
70 with Invalid_argument _ -> failwith "A2P.split2_last"
72 let string_of_head = function
74 | C.AConst _ -> "const"
75 | C.AMutInd _ -> "mutind"
76 | C.AMutConstruct _ -> "mutconstruct"
80 | C.ALambda _ -> "lambda"
81 | C.ALetIn _ -> "letin"
83 | C.ACoFix _ -> "cofix"
86 | C.AMutCase _ -> "mutcase"
88 | C.AImplicit _ -> "implict"
90 let clear st = {st with intros = []; ety = None}
92 let next st = {(clear st) with depth = succ st.depth}
95 if st.ety = None then {st with ety = ety} else st
97 let add st entry intro ety =
98 let st = set_ety st ety in
99 {st with context = entry :: st.context; intros = intro :: st.intros}
103 let msg = Printf.sprintf "Depth %u: " st.depth in
104 match st.max_depth with
106 | Some d -> if st.depth < d then true, msg else false, "DEPTH EXCEDED: "
107 with Invalid_argument _ -> failwith "A2P.test_depth"
109 let is_rewrite_right = function
110 | C.AConst (_, uri, []) ->
111 UM.eq uri HObj.Logic.eq_ind_r_URI || Obj.is_eq_ind_r_URI uri
114 let is_rewrite_left = function
115 | C.AConst (_, uri, []) ->
116 UM.eq uri HObj.Logic.eq_ind_URI || Obj.is_eq_ind_URI uri
119 let get_ind_name uri tno xcno =
121 let ts = match E.get_obj Un.empty_ugraph uri with
122 | C.InductiveDefinition (ts, _, _,_), _ -> ts
125 let tname, cs = match List.nth ts tno with
126 | (name, _, _, cs) -> name, cs
130 | Some cno -> fst (List.nth cs (pred cno))
131 with Invalid_argument _ -> failwith "A2P.get_ind_name"
133 let get_inner_types st v =
135 let id = Ut.id_of_annterm v in
136 try match Hashtbl.find st.types id with
137 | {A.annsynthesized = st; A.annexpected = Some et} -> Some (st, et)
138 | {A.annsynthesized = st; A.annexpected = None} -> Some (st, st)
139 with Not_found -> None
140 with Invalid_argument _ -> failwith "A2P.get_inner_types"
142 let get_inner_sort st v =
144 let id = Ut.id_of_annterm v in
145 try Hashtbl.find st.sorts id
146 with Not_found -> `Type (CicUniv.fresh())
147 with Invalid_argument _ -> failwith "A2P.get_sort"
149 (* proof construction *******************************************************)
151 let unused_premise = "UNUSED"
153 let defined_premise = "DEFINED"
155 let assumed_premise = "ASSUMED"
157 let expanded_premise = "EXPANDED"
160 match get_inner_types st v with
162 let cst, cet = cic st, cic et in
163 if PER.alpha_equivalence cst cet then [] else
164 [T.Change (st, et, "")]
168 let ty = C.AImplicit ("", None) in
169 let name i = Printf.sprintf "%s%u" expanded_premise i in
170 let lambda i t = C.ALambda ("", C.Name (name i), ty, t) in
171 let arg i n = T.mk_arel (n - i) (name i) in
173 if i >= n then f, a else aux (succ i) (comp f (lambda i)) (arg i n :: a)
175 let absts, args = aux 0 id [] in
176 match Cn.lift 1 n t with
177 | C.AAppl (id, ts) -> absts (C.AAppl (id, ts @ args))
178 | t -> absts (C.AAppl ("", t :: args))
180 let appl_expand n = function
181 | C.AAppl (id, ts) ->
182 let before, after = T.list_split (List.length ts + n) ts in
183 C.AAppl ("", C.AAppl (id, before) :: after)
186 let get_intro name t =
189 | C.Anonymous -> unused_premise
191 if DTI.does_not_occur 1 (cic t) then unused_premise else s
192 with Invalid_argument _ -> failwith "A2P.get_intro"
194 let mk_intros st script =
196 if st.intros = [] then script else
197 let count = List.length st.intros in
198 let p0 = T.Whd (count, "") in
199 let p1 = T.Intros (Some count, List.rev st.intros, "") in
201 | Some ety when Cn.need_whd count ety -> p0 :: p1 :: script
203 with Invalid_argument _ -> failwith "A2P.mk_intros"
205 let rec mk_atomic st dtext what =
206 if T.is_atomic what then [], what else
207 let name = defined_premise in
208 mk_fwd_proof st dtext name what, T.mk_arel 0 name
210 and mk_fwd_rewrite st dtext name tl direction =
211 let what, where = List.nth tl 5, List.nth tl 3 in
212 let rewrite premise =
213 let script, what = mk_atomic st dtext what in
214 T.Rewrite (direction, what, Some (premise, name), dtext) :: script
217 | C.ARel (_, _, _, binder) -> rewrite binder
219 assert (get_inner_sort st where = `Prop);
220 let pred, old = List.nth tl 2, List.nth tl 1 in
221 let pred_name = defined_premise in
222 let pred_text = "extracted" in
223 let p1 = T.LetIn (pred_name, pred, pred_text) in
224 let cut_name = assumed_premise in
225 let cut_type = C.AAppl ("", [T.mk_arel 0 pred_name; old]) in
227 let p2 = T.Cut (cut_name, cut_type, cut_text) in
228 let qs = [rewrite cut_name; mk_proof (next st) where] in
229 [T.Branch (qs, ""); p2; p1]
231 and mk_fwd_proof st dtext name = function
232 | C.AAppl (_, hd :: tl) as v ->
233 if is_rewrite_right hd then mk_fwd_rewrite st dtext name tl true else
234 if is_rewrite_left hd then mk_fwd_rewrite st dtext name tl false else
235 let ty, _ = TC.type_of_aux' [] st.context (cic hd) Un.empty_ugraph in
236 begin match get_inner_types st v with
237 | Some (ity, _) when M.bkd st.context ty ->
238 let qs = [[T.Id ""]; mk_proof (next st) v] in
239 [T.Branch (qs, ""); T.Cut (name, ity, dtext)]
241 let (classes, rc) as h = Cl.classify st.context ty in
242 let text = Printf.sprintf "%u %s" (List.length classes) (Cl.to_string h) in
243 [T.LetIn (name, v, dtext ^ text)]
245 | C.AMutCase (id, uri, tyno, outty, arg, cases) as v ->
246 begin match Cn.mk_ind st.context id uri tyno outty arg cases with
247 | None -> [T.LetIn (name, v, dtext)]
248 | Some v -> mk_fwd_proof st dtext name v
251 [T.LetIn (name, v, dtext)]
253 and mk_proof st = function
254 | C.ALambda (_, name, v, t) as what ->
255 let entry = Some (name, C.Decl (cic v)) in
256 let intro = get_intro name t in
257 let ety = match get_inner_types st what with
258 | Some (_, ety) -> Some ety
261 mk_proof (add st entry intro ety) t
262 | C.ALetIn (_, name, v, t) as what ->
263 let proceed, dtext = test_depth st in
264 let script = if proceed then
265 let entry = Some (name, C.Def (cic v, None)) in
266 let intro = get_intro name t in
267 let q = mk_proof (next (add st entry intro None)) t in
268 List.rev_append (mk_fwd_proof st dtext intro v) q
270 [T.Apply (what, dtext)]
273 | C.ARel _ as what ->
274 let _, dtext = test_depth st in
275 let text = "assumption" in
276 let script = [T.Apply (what, dtext ^ text)] in
278 | C.AMutConstruct _ as what ->
279 let _, dtext = test_depth st in
280 let script = [T.Apply (what, dtext)] in
282 | C.AAppl (_, hd :: tl) as t ->
283 let proceed, dtext = test_depth st in
284 let script = if proceed then
285 let ty, _ = TC.type_of_aux' [] st.context (cic hd) Un.empty_ugraph in
286 let (classes, rc) as h = Cl.classify st.context ty in
287 let decurry = List.length classes - List.length tl in
288 if decurry < 0 then mk_proof (clear st) (appl_expand decurry t) else
289 if decurry > 0 then mk_proof (clear st) (eta_expand decurry t) else
290 let synth = I.S.singleton 0 in
291 let text = Printf.sprintf "%u %s" (List.length classes) (Cl.to_string h) in
293 | Some (i, j) when i > 1 && i <= List.length classes ->
294 let classes, tl, _, what = split2_last classes tl in
295 let script, what = mk_atomic st dtext what in
296 let synth = I.S.add 1 synth in
297 let qs = mk_bkd_proofs (next st) synth classes tl in
298 if is_rewrite_right hd then
299 List.rev script @ convert st t @
300 [T.Rewrite (false, what, None, dtext); T.Branch (qs, "")]
301 else if is_rewrite_left hd then
302 List.rev script @ convert st t @
303 [T.Rewrite (true, what, None, dtext); T.Branch (qs, "")]
305 let using = Some hd in
306 List.rev script @ convert st t @
307 [T.Elim (what, using, dtext ^ text); T.Branch (qs, "")]
309 let qs = mk_bkd_proofs (next st) synth classes tl in
310 let script, hd = mk_atomic st dtext hd in
311 List.rev script @ convert st t @
312 [T.Apply (hd, dtext ^ text); T.Branch (qs, "")]
317 | C.AMutCase (id, uri, tyno, outty, arg, cases) ->
318 begin match Cn.mk_ind st.context id uri tyno outty arg cases with
320 let text = Printf.sprintf "%s" "UNEXPANDED: mutcase" in
321 let script = [T.Note text] in
323 | Some t -> mk_proof st t
326 let text = Printf.sprintf "%s: %s" "UNEXPANDED" (string_of_head t) in
327 let script = [T.Note text] in
330 and mk_bkd_proofs st synth classes ts =
332 let _, dtext = test_depth st in
334 if I.overlaps synth inv then None else
335 if I.S.is_empty inv then Some (mk_proof st v) else
336 Some [T.Apply (v, dtext ^ "dependent")]
338 T.list_map2_filter aux classes ts
339 with Invalid_argument _ -> failwith "A2P.mk_bkd_proofs"
341 (* object costruction *******************************************************)
343 let is_theorem pars =
344 List.mem (`Flavour `Theorem) pars || List.mem (`Flavour `Fact) pars ||
345 List.mem (`Flavour `Remark) pars || List.mem (`Flavour `Lemma) pars
347 let mk_obj st = function
348 | C.AConstant (_, _, s, Some v, t, [], pars) when is_theorem pars ->
349 let ast = mk_proof (set_ety st (Some t)) v in
350 let count = T.count_steps 0 ast in
351 let text = Printf.sprintf "tactics: %u" count in
352 T.Theorem (s, t, text) :: ast @ [T.Qed ""]
354 failwith "not a theorem"
356 (* interface functions ******************************************************)
358 let acic2procedural ~ids_to_inner_sorts ~ids_to_inner_types ?depth prefix aobj =
360 sorts = ids_to_inner_sorts;
361 types = ids_to_inner_types;
369 HLog.debug "Level 2 transformation";
370 let steps = mk_obj st aobj in
371 HLog.debug "grafite rendering";
372 List.rev (T.render_steps [] steps)