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/.
28 module S = CicSubstitution
29 module TC = CicTypeChecker
31 module UM = UriManager
32 module Obj = LibraryObjects
35 module E = CicEnvironment
37 module PEH = ProofEngineHelpers
39 module DTI = DoubleTypeInference
40 module NU = CicNotationUtil
44 module Cl = ProceduralClassify
45 module T = ProceduralTypes
46 module Cn = ProceduralConversion
47 module H = ProceduralHelpers
50 sorts : (C.id, A.sort_kind) Hashtbl.t;
51 types : (C.id, A.anntypes) Hashtbl.t;
52 params : G.inline_param list;
53 max_depth: int option;
62 (* helpers ******************************************************************)
64 let split2_last l1 l2 =
66 let n = pred (List.length l1) in
67 let before1, after1 = HEL.split_nth n l1 in
68 let before2, after2 = HEL.split_nth 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 next st = {st with depth = succ st.depth}
92 let add st entry = {st with context = entry :: st.context}
94 let push st = {st with case = 1 :: st.case}
97 {st with case = match st.case with
99 | hd :: tl -> succ hd :: tl
103 let case = String.concat "." (List.rev_map string_of_int st.case) in
104 Printf.sprintf "case %s: %s" case str
108 let msg = Printf.sprintf "Depth %u: " st.depth in
109 match st.max_depth with
111 | Some d -> if st.depth < d then true, msg else false, "DEPTH EXCEDED: "
112 with Invalid_argument _ -> failwith "A2P.test_depth"
114 let is_rewrite_right st = function
115 | C.AConst (_, uri, []) -> st.defaults && Obj.is_eq_ind_r_URI uri
118 let is_rewrite_left st = function
119 | C.AConst (_, uri, []) -> st.defaults && Obj.is_eq_ind_URI uri
122 let is_fwd_rewrite_right st hd tl =
123 if is_rewrite_right st hd then match List.nth tl 3 with
128 let is_fwd_rewrite_left st hd tl =
129 if is_rewrite_left st hd then match List.nth tl 3 with
134 let get_inner_types st v =
136 let id = Ut.id_of_annterm v in
137 try match Hashtbl.find st.types id with
138 | {A.annsynthesized = st; A.annexpected = Some et} -> Some (st, et)
139 | {A.annsynthesized = st; A.annexpected = None} -> Some (st, st)
140 with Not_found -> None
141 with Invalid_argument _ -> failwith "A2P.get_inner_types"
143 let get_entry st id =
144 let rec aux = function
146 | Some (C.Name name, e) :: _ when name = id -> e
151 let string_of_atomic = function
152 | C.ARel (_, _, _, s) -> s
153 | C.AVar (_, uri, _) -> H.name_of_uri uri None None
154 | C.AConst (_, uri, _) -> H.name_of_uri uri None None
155 | C.AMutInd (_, uri, i, _) -> H.name_of_uri uri (Some i) None
156 | C.AMutConstruct (_, uri, i, j, _) -> H.name_of_uri uri (Some i) (Some j)
159 let get_sub_names head l =
160 let s = string_of_atomic head in
161 if s = "" then [] else
162 let map (names, i) _ =
163 let name = Printf.sprintf "%s_%u" s i in name :: names, succ i
165 let names, _ = List.fold_left map ([], 1) l in
168 let get_type msg st t = H.get_type msg st.context (H.cic t)
170 (* proof construction *******************************************************)
172 let anonymous_premise = C.Name "UNNAMED"
174 let mk_exp_args hd tl classes synth =
175 let meta id = C.AImplicit (id, None) in
177 if I.overlaps synth cl && b then v else meta ""
179 let rec aux b = function
182 if hd = meta "" then aux true tl else b, List.rev (hd :: tl)
184 let args = T.list_rev_map2 map tl classes in
185 let b, args = aux false args in
186 if args = [] then b, hd else b, C.AAppl ("", hd :: args)
188 let mk_convert st ?name sty ety note =
190 let a = ref "" in Ut.pp_term (fun s -> a := !a ^ s) [] st.context t; !a
192 let e = Cn.hole "" in
193 let csty, cety = H.cic sty, H.cic ety in
196 let sname = match name with None -> "" | Some (id, _) -> id in
197 Printf.sprintf "%s: %s\nSINTH: %s\nEXP: %s"
198 note sname (ppterm csty) (ppterm cety)
201 if H.alpha_equivalence ~flatten:true st.context csty cety then [T.Note note] else
202 let sty, ety = H.acic_bc st.context sty, H.acic_bc st.context ety in
204 | None -> [T.Change (sty, ety, None, e, note)]
206 begin match get_entry st id with
207 | C.Def _ -> assert false (* T.ClearBody (id, "") :: script *)
209 [T.Change (ety, sty, Some (id, Some id), e, note)]
212 let convert st ?name v =
213 match get_inner_types st v with
215 if !debug then [T.Note "NORMAL: NO INNER TYPES"] else []
216 | Some (sty, ety) -> mk_convert st ?name sty ety "NORMAL"
218 let get_intro = function
219 | C.Anonymous -> None
222 let mk_preamble st what script = match script with
223 | T.Exact _ :: _ -> script
224 | _ -> convert st what @ script
226 let mk_arg st = function
227 | C.ARel (_, _, i, name) as what -> convert st ~name:(name, i) what
230 let mk_fwd_rewrite st dtext name tl direction v t ity =
231 let compare premise = function
233 | Some s -> s = premise
235 assert (List.length tl = 6);
236 let what, where, predicate = List.nth tl 5, List.nth tl 3, List.nth tl 2 in
237 let e = Cn.mk_pattern 1 predicate in
238 if (Cn.does_not_occur e) then st, [] else
240 | C.ARel (_, _, i, premise) as w ->
242 let where = Some (premise, name) in
243 let script = mk_arg st what @ mk_arg st w in
244 T.Rewrite (direction, what, where, e, dtext) :: script
246 if DTI.does_not_occur (succ i) (H.cic t) || compare premise name then
247 {st with context = Cn.clear st.context premise}, script name
249 assert (Ut.is_sober st.context (H.cic ity));
250 let ity = H.acic_bc st.context ity in
251 let br1 = [T.Id ""] in
252 let br2 = List.rev (T.Exact (w, "assumption") :: script None) in
253 let text = "non-linear rewrite" in
254 st, [T.Branch ([br2; br1], ""); T.Cut (name, ity, text)]
258 let mk_rewrite st dtext where qs tl direction t =
259 assert (List.length tl = 5);
260 let predicate = List.nth tl 2 in
261 let e = Cn.mk_pattern 1 predicate in
262 let script = [T.Branch (qs, "")] in
263 if (Cn.does_not_occur e) then script else
264 T.Rewrite (direction, where, None, e, dtext) :: script
266 let rec proc_lambda st what name v t =
267 let name = match name with
268 | C.Anonymous -> H.mk_fresh_name true st.context anonymous_premise
271 let entry = Some (name, C.Decl (H.cic v)) in
272 let intro = get_intro name in
273 let script = proc_proof (add st entry) t in
274 let script = T.Intros (Some 1, [intro], "") :: script in
275 mk_preamble st what script
277 and proc_letin st what name v w t =
278 let intro = get_intro name in
279 let proceed, dtext = test_depth st in
280 let script = if proceed then
281 let st, hyp, rqv = match get_inner_types st v with
283 let st, rqv = match v with
284 | C.AAppl (_, hd :: tl) when is_fwd_rewrite_right st hd tl ->
285 mk_fwd_rewrite st dtext intro tl true v t ity
286 | C.AAppl (_, hd :: tl) when is_fwd_rewrite_left st hd tl ->
287 mk_fwd_rewrite st dtext intro tl false v t ity
289 assert (Ut.is_sober st.context (H.cic ity));
290 let ity = H.acic_bc st.context ity in
291 let qs = [proc_proof (next st) v; [T.Id ""]] in
292 st, [T.Branch (qs, ""); T.Cut (intro, ity, dtext)]
294 st, C.Decl (H.cic ity), rqv
296 st, C.Def (H.cic v, H.cic w), [T.LetIn (intro, v, dtext)]
298 let entry = Some (name, hyp) in
299 let qt = proc_proof (next (add st entry)) t in
300 List.rev_append rqv qt
302 [T.Exact (what, dtext)]
304 mk_preamble st what script
306 and proc_rel st what =
307 let _, dtext = test_depth st in
308 let text = "assumption" in
309 let script = [T.Exact (what, dtext ^ text)] in
310 mk_preamble st what script
312 and proc_mutconstruct st what =
313 let _, dtext = test_depth st in
314 let script = [T.Exact (what, dtext)] in
315 mk_preamble st what script
317 and proc_const st what =
318 let _, dtext = test_depth st in
319 let script = [T.Exact (what, dtext)] in
320 mk_preamble st what script
322 and proc_appl st what hd tl =
323 let proceed, dtext = test_depth st in
324 let script = if proceed then
325 let ty = match get_inner_types st hd with
326 | Some (ity, _) -> H.cic ity
327 | None -> get_type "TC2" st hd
329 let classes, rc = Cl.classify st.context ty in
330 let goal_arity, goal = match get_inner_types st what with
333 snd (PEH.split_with_whd (st.context, H.cic ity)), Some (H.cic ety)
335 let parsno, argsno = List.length classes, List.length tl in
336 let decurry = parsno - argsno in
337 let diff = goal_arity - decurry in
338 if diff < 0 then failwith (Printf.sprintf "NOT TOTAL: %i %s |--- %s" diff (Pp.ppcontext st.context) (Pp.ppterm (H.cic hd)));
339 let classes = Cl.adjust st.context tl ?goal classes in
340 let rec mk_synth a n =
341 if n < 0 then a else mk_synth (I.S.add n a) (pred n)
343 let synth = mk_synth I.S.empty decurry in
344 let text = "" (* Printf.sprintf "%u %s" parsno (Cl.to_string h) *) in
345 let script = List.rev (mk_arg st hd) in
346 let tactic b t n = if b then T.Apply (t, n) else T.Exact (t, n) in
348 | Some (i, j, uri, tyno) ->
349 let classes2, tl2, _, where = split2_last classes tl in
350 let script2 = List.rev (mk_arg st where) @ script in
351 let synth2 = I.S.add 1 synth in
352 let names = H.get_ind_names uri tyno in
353 let qs = proc_bkd_proofs (next st) synth2 names classes2 tl2 in
354 if List.length qs <> List.length names then
355 let qs = proc_bkd_proofs (next st) synth [] classes tl in
356 let b, hd = mk_exp_args hd tl classes synth in
357 script @ [tactic b hd (dtext ^ text); T.Branch (qs, "")]
358 else if is_rewrite_right st hd then
359 script2 @ mk_rewrite st dtext where qs tl2 false what
360 else if is_rewrite_left st hd then
361 script2 @ mk_rewrite st dtext where qs tl2 true what
363 let predicate = List.nth tl2 (parsno - i) in
364 let e = Cn.mk_pattern j predicate in
365 let using = Some hd in
367 [T.Elim (where, using, e, dtext ^ text); T.Branch (qs, "")]
369 let names = get_sub_names hd tl in
370 let qs = proc_bkd_proofs (next st) synth names classes tl in
371 let b, hd = mk_exp_args hd tl classes synth in
372 script @ [tactic b hd (dtext ^ text); T.Branch (qs, "")]
374 [T.Exact (what, dtext)]
376 mk_preamble st what script
378 and proc_case st what uri tyno u v ts =
379 let proceed, dtext = test_depth st in
380 let script = if proceed then
381 let synth, classes = I.S.empty, Cl.make ts in
382 let names = H.get_ind_names uri tyno in
383 let qs = proc_bkd_proofs (next st) synth names classes ts in
384 let lpsno, _ = H.get_ind_type uri tyno in
385 let ps, _ = H.get_ind_parameters st.context (H.cic v) in
386 let _, rps = HEL.split_nth lpsno ps in
387 let rpsno = List.length rps in
388 let e = Cn.mk_pattern rpsno u in
390 let script = List.rev (mk_arg st v) in
391 script @ [T.Cases (v, e, dtext ^ text); T.Branch (qs, "")]
393 [T.Exact (what, dtext)]
395 mk_preamble st what script
397 and proc_other st what =
398 let _, dtext = test_depth st in
399 let text = Printf.sprintf "%s: %s" "UNEXPANDED" (string_of_head what) in
400 let script = [T.Exact (what, dtext ^ text)] in
401 mk_preamble st what script
403 and proc_proof st t =
405 let xtypes, note = match get_inner_types st t with
406 | Some (it, et) -> Some (H.cic it, H.cic et),
407 (Printf.sprintf "\nInferred: %s\nExpected: %s"
408 (Pp.ppterm (H.cic it)) (Pp.ppterm (H.cic et)))
409 | None -> None, "\nNo types"
411 let context, _clears = Cn.get_clears st.context (H.cic t) xtypes in
412 {st with context = context}
415 | C.ALambda (_, name, w, t) as what -> proc_lambda (f st) what name w t
416 | C.ALetIn (_, name, v, w, t) as what -> proc_letin (f st) what name v w t
417 | C.ARel _ as what -> proc_rel (f st) what
418 | C.AMutConstruct _ as what -> proc_mutconstruct (f st) what
419 | C.AConst _ as what -> proc_const (f st) what
420 | C.AAppl (_, hd :: tl) as what -> proc_appl (f st) what hd tl
421 (* FG: we deactivate the tactic "cases" because it does not work properly
422 | C.AMutCase (_, uri, i, u, v, ts) as what -> proc_case (f st) what uri i u v ts
424 | what -> proc_other (f st) what
426 and proc_bkd_proofs st synth names classes ts =
428 let get_names b = ref (names, if b then push st else st) in
429 let get_note f b names =
432 | "" :: tl, st -> names := tl, st; f st
434 let note = case st hd in
436 if b then T.Note note :: f st else f st
438 let _, dtext = test_depth st in
440 if I.overlaps synth inv then None else
441 if I.S.is_empty inv then Some (get_note (fun st -> proc_proof st v)) else
442 Some (get_note (fun _ -> [T.Exact (v, dtext ^ "dependent")]))
444 let ps = T.list_map2_filter aux classes ts in
445 let b = List.length ps > 1 in
446 let names = get_names b in
447 List.rev_map (fun f -> f b names) ps
449 with Invalid_argument s -> failwith ("A2P.proc_bkd_proofs: " ^ s)
451 (* initialization ***********************************************************)
453 let init ~ids_to_inner_sorts ~ids_to_inner_types params context =
454 let depth_map x y = match x, y with
455 | None, G.IPDepth depth -> Some depth
459 sorts = ids_to_inner_sorts;
460 types = ids_to_inner_types;
462 max_depth = List.fold_left depth_map None params;
464 defaults = not (List.mem G.IPNoDefaults params);