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 S = CicSubstitution
30 module TC = CicTypeChecker
32 module UM = UriManager
33 module Obj = LibraryObjects
34 module HObj = HelmLibraryObjects
37 module E = CicEnvironment
39 module PEH = ProofEngineHelpers
42 module Cl = ProceduralClassify
43 module T = ProceduralTypes
44 module Cn = ProceduralConversion
47 sorts : (C.id, A.sort_kind) Hashtbl.t;
48 types : (C.id, A.anntypes) Hashtbl.t;
50 max_depth: int option;
56 (* helpers ******************************************************************)
58 let cic = D.deannotate_term
60 let split2_last l1 l2 =
62 let n = pred (List.length l1) in
63 let before1, after1 = HEL.split_nth n l1 in
64 let before2, after2 = HEL.split_nth n l2 in
65 before1, before2, List.hd after1, List.hd after2
66 with Invalid_argument _ -> failwith "A2P.split2_last"
68 let string_of_head = function
70 | C.AConst _ -> "const"
71 | C.AMutInd _ -> "mutind"
72 | C.AMutConstruct _ -> "mutconstruct"
76 | C.ALambda _ -> "lambda"
77 | C.ALetIn _ -> "letin"
79 | C.ACoFix _ -> "cofix"
82 | C.AMutCase _ -> "mutcase"
84 | C.AImplicit _ -> "implict"
86 let clear st = {st with intros = []}
88 let next st = {(clear st) with depth = succ st.depth}
90 let add st entry intro =
91 {st with context = entry :: st.context; intros = intro :: st.intros}
95 let msg = Printf.sprintf "Depth %u: " st.depth in
96 match st.max_depth with
98 | Some d -> if st.depth < d then true, msg else false, "DEPTH EXCEDED: "
99 with Invalid_argument _ -> failwith "A2P.test_depth"
101 let is_rewrite_right = function
102 | C.AConst (_, uri, []) ->
103 UM.eq uri HObj.Logic.eq_ind_r_URI || Obj.is_eq_ind_r_URI uri
106 let is_rewrite_left = function
107 | C.AConst (_, uri, []) ->
108 UM.eq uri HObj.Logic.eq_ind_URI || Obj.is_eq_ind_URI uri
111 let is_fwd_rewrite_right hd tl =
112 if is_rewrite_right hd then match List.nth tl 3 with
117 let is_fwd_rewrite_left hd tl =
118 if is_rewrite_left hd then match List.nth tl 3 with
123 let get_ind_name uri tno xcno =
125 let ts = match E.get_obj Un.empty_ugraph uri with
126 | C.InductiveDefinition (ts, _, _,_), _ -> ts
129 let tname, cs = match List.nth ts tno with
130 | (name, _, _, cs) -> name, cs
134 | Some cno -> fst (List.nth cs (pred cno))
135 with Invalid_argument _ -> failwith "A2P.get_ind_name"
137 let get_inner_types st v =
139 let id = Ut.id_of_annterm v in
140 try match Hashtbl.find st.types id with
141 | {A.annsynthesized = st; A.annexpected = Some et} -> Some (st, et)
142 | {A.annsynthesized = st; A.annexpected = None} -> Some (st, st)
143 with Not_found -> None
144 with Invalid_argument _ -> failwith "A2P.get_inner_types"
146 let get_inner_sort st v =
148 let id = Ut.id_of_annterm v in
149 try Hashtbl.find st.sorts id
150 with Not_found -> `Type (CicUniv.fresh())
151 with Invalid_argument _ -> failwith "A2P.get_sort"
153 let get_type msg st bo =
155 let ty, _ = TC.type_of_aux' [] st.context (cic bo) Un.empty_ugraph in
157 with e -> failwith (msg ^ ": " ^ Printexc.to_string e)
159 let get_entry st id =
160 let rec aux = function
162 | Some (C.Name name, e) :: _ when name = id -> e
167 (* proof construction *******************************************************)
169 let unused_premise = "UNUSED"
171 let mk_exp_args hd tl classes synth =
172 let meta id = C.AImplicit (id, None) in
174 if I.overlaps synth cl && b then v else meta ""
176 let rec aux = function
178 | hd :: tl -> if hd = meta "" then aux tl else List.rev (hd :: tl)
180 let args = T.list_rev_map2 map tl classes in
181 let args = aux args in
182 if args = [] then hd else C.AAppl ("", hd :: args)
184 let convert st ?name v =
185 match get_inner_types st v with
188 let e = Cn.mk_pattern 0 (T.mk_arel 1 "") in
189 let csty, cety = cic sty, cic ety in
190 if Ut.alpha_equivalence csty cety then [] else
192 | None -> [T.Change (sty, ety, None, e, "")]
194 begin match get_entry st id with
195 | C.Def _ -> [T.ClearBody (id, "")]
197 let w = S.lift i w in
198 if Ut.alpha_equivalence csty w then []
200 [T.Note (Pp.ppterm csty); T.Note (Pp.ppterm w);
201 T.Change (sty, ety, Some (id, id), e, "")]
204 let get_intro = function
205 | C.Anonymous -> unused_premise
208 let mk_intros st script =
209 if st.intros = [] then script else
210 let count = List.length st.intros in
211 T.Intros (Some count, List.rev st.intros, "") :: script
213 let mk_arg st = function
214 | C.ARel (_, _, i, name) as what -> convert st ~name:(name, i) what
217 let mk_fwd_rewrite st dtext name tl direction =
218 assert (List.length tl = 6);
219 let what, where, predicate = List.nth tl 5, List.nth tl 3, List.nth tl 2 in
220 let e = Cn.mk_pattern 1 predicate in
222 | C.ARel (_, _, _, premise) ->
223 let script = mk_arg st what in
224 let where = Some (premise, name) in
225 T.Rewrite (direction, what, where, e, dtext) :: script
228 let mk_rewrite st dtext what qs tl direction =
229 assert (List.length tl = 5);
230 let predicate = List.nth tl 2 in
231 let e = Cn.mk_pattern 1 predicate in
232 [T.Rewrite (direction, what, None, e, dtext); T.Branch (qs, "")]
234 let rec proc_lambda st name v t =
235 let entry = Some (name, C.Decl (cic v)) in
236 let intro = get_intro name in
237 proc_proof (add st entry intro) t
239 and proc_letin st what name v t =
240 let intro = get_intro name in
241 let proceed, dtext = test_depth st in
242 let script = if proceed then
243 let hyp, rqv = match get_inner_types st v with
245 let rqv = match v with
246 | C.AAppl (_, hd :: tl) when is_fwd_rewrite_right hd tl ->
247 mk_fwd_rewrite st dtext intro tl true
248 | C.AAppl (_, hd :: tl) when is_fwd_rewrite_left hd tl ->
249 mk_fwd_rewrite st dtext intro tl false
251 let qs = [proc_proof (next st) v; [T.Id ""]] in
252 [T.Branch (qs, ""); T.Cut (intro, ity, dtext)]
254 C.Decl (cic ity), rqv
256 C.Def (cic v, None), [T.LetIn (intro, v, dtext)]
258 let entry = Some (name, hyp) in
259 let qt = proc_proof (next (add st entry intro)) t in
260 List.rev_append rqv qt
262 [T.Apply (what, dtext)]
266 and proc_rel st what =
267 let _, dtext = test_depth st in
268 let text = "assumption" in
269 let script = [T.Apply (what, dtext ^ text)] in
272 and proc_mutconstruct st what =
273 let _, dtext = test_depth st in
274 let script = [T.Apply (what, dtext)] in
277 and proc_appl st what hd tl =
278 let proceed, dtext = test_depth st in
279 let script = if proceed then
280 let ty = get_type "TC2" st hd in
281 let (classes, rc) as h = Cl.classify st.context ty in
282 let goal_arity = match get_inner_types st what with
284 | Some (ity, _) -> snd (PEH.split_with_whd (st.context, cic ity))
286 let argsno = List.length classes in
287 let decurry = argsno - List.length tl in
288 let diff = goal_arity - decurry in
289 if diff < 0 then failwith (Printf.sprintf "NOT TOTAL: %i %s |--- %s" diff (Pp.ppcontext st.context) (Pp.ppterm (cic hd)));
290 let rec mk_synth a n =
291 if n < 0 then a else mk_synth (I.S.add n a) (pred n)
293 let synth = mk_synth I.S.empty decurry in
294 let text = "" (* Printf.sprintf "%u %s" argsno (Cl.to_string h) *) in
295 let script = List.rev (mk_arg st hd) @ convert st what in
298 let classes, tl, _, where = split2_last classes tl in
299 let script = List.rev (mk_arg st where) @ script in
300 let synth = I.S.add 1 synth in
301 let qs = proc_bkd_proofs (next st) synth classes tl in
302 if is_rewrite_right hd then
303 script @ mk_rewrite st dtext where qs tl false
304 else if is_rewrite_left hd then
305 script @ mk_rewrite st dtext where qs tl true
307 let predicate = List.nth tl (argsno - i) in
308 let e = Cn.mk_pattern 0 (T.mk_arel 1 "") (* j predicate *) in
309 let using = Some hd in
311 [T.Elim (where, using, e, dtext ^ text); T.Branch (qs, "")]
313 let qs = proc_bkd_proofs (next st) synth classes tl in
314 let hd = mk_exp_args hd tl classes synth in
315 script @ [T.Apply (hd, dtext ^ text); T.Branch (qs, "")]
317 [T.Apply (what, dtext)]
321 and proc_other st what =
322 let text = Printf.sprintf "%s: %s" "UNEXPANDED" (string_of_head what) in
323 let script = [T.Note text] in
326 and proc_proof st = function
327 | C.ALambda (_, name, w, t) -> proc_lambda st name w t
328 | C.ALetIn (_, name, v, t) as what -> proc_letin st what name v t
329 | C.ARel _ as what -> proc_rel st what
330 | C.AMutConstruct _ as what -> proc_mutconstruct st what
331 | C.AAppl (_, hd :: tl) as what -> proc_appl st what hd tl
332 | what -> proc_other st what
334 and proc_bkd_proofs st synth classes ts =
336 let _, dtext = test_depth st in
338 if I.overlaps synth inv then None else
339 if I.S.is_empty inv then Some (proc_proof st v) else
340 Some [T.Apply (v, dtext ^ "dependent")]
342 List.rev (T.list_map2_filter aux classes ts)
343 with Invalid_argument s -> failwith ("A2P.proc_bkd_proofs: " ^ s)
345 (* object costruction *******************************************************)
347 let is_theorem pars =
348 List.mem (`Flavour `Theorem) pars || List.mem (`Flavour `Fact) pars ||
349 List.mem (`Flavour `Remark) pars || List.mem (`Flavour `Lemma) pars
351 let proc_obj st = function
352 | C.AConstant (_, _, s, Some v, t, [], pars) when is_theorem pars ->
353 let ast = proc_proof st v in
354 let count = T.count_steps 0 ast in
355 let text = Printf.sprintf "tactics: %u" count in
356 T.Theorem (s, t, text) :: ast @ [T.Qed ""]
358 failwith "not a theorem"
360 (* interface functions ******************************************************)
362 let acic2procedural ~ids_to_inner_sorts ~ids_to_inner_types ?depth prefix aobj =
364 sorts = ids_to_inner_sorts;
365 types = ids_to_inner_types;
372 HLog.debug "Procedural: level 2 transformation";
373 let steps = proc_obj st aobj in
374 HLog.debug "Procedural: grafite rendering";
375 List.rev (T.render_steps [] steps)