module C = Cic
module I = CicInspect
module D = Deannotate
-module DTI = DoubleTypeInference
module TC = CicTypeChecker
module Un = CicUniv
module UM = UriManager
module PER = ProofEngineReduction
module Pp = CicPp
-module P = ProceduralPreprocess
module Cl = ProceduralClassify
module T = ProceduralTypes
module Cn = ProceduralConversion
| {A.annsynthesized = st; A.annexpected = None} -> Some (st, st)
with Not_found -> None
with Invalid_argument _ -> failwith "A2P.get_inner_types"
-
+(*
let get_inner_sort st v =
try
let id = Ut.id_of_annterm v in
try Hashtbl.find st.sorts id
with Not_found -> `Type (CicUniv.fresh())
with Invalid_argument _ -> failwith "A2P.get_sort"
-
+*)
let get_type msg st bo =
try
let ty, _ = TC.type_of_aux' [] st.context (cic bo) Un.empty_ugraph in
| C.Name s -> s
let mk_intros st script =
-try
if st.intros = [] then script else
let count = List.length st.intros in
T.Intros (Some count, List.rev st.intros, "") :: script
-with Invalid_argument _ -> failwith "A2P.mk_intros"
-let rec mk_arg st = function
- | C.ARel (_, _, _, name) as what -> convert st ~name what, what
- | what -> [], what
+let mk_arg st = function
+ | C.ARel (_, _, _, name) as what -> convert st ~name what
+ | _ -> []
-and mk_fwd_rewrite st dtext name tl direction =
+let mk_fwd_rewrite st dtext name tl direction =
assert (List.length tl = 6);
let what, where, predicate = List.nth tl 5, List.nth tl 3, List.nth tl 2 in
let e = Cn.mk_pattern 1 predicate in
match where with
| C.ARel (_, _, _, premise) ->
- let script, what = mk_arg st what in
- T.Rewrite (direction, what, Some (premise, name), e, dtext) :: script
+ let script = mk_arg st what in
+ let where = Some (premise, name) in
+ T.Rewrite (direction, what, where, e, dtext) :: script
| _ -> assert false
-and mk_rewrite st dtext script t what qs tl direction =
+let mk_rewrite st dtext what qs tl direction =
assert (List.length tl = 5);
let predicate = List.nth tl 2 in
let e = Cn.mk_pattern 1 predicate in
- List.rev script @ convert st t @
[T.Rewrite (direction, what, None, e, dtext); T.Branch (qs, "")]
-and mk_fwd_proof st dtext name = function
- | C.AAppl (_, hd :: tl) as v ->
- if is_fwd_rewrite_right hd tl then mk_fwd_rewrite st dtext name tl true else
- if is_fwd_rewrite_left hd tl then mk_fwd_rewrite st dtext name tl false else
- let ty = get_type "TC1" st hd in
- begin match get_inner_types st v with
- | Some (ity, _) ->
- let qs = [[T.Id ""]; mk_proof (next st) v] in
- [T.Branch (qs, ""); T.Cut (name, ity, dtext)]
- | _ ->
- let (classes, rc) as h = Cl.classify st.context ty in
- let text = Printf.sprintf "%u %s" (List.length classes) (Cl.to_string h) in
- [T.LetIn (name, v, dtext ^ text)]
- end
- | C.AMutCase _ -> assert false
- | C.ACast _ -> assert false
- | v ->
- match get_inner_types st v with
+let rec proc_lambda st name v t =
+ let entry = Some (name, C.Decl (cic v)) in
+ let intro = get_intro name in
+ proc_proof (add st entry intro) t
+
+and proc_letin st what name v t =
+ let intro = get_intro name in
+ let proceed, dtext = test_depth st in
+ let script = if proceed then
+ let hyp, rqv = match get_inner_types st v with
| Some (ity, _) ->
- let qs = [[T.Id ""]; mk_proof (next st) v] in
- [T.Branch (qs, ""); T.Cut (name, ity, dtext)]
- | _ ->
- [T.LetIn (name, v, dtext)]
-
-and mk_proof st = function
- | C.ALambda (_, name, v, t) ->
- let entry = Some (name, C.Decl (cic v)) in
- let intro = get_intro name in
- mk_proof (add st entry intro) t
- | C.ALetIn (_, name, v, t) as what ->
- let proceed, dtext = test_depth st in
- let script = if proceed then
- let entry = Some (name, C.Def (cic v, None)) in
- let intro = get_intro name in
- let q = mk_proof (next (add st entry intro)) t in
- List.rev_append (mk_fwd_proof st dtext intro v) q
- else
- [T.Apply (what, dtext)]
- in
- mk_intros st script
- | C.ARel _ as what ->
- let _, dtext = test_depth st in
- let text = "assumption" in
- let script = [T.Apply (what, dtext ^ text)] in
- mk_intros st script
- | C.AMutConstruct _ as what ->
- let _, dtext = test_depth st in
- let script = [T.Apply (what, dtext)] in
- mk_intros st script
- | C.AAppl (_, hd :: tl) as t ->
- let proceed, dtext = test_depth st in
- let script = if proceed then
- let ty = get_type "TC2" st hd in
- let (classes, rc) as h = Cl.classify st.context ty in
- let decurry = List.length classes - List.length tl in
- if decurry <> 0 then begin
- let msg = Printf.sprintf "Decurry: %i\nTerm: %s\nContext: %s"
- decurry (Pp.ppterm (cic t)) (Pp.ppcontext st.context)
+ let rqv = match v with
+ | C.AAppl (_, hd :: tl) when is_fwd_rewrite_right hd tl ->
+ mk_fwd_rewrite st dtext intro tl true
+ | C.AAppl (_, hd :: tl) when is_fwd_rewrite_left hd tl ->
+ mk_fwd_rewrite st dtext intro tl false
+ | v ->
+ let qs = [[T.Id ""]; proc_proof (next st) v] in
+ [T.Branch (qs, ""); T.Cut (intro, ity, dtext)]
in
- HLog.warn msg; assert false
- end;
- let synth = I.S.singleton 0 in
- let text = Printf.sprintf "%u %s" (List.length classes) (Cl.to_string h) in
- match rc with
- | Some (i, j) ->
- let classes, tl, _, what = split2_last classes tl in
- let script, what = mk_arg st what in
- let synth = I.S.add 1 synth in
- let qs = mk_bkd_proofs (next st) synth classes tl in
- if is_rewrite_right hd then
- mk_rewrite st dtext script t what qs tl false
- else if is_rewrite_left hd then
- mk_rewrite st dtext script t what qs tl true
- else
- let l = succ (List.length tl) in
- let predicate = List.nth tl (l - i) in
- let e = Cn.mk_pattern 0 (T.mk_arel 1 "") (* j predicate *) in
- let using = Some hd in
- List.rev script @ convert st t @
- [T.Elim (what, using, e, dtext ^ text); T.Branch (qs, "")]
- | None ->
- let qs = mk_bkd_proofs (next st) synth classes tl in
- let script, hd = mk_arg st hd in
- List.rev script @ convert st t @
- [T.Apply (hd, dtext ^ text); T.Branch (qs, "")]
- else
- [T.Apply (t, dtext)]
+ C.Decl (get_type "TC1" st v), rqv
+ | None ->
+ C.Def (cic v, None), [T.LetIn (intro, v, dtext)]
in
- mk_intros st script
- | C.AMutCase _ -> assert false
- | C.ACast _ -> assert false
- | t ->
- let text = Printf.sprintf "%s: %s" "UNEXPANDED" (string_of_head t) in
- let script = [T.Note text] in
- mk_intros st script
-
-and mk_bkd_proofs st synth classes ts =
+ let entry = Some (name, hyp) in
+ let qt = proc_proof (next (add st entry intro)) t in
+ List.rev_append rqv qt
+ else
+ [T.Apply (what, dtext)]
+ in
+ mk_intros st script
+
+and proc_rel st what =
+ let _, dtext = test_depth st in
+ let text = "assumption" in
+ let script = [T.Apply (what, dtext ^ text)] in
+ mk_intros st script
+
+and proc_mutconstruct st what =
+ let _, dtext = test_depth st in
+ let script = [T.Apply (what, dtext)] in
+ mk_intros st script
+
+and proc_appl st what hd tl =
+ let proceed, dtext = test_depth st in
+ let script = if proceed then
+ let ty = get_type "TC2" st hd in
+ let (classes, rc) as h = Cl.classify st.context ty in
+ let argsno = List.length classes in
+ let diff = argsno - List.length tl in
+ if diff <> 0 then failwith (Printf.sprintf "NOT TOTAL: %i %s |--- %s" diff (Pp.ppcontext st.context) (Pp.ppterm (cic hd)));
+ let synth = I.S.singleton 0 in
+ let text = Printf.sprintf "%u %s" argsno (Cl.to_string h) in
+ let script = List.rev (mk_arg st hd) @ convert st what in
+ match rc with
+ | Some (i, j) ->
+ let classes, tl, _, where = split2_last classes tl in
+ let script = List.rev (mk_arg st where) @ script in
+ let synth = I.S.add 1 synth in
+ let qs = proc_bkd_proofs (next st) synth classes tl in
+ if is_rewrite_right hd then
+ script @ mk_rewrite st dtext where qs tl false
+ else if is_rewrite_left hd then
+ script @ mk_rewrite st dtext where qs tl true
+ else
+ let predicate = List.nth tl (argsno - i) in
+ let e = Cn.mk_pattern 0 (T.mk_arel 1 "") (* j predicate *) in
+ let using = Some hd in
+ script @
+ [T.Elim (where, using, e, dtext ^ text); T.Branch (qs, "")]
+ | None ->
+ let qs = proc_bkd_proofs (next st) synth classes tl in
+ script @ [T.Apply (hd, dtext ^ text); T.Branch (qs, "")]
+ else
+ [T.Apply (what, dtext)]
+ in
+ mk_intros st script
+
+and proc_other st what =
+ let text = Printf.sprintf "%s: %s" "UNEXPANDED" (string_of_head what) in
+ let script = [T.Note text] in
+ mk_intros st script
+
+
+and proc_proof st = function
+ | C.ALambda (_, name, w, t) -> proc_lambda st name w t
+ | C.ALetIn (_, name, v, t) as what -> proc_letin st what name v t
+ | C.ARel _ as what -> proc_rel st what
+ | C.AMutConstruct _ as what -> proc_mutconstruct st what
+ | C.AAppl (_, hd :: tl) as what -> proc_appl st what hd tl
+ | what -> proc_other st what
+
+and proc_bkd_proofs st synth classes ts =
try
let _, dtext = test_depth st in
let aux (inv, _) v =
if I.overlaps synth inv then None else
- if I.S.is_empty inv then Some (mk_proof st v) else
+ if I.S.is_empty inv then Some (proc_proof st v) else
Some [T.Apply (v, dtext ^ "dependent")]
in
T.list_map2_filter aux classes ts
-with Invalid_argument _ -> failwith "A2P.mk_bkd_proofs"
+with Invalid_argument _ -> failwith "A2P.proc_bkd_proofs"
(* object costruction *******************************************************)
List.mem (`Flavour `Theorem) pars || List.mem (`Flavour `Fact) pars ||
List.mem (`Flavour `Remark) pars || List.mem (`Flavour `Lemma) pars
-let mk_obj st = function
+let proc_obj st = function
| C.AConstant (_, _, s, Some v, t, [], pars) when is_theorem pars ->
- let ast = mk_proof st v in
+ let ast = proc_proof st v in
let count = T.count_steps 0 ast in
let text = Printf.sprintf "tactics: %u" count in
T.Theorem (s, t, text) :: ast @ [T.Qed ""]
context = [];
intros = []
} in
- HLog.debug "Level 2 transformation";
- let steps = mk_obj st aobj in
- HLog.debug "grafite rendering";
+ HLog.debug "Procedural: level 2 transformation";
+ let steps = proc_obj st aobj in
+ HLog.debug "Procedural: grafite rendering";
List.rev (T.render_steps [] steps)
projects / helm.git / blobdiff