2 ||M|| This file is part of HELM, an Hypertextual, Electronic
3 ||A|| Library of Mathematics, developed at the Computer Science
4 ||T|| Department, University of Bologna, Italy.
6 ||T|| HELM is free software; you can redistribute it and/or
7 ||A|| modify it under the terms of the GNU General Public License
8 \ / version 2 or (at your option) any later version.
9 \ / This software is distributed as is, NO WARRANTY.
10 V_______________________________________________________________ *)
12 (* $Id: nCic.ml 9058 2008-10-13 17:42:30Z tassi $ *)
18 "x_" ^ string_of_int !i
22 let id = if id = "_" then fresh_name () else id in
23 CicNotationPt.Ident (id,None)
26 (*CSC: cut&paste from nCicReduction.split_prods, but does not check that
27 the return type is a sort *)
28 let rec my_split_prods ~subst context n te =
29 match (n, NCicReduction.whd ~subst context te) with
30 | (0, _) -> context,te
31 | (n, NCic.Prod (name,so,ta)) ->
32 my_split_prods ~subst ((name,(NCic.Decl so))::context) (n - 1) ta
33 | (n, _) when n <= 0 -> context,te
34 | (_, _) -> raise (Failure "my_split_prods")
41 | l -> CicNotationPt.Appl l
44 let mk_elims (uri,_,_,_,obj) =
46 NCic.Inductive (true,leftno,[it],_) ->
47 let _,ind_name,ty,cl = it in
48 let srec_name = ind_name ^ "_rect" in
49 let rec_name = mk_id srec_name in
50 let name_of_k id = mk_id ("H_" ^ id) in
51 let p_name = mk_id "Q_" in
52 let params,ty = NCicReduction.split_prods ~subst:[] [] leftno ty in
53 let params = List.rev_map (function name,_ -> mk_id name) params in
54 let args,sort = NCicReduction.split_prods ~subst:[] [] (-1) ty in
55 let args = List.rev_map (function name,_ -> mk_id name) args in
56 let rec_arg = mk_id (fresh_name ()) in
59 (fun name res -> CicNotationPt.Binder (`Forall,(name,None),res)) args
62 (rec_arg,Some (mk_appl (mk_id ind_name :: params @ args))),
63 CicNotationPt.Sort (`Type (CicUniv.fresh ())))) in
64 let args = args @ [rec_arg] in
65 let k_names = List.map (function _,name,_ -> name_of_k name) cl in
67 List.map (function name -> name, None) params @
69 List.map (function name -> name, None) k_names @
70 List.map (function name -> name, None) args in
71 let recno = List.length final_params in
72 let cty = mk_appl (p_name :: args) in
76 (function (_,name,ty) ->
77 let _,ty = NCicReduction.split_prods ~subst:[] [] leftno ty in
78 let cargs,ty= my_split_prods ~subst:[] [] (-1) ty in
79 let cargs_and_recursive_args =
82 _,NCic.Def _ -> assert false
83 | name,NCic.Decl ty ->
84 let context,ty = my_split_prods ~subst:[] [] (-1) ty in
87 | NCic.Appl (NCic.Const nref::_)
89 let NReference.Ref (uri',_) = nref in
92 let abs = List.rev_map (fun id,_ -> mk_id id) context in
93 let name = mk_id name in
97 CicNotationPt.Binder (`Lambda,(id,None),res))
104 List.map (fun _ -> CicNotationPt.Implicit)
106 [mk_appl (name::abs)])))
107 | _ -> mk_id name,None
109 let cargs,recursive_args = List.split cargs_and_recursive_args in
110 let recursive_args = HExtlib.filter_map (fun x -> x) recursive_args in
111 CicNotationPt.Pattern (name,None,List.map (fun x -> x,None) cargs),
112 CicNotationPt.Appl (name_of_k name :: cargs @ recursive_args)
115 let bo = CicNotationPt.Case (rec_arg,None,None,branches) in
116 let where = List.length final_params - 1 in
118 CicNotationPt.LetRec (`Inductive,
119 [final_params, (rec_name,ty), bo, where], rec_name)
121 prerr_endline (CicNotationPp.pp_term res);
122 prerr_endline "#####";
124 (BoxPp.render_to_string
125 ~map_unicode_to_tex:false
126 (function x::_ -> x | _ -> assert false)
127 80 (CicNotationPres.render (fun _ -> None)
128 (TermContentPres.pp_ast res)));
129 prerr_endline "#####";
130 let cobj = ("xxx", [], None, `Joint {
131 Content.joint_id = "yyy";
132 joint_kind = `Recursive [recno];
135 Content.def_name = Some srec_name;
141 (fun x t -> CicNotationPt.Binder(`Forall,x,t))
147 let ids_to_nrefs = Hashtbl.create 1 in
148 let boxml = Content2pres.ncontent2pres ~ids_to_nrefs cobj in
150 (BoxPp.render_to_string ~map_unicode_to_tex:false
151 (function x::_ -> x | _ -> assert false) 80
152 (CicNotationPres.mpres_of_box boxml)));
153 [CicNotationPt.Theorem (`Definition,srec_name,CicNotationPt.Implicit,Some res)]