1 let convert_term = Obj.magic;;
8 type ctx = Ce of NCic.hypothesis | Fix of int * int
10 let splat mk_pi ctx t =
14 | Ce (name, NCic.Def (bo,ty)) -> NCic.LetIn (name, ty, bo, t)
15 | Ce (name, NCic.Decl ty) when mk_pi -> NCic.Prod (name, ty, t)
16 | Ce (name, NCic.Decl ty) -> NCic.Lambda (name, ty, t)
21 let splat_args ctx t =
23 List.length (List.filter (function Ce _ -> true | _ -> false) ctx)
27 let rec aux = function
29 | n -> aux (n-1) @ [NCic.Rel n]
31 NCic.Appl (t:: aux n_args)
34 let convert_term uri t =
35 let rec aux octx (ctx : ctx list) n_fix uri = function
36 | Cic.CoFix (k, fl) ->
39 List.map (fun (_,_,_) ->
40 incr idx; Fix (~-1,!idx)) fl @ ctx
43 UriManager.uri_of_string
44 (UriManager.string_of_uri uri^string_of_int (List.length ctx)^".con")
46 let n_fl = List.length fl in
49 (fun (types,len) (n,ty,_) ->
50 (Some (Cic.Name n,(Cic.Decl (CicSubstitution.lift len ty)))::types,
55 (fun (name,ty,bo) (l,fixpoints) ->
56 let ty, fixpoints_ty = aux octx ctx n_fix uri ty in
57 let bo, fixpoints_bo = aux boctx bctx (n_fix + n_fl) buri bo in
58 (([],name,~-1,splat true ctx ty, splat false ctx bo)::l),
59 fixpoints_ty @ fixpoints_bo @ fixpoints)
63 NUri.nuri_of_ouri uri,0,[],[],
64 NCic.Fixpoint (false, fl, (`Generated, `Definition))
66 NCic.Const (NReference.reference_of_ouri uri (NReference.CoFix (k))),
72 List.map (fun (_,recno,_,_) ->
73 incr idx; if !idx = k then rno := recno;Fix (recno,!idx)) fl @ ctx
76 UriManager.uri_of_string
77 (UriManager.string_of_uri uri^string_of_int (List.length ctx)^".con")
79 let n_fl = List.length fl in
82 (fun (types,len) (n,_,ty,_) ->
83 (Some (Cic.Name n,(Cic.Decl (CicSubstitution.lift len ty)))::types,
88 (fun (name,rno,ty,bo) (l,fixpoints) ->
89 let ty, fixpoints_ty = aux octx ctx n_fix uri ty in
90 let bo, fixpoints_bo = aux boctx bctx (n_fix + n_fl) buri bo in
91 (([],name,rno,splat true ctx ty, splat false ctx bo)::l),
92 fixpoints_ty @ fixpoints_bo @ fixpoints)
96 NUri.nuri_of_ouri uri,0,[],[],
97 NCic.Fixpoint (true, fl, (`Generated, `Definition))
99 NCic.Const (NReference.reference_of_ouri uri (NReference.Fix (k,!rno))),
102 (match List.nth ctx n with
103 | Ce _ -> NCic.Rel (n-n_fix), []
104 | Fix (recno, fixno) ->
107 (NReference.reference_of_ouri uri (NReference.Fix (fixno,recno)))),
109 | Cic.Lambda (name, (s as old_s), t) ->
110 let s, fixpoints_s = aux octx ctx n_fix uri s in
111 let ctx = Ce (cn_to_s name, NCic.Decl s) :: ctx in
112 let octx = Some (name, Cic.Decl old_s) :: octx in
113 let t, fixpoints_t = aux octx ctx n_fix uri t in
114 NCic.Lambda (cn_to_s name, s, t), fixpoints_s @ fixpoints_t
115 | Cic.Prod (name, (s as old_s), t) ->
116 let s, fixpoints_s = aux octx ctx n_fix uri s in
117 let ctx = Ce (cn_to_s name, NCic.Decl s) :: ctx in
118 let octx = Some (name, Cic.Decl old_s) :: octx in
119 let t, fixpoints_t = aux octx ctx n_fix uri t in
120 NCic.Prod (cn_to_s name, s, t), fixpoints_s @ fixpoints_t
121 | Cic.LetIn (name, (s as old_s), t) ->
122 let s, fixpoints_s = aux octx ctx n_fix uri s in
124 CicTypeChecker.type_of_aux' [] octx old_s CicUniv.oblivion_ugraph
126 let ty, fixpoints_ty = aux octx ctx n_fix uri old_ty in
127 let ctx = Ce (cn_to_s name, NCic.Def (s, ty)) :: ctx in
128 let octx = Some (name, Cic.Def (old_s, Some old_ty)) :: octx in
129 let t, fixpoints_t = aux octx ctx n_fix uri t in
130 NCic.LetIn (cn_to_s name, ty, s, t),
131 fixpoints_s @ fixpoints_t @ fixpoints_ty
133 let t, fixpoints_t = aux octx ctx n_fix uri t in
134 let ty, fixpoints_ty = aux octx ctx n_fix uri ty in
135 NCic.LetIn ("cast", ty, t, NCic.Rel 1), fixpoints_t @ fixpoints_ty
136 | Cic.Sort Cic.Prop -> NCic.Sort NCic.Prop,[]
137 | Cic.Sort Cic.Set -> NCic.Sort NCic.Set,[]
138 | Cic.Sort Cic.CProp -> NCic.Sort NCic.CProp,[]
139 | Cic.Sort (Cic.Type _) -> NCic.Sort (NCic.Type 0),[]
140 (* calculate depth in the univ_graph*)
145 let t, fixpoints = aux octx ctx n_fix uri t in
146 (t::l,fixpoints@acc))
149 NCic.Appl l, fixpoints
150 | Cic.Const (curi, _) ->
151 NCic.Const (NReference.reference_of_ouri curi NReference.Def),[]
152 | Cic.MutInd (curi, tyno, _) ->
153 NCic.Const (NReference.reference_of_ouri curi (NReference.Ind tyno)),[]
154 | Cic.MutConstruct (curi, tyno, consno, _) ->
155 NCic.Const (NReference.reference_of_ouri curi
156 (NReference.Con (tyno,consno))),[]
157 | Cic.MutCase (curi, tyno, oty, t, branches) ->
158 let r = NReference.reference_of_ouri curi (NReference.Ind tyno) in
159 let oty, fixpoints_oty = aux octx ctx n_fix uri oty in
160 let t, fixpoints_t = aux octx ctx n_fix uri t in
161 let branches, fixpoints =
164 let t, fixpoints = aux octx ctx n_fix uri t in
165 (t::l,fixpoints@acc))
168 NCic.Match (r,oty,t,branches), fixpoints_oty @ fixpoints_t @ fixpoints
169 | Cic.Implicit _ | Cic.Meta _ | Cic.Var _ -> assert false
174 let convert_obj_aux uri = function
175 | Cic.Constant (name, None, ty, _, _) ->
176 let nty, fixpoints = convert_term uri ty in
177 assert(fixpoints = []);
178 NCic.Constant ([], name, None, nty, (`Provided,`Theorem,`Regular)),
180 | Cic.Constant (name, Some bo, ty, _, _) ->
181 let nbo, fixpoints_bo = convert_term uri bo in
182 let nty, fixpoints_ty = convert_term uri ty in
183 assert(fixpoints_ty = []);
184 NCic.Constant ([], name, Some nbo, nty, (`Provided,`Theorem,`Regular)),
185 fixpoints_bo @ fixpoints_ty
186 | Cic.InductiveDefinition (_,_,_,_) -> assert false (*
187 let ind = let _,x,_,_ = List.hd itl in x in
190 (fun name, _, ty, cl ->
191 [], name, convert_term ty,
192 List.map (fun name, ty -> [], name, convert_term ty) cl)
195 NCic.Inductive (ind, leftno, itl, (`Provided, `Regular)) *)
197 | Cic.CurrentProof _ -> assert false
200 let convert_obj uri obj =
201 let o, fixpoints = convert_obj_aux uri obj in
202 let obj = NUri.nuri_of_ouri uri,0, [], [], o in