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")
37 let mk_elims (uri,_,_,_,obj) =
39 NCic.Inductive (true,leftno,[it],_) ->
40 let _,ind_name,ty,cl = it in
41 let srec_name = ind_name ^ "_rect" in
42 let rec_name = mk_id srec_name in
43 let name_of_k id = mk_id ("H_" ^ id) in
44 let p_name = mk_id "Q_" in
45 let params,ty = NCicReduction.split_prods ~subst:[] [] leftno ty in
46 let params = List.rev_map (function name,_ -> mk_id name) params in
47 let args,sort = NCicReduction.split_prods ~subst:[] [] (-1) ty in
48 let args = List.rev_map (function name,_ -> mk_id name) args in
49 let rec_arg = mk_id (fresh_name ()) in
52 (fun name res -> CicNotationPt.Binder (`Forall,(name,None),res)) args
55 (rec_arg,Some (CicNotationPt.Appl (mk_id ind_name :: params @ args))),
56 CicNotationPt.Sort (`Type (CicUniv.fresh ())))) in
57 let args = args @ [rec_arg] in
58 let k_names = List.map (function _,name,_ -> name_of_k name) cl in
60 List.map (function name -> name, None) params @
62 List.map (function name -> name, None) k_names @
63 List.map (function name -> name, None) args in
64 let recno = List.length final_params in
65 let cty = CicNotationPt.Appl (p_name :: args) in
69 (function (_,name,ty) ->
70 let _,ty = NCicReduction.split_prods ~subst:[] [] leftno ty in
71 let cargs,ty= my_split_prods ~subst:[] [] (-1) ty in
72 let cargs_and_recursive_args =
75 _,NCic.Def _ -> assert false
76 | name,NCic.Decl ty ->
77 let context,ty = my_split_prods ~subst:[] [] (-1) ty in
80 | NCic.Appl (NCic.Const nref::_)
82 let NReference.Ref (uri',_) = nref in
85 let abs = List.rev_map (fun id,_ -> mk_id id) context in
86 let name = mk_id name in
90 CicNotationPt.Binder (`Lambda,(id,None),res))
97 List.map (fun _ -> CicNotationPt.Implicit)
99 [CicNotationPt.Appl (name::abs)])))
100 | _ -> mk_id name,None
102 let cargs,recursive_args = List.split cargs_and_recursive_args in
103 let recursive_args = HExtlib.filter_map (fun x -> x) recursive_args in
104 CicNotationPt.Pattern (name,None,List.map (fun x -> x,None) cargs),
105 CicNotationPt.Appl (name_of_k name :: cargs @ recursive_args)
108 let bo = CicNotationPt.Case (rec_arg,None,None,branches) in
109 let where = List.length final_params - 1 in
111 CicNotationPt.LetRec (`Inductive,
112 [final_params, (rec_name,ty), bo, where], rec_name)
114 prerr_endline (CicNotationPp.pp_term res);
115 prerr_endline "#####";
117 (BoxPp.render_to_string
118 ~map_unicode_to_tex:false
119 (function x::_ -> x | _ -> assert false)
120 80 (CicNotationPres.render (fun _ -> None)
121 (TermContentPres.pp_ast res)));
122 prerr_endline "#####";
123 let cobj = ("xxx", [], None, `Joint {
124 Content.joint_id = "yyy";
125 joint_kind = `Recursive [recno];
128 Content.def_name = Some srec_name;
134 (fun x t -> CicNotationPt.Binder(`Forall,x,t))
140 let ids_to_nrefs = Hashtbl.create 1 in
141 let boxml = Content2pres.ncontent2pres ~ids_to_nrefs cobj in
143 (BoxPp.render_to_string ~map_unicode_to_tex:false
144 (function x::_ -> x | _ -> assert false) 80
145 (CicNotationPres.mpres_of_box boxml)));