1 module Ref = NReference
4 | Ce of (NCic.hypothesis * NCic.obj list) Lazy.t
5 | Fix of (Ref.reference * string * NCic.term) Lazy.t
9 Ce l -> `Ce (Lazy.force l)
10 | Fix l -> `Fix (Lazy.force l)
13 (***** A function to restrict the context of a term getting rid of unsed
16 let restrict octx ctx ot =
17 let odummy = Cic.Implicit None in
18 let dummy = NCic.Meta (~-1,(0,NCic.Irl 0)) in
19 let rec aux m acc ot t =
22 | ohe::otl as octx,he::tl ->
23 if CicTypeChecker.does_not_occur octx 0 1 ot then
24 aux (m+1) acc (CicSubstitution.subst odummy ot)
25 (NCicSubstitution.subst dummy t) (otl,tl)
27 (match ohe,strictify he with
28 None,_ -> assert false
29 | Some (name,Cic.Decl oty),`Ce ((name', NCic.Decl ty),objs) ->
30 aux (m+1) ((m+1,objs,None)::acc) (Cic.Lambda (name,oty,ot))
31 (NCic.Lambda (name',ty,t)) (otl,tl)
32 | Some (name,Cic.Decl oty),`Fix (ref,name',ty) ->
33 aux (m+1) ((m+1,[],Some ref)::acc) (Cic.Lambda (name,oty,ot))
34 (NCic.Lambda (name',ty,t)) (otl,tl)
35 | Some (name,Cic.Def (obo,oty)),`Ce ((name', NCic.Def (bo,ty)),objs) ->
36 aux (m+1) ((m+1,objs,None)::acc) (Cic.LetIn (name,obo,oty,ot))
37 (NCic.LetIn (name',bo,ty,t)) (otl,tl)
38 | _,_ -> assert false)
39 | _,_ -> assert false in
40 let rec split_lambdas_and_letins octx ctx infos (ote,te) =
41 match infos, ote, te with
42 ([], _, _) -> octx,ctx,ote
43 | ((_,objs,None)::tl, Cic.Lambda(name,oso,ota), NCic.Lambda(name',so,ta)) ->
44 split_lambdas_and_letins ((Some(name,(Cic.Decl oso)))::octx)
45 (Ce (lazy ((name',NCic.Decl so),objs))::ctx) tl (ota,ta)
46 | ((_,objs,Some r)::tl,Cic.Lambda(name,oso,ota),NCic.Lambda(name',so,ta)) ->
47 split_lambdas_and_letins ((Some(name,(Cic.Decl oso)))::octx)
48 (Fix (lazy (r,name',so))::ctx) tl (ota,ta)
49 | ((_,objs,None)::tl,Cic.LetIn(name,obo,oty,ota),NCic.LetIn(nam',bo,ty,ta))->
50 split_lambdas_and_letins ((Some (name,(Cic.Def (obo,oty))))::octx)
51 (Ce (lazy ((nam',NCic.Def (bo,ty)),objs))::ctx) tl (ota,ta)
52 | (_, _, _) -> assert false
54 let long_t,infos = aux 0 [] ot dummy (octx,ctx) in
55 let clean_octx,clean_ctx,clean_ot= split_lambdas_and_letins [] [] infos long_t
57 (*prerr_endline ("RESTRICT PRIMA: " ^ CicPp.pp ot (List.map (function None -> None | Some (name,_) -> Some name) octx));
58 prerr_endline ("RESTRICT DOPO: " ^ CicPp.pp clean_ot (List.map (function None -> None | Some (name,_) -> Some name) clean_octx));
60 clean_octx,clean_ctx,clean_ot, List.map (fun (rel,_,_) -> rel) infos
64 (**** The translation itself ****)
66 let cn_to_s = function
67 | Cic.Anonymous -> "_"
71 let splat mk_pi ctx t =
74 match strictify c with
75 | `Ce ((name, NCic.Def (bo,ty)),l') -> NCic.LetIn (name, ty, bo, t),l@l'
76 | `Ce ((name, NCic.Decl ty),l') when mk_pi -> NCic.Prod (name, ty, t),l@l'
77 | `Ce ((name, NCic.Decl ty),l') -> NCic.Lambda (name, ty, t),l@l'
78 | `Fix (_,name,ty) when mk_pi -> NCic.Prod (name, ty, t),l
79 | `Fix (_,name,ty) -> NCic.Lambda (name,ty,t),l)
83 let context_tassonomy ctx =
84 let rec split inner acc acc1 = function
85 | Ce _ :: tl when inner -> split inner (acc+1) (acc1+1) tl
86 | Fix _ ::tl -> split false acc (acc1+1) tl
92 (match strictify ce with
93 `Ce ((_, NCic.Decl _),_) -> true
97 acc, List.length l, lazy (List.length (only_decl ())), acc1
102 let splat_args_for_rel ctx t ?rels n_fix =
107 let rec mk_irl = function 0 -> [] | n -> n::mk_irl (n - 1) in
108 mk_irl (List.length ctx)
110 let bound, free, _, primo_ce_dopo_fix = context_tassonomy ctx in
113 let rec aux = function
114 | n,_ when n = bound + n_fix -> []
116 (match strictify (List.nth ctx (n-1)) with
117 | `Fix (refe, _, _) when n < primo_ce_dopo_fix ->
118 NCic.Const refe :: aux (n-1,tl)
119 | `Fix _ | `Ce ((_, NCic.Decl _),_) ->
120 NCic.Rel (he - n_fix)::aux(n-1,tl)
121 | `Ce ((_, NCic.Def _),_) -> aux (n-1,tl))
122 | _,_ -> assert false
124 let args = aux (List.length ctx,rels) in
127 | _::_ -> NCic.Appl (t::args)
130 let splat_args ctx t n_fix rels =
131 let bound, free, _, primo_ce_dopo_fix = context_tassonomy ctx in
134 let rec aux = function
137 (match strictify (List.nth ctx (n-1)) with
138 | `Ce ((_, NCic.Decl _),_) when n <= bound ->
139 NCic.Rel he:: aux (n-1,tl)
140 | `Fix (refe, _, _) when n < primo_ce_dopo_fix ->
141 splat_args_for_rel ctx (NCic.Const refe) ~rels n_fix :: aux (n-1,tl)
142 | `Fix _ | `Ce((_, NCic.Decl _),_)-> NCic.Rel (he - n_fix)::aux(n-1,tl)
143 | `Ce ((_, NCic.Def _),_) -> aux (n - 1,tl)
145 | _,_ -> assert false
147 let args = aux (List.length ctx,rels) in
150 | _::_ -> NCic.Appl (t::args)
153 exception Nothing_to_do;;
155 let fix_outty curi tyno t context outty =
157 match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph curi) with
158 Cic.InductiveDefinition (tyl,_,leftno,_) ->
159 let _,_,arity,_ = List.nth tyl tyno in
160 let rec count_prods leftno context arity =
161 match leftno, CicReduction.whd context arity with
163 | 0, Cic.Prod (name,so,ty) ->
164 1 + count_prods 0 (Some (name, Cic.Decl so)::context) ty
165 | n, Cic.Prod (name,so,ty) ->
166 count_prods (leftno - 1) (Some (name, Cic.Decl so)::context) ty
167 | _,_ -> assert false
169 (*prerr_endline (UriManager.string_of_uri curi);
170 prerr_endline ("LEFTNO: " ^ string_of_int leftno ^ " " ^ CicPp.ppterm arity);*)
171 leftno, count_prods leftno [] arity
172 | _ -> assert false in
174 let tty,_= CicTypeChecker.type_of_aux' [] context t CicUniv.oblivion_ugraph in
175 match CicReduction.whd context tty with
176 Cic.MutInd (_,_,ens) -> ens,[]
177 | Cic.Appl (Cic.MutInd (_,_,ens)::args) ->
178 ens,fst (HExtlib.split_nth leftno args)
181 let rec aux n irl context outsort =
182 match n, CicReduction.whd context outsort with
183 0, Cic.Prod _ -> raise Nothing_to_do
185 let irl = List.rev irl in
186 let ty = CicSubstitution.lift rightno (Cic.MutInd (curi,tyno,ens)) in
188 if args = [] && irl = [] then ty
190 Cic.Appl (ty::(List.map (CicSubstitution.lift rightno) args)@irl) in
191 let he = CicSubstitution.lift (rightno + 1) outty in
194 else Cic.Appl (he::List.map (CicSubstitution.lift 1) irl)
196 Cic.Lambda (Cic.Anonymous, ty, t)
197 | n, Cic.Prod (name,so,ty) ->
199 aux (n - 1) (Cic.Rel n::irl) (Some (name, Cic.Decl so)::context) ty
201 Cic.Lambda (name,so,ty')
202 | _,_ -> assert false
204 (*prerr_endline ("RIGHTNO = " ^ string_of_int rightno ^ " OUTTY = " ^ CicPp.ppterm outty);*)
206 fst (CicTypeChecker.type_of_aux' [] context outty CicUniv.oblivion_ugraph)
208 try aux rightno [] context outsort
209 with Nothing_to_do -> outty
210 (*prerr_endline (CicPp.ppterm outty ^ " <==> " ^ CicPp.ppterm outty');*)
214 let module C = Cic in
215 let rec aux context =
218 | C.Var (uri,exp_named_subst) ->
219 let exp_named_subst' =
220 List.map (function i,t -> i, (aux context t)) exp_named_subst in
221 C.Var (uri,exp_named_subst')
223 | C.Meta _ -> assert false
225 | C.Cast (v,t) -> C.Cast (aux context v, aux context t)
227 C.Prod (n, aux context s, aux ((Some (n, C.Decl s))::context) t)
228 | C.Lambda (n,s,t) ->
229 C.Lambda (n, aux context s, aux ((Some (n, C.Decl s))::context) t)
230 | C.LetIn (n,s,ty,t) ->
232 (n, aux context s, aux context ty,
233 aux ((Some (n, C.Def(s,ty)))::context) t)
234 | C.Appl l -> C.Appl (List.map (aux context) l)
235 | C.Const (uri,exp_named_subst) ->
236 let exp_named_subst' =
237 List.map (function i,t -> i, (aux context t)) exp_named_subst
239 C.Const (uri,exp_named_subst')
240 | C.MutInd (uri,tyno,exp_named_subst) ->
241 let exp_named_subst' =
242 List.map (function i,t -> i, (aux context t)) exp_named_subst
244 C.MutInd (uri, tyno, exp_named_subst')
245 | C.MutConstruct (uri,tyno,consno,exp_named_subst) ->
246 let exp_named_subst' =
247 List.map (function i,t -> i, (aux context t)) exp_named_subst
249 C.MutConstruct (uri, tyno, consno, exp_named_subst')
250 | C.MutCase (uri, tyno, outty, term, patterns) ->
251 let outty = fix_outty uri tyno term context outty in
252 C.MutCase (uri, tyno, aux context outty,
253 aux context term, List.map (aux context) patterns)
254 | C.Fix (funno, funs) ->
257 (fun (types,len) (n,_,ty,_) ->
258 ((Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))))::types,
264 (fun (name, indidx, ty, bo) ->
265 (name, indidx, aux context ty, aux (tys@context) bo)
268 | C.CoFix (funno, funs) ->
271 (fun (types,len) (n,ty,_) ->
272 ((Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))))::types,
278 (fun (name, ty, bo) ->
279 (name, aux context ty, aux (tys@context) bo)
286 let get_fresh,reset_seed =
290 string_of_int !seed),
291 (function () -> seed := 0)
295 let alpha t1 t2 ref ref' =
296 let rec aux t1 t2 = match t1,t2 with
297 | NCic.Rel n, NCic.Rel m when n=m -> ()
298 | NCic.Appl l1, NCic.Appl l2 -> List.iter2 aux l1 l2
299 | NCic.Lambda (_,s1,t1), NCic.Lambda (_,s2,t2)
300 | NCic.Prod (_,s1,t1), NCic.Prod (_,s2,t2) -> aux s1 s2; aux t1 t2
301 | NCic.LetIn (_,s1,ty1,t1), NCic.LetIn (_,s2,ty2,t2) ->
302 aux s1 s2; aux ty1 ty2; aux t1 t2
303 | NCic.Const (NReference.Ref (_,uu1,xp1)),
304 NCic.Const (NReference.Ref (_,uu2,xp2)) when
305 let NReference.Ref (_,u1,_) = ref in
306 let NReference.Ref (_,u2,_) = ref' in
307 NUri.eq uu1 u1 && NUri.eq uu2 u2 && xp1 = xp2
309 | NCic.Const r1, NCic.Const r2 when NReference.eq r1 r2 -> ()
310 | NCic.Meta _,NCic.Meta _ -> ()
311 | NCic.Implicit _,NCic.Implicit _ -> ()
312 | NCic.Sort x,NCic.Sort y when x=y -> ()
313 | NCic.Match (_,t1,t11,tl1), NCic.Match (_,t2,t22,tl2) ->
314 aux t1 t2;aux t11 t22;List.iter2 aux tl1 tl2
315 | _-> raise NotSimilar
317 try aux t1 t2; true with NotSimilar -> false
320 exception Found of NReference.reference;;
321 let cache = Hashtbl.create 313;;
322 let same_obj ref ref' =
324 | (_,_,_,_,NCic.Fixpoint (b1,l1,_)), (_,_,_,_,NCic.Fixpoint (b2,l2,_))
325 when List.for_all2 (fun (_,_,_,ty1,bo1) (_,_,_,ty2,bo2) ->
326 alpha ty1 ty2 ref ref' && alpha bo1 bo2 ref ref') l1 l2 && b1=b2->
330 let find_in_cache name obj ref =
333 (function (ref',obj') ->
336 NReference.Ref (_,_,NReference.Fix (fixno,recno)) -> recno,fixno
337 | NReference.Ref (_,_,NReference.CoFix (fixno)) -> ~-1,fixno
338 | _ -> assert false in
341 NReference.Ref (_,_,NReference.Fix (fixno',recno)) -> recno,fixno'
342 | NReference.Ref (_,_,NReference.CoFix (fixno')) -> ~-1,fixno'
343 | _ -> assert false in
344 if recno = recno' && fixno = fixno' && same_obj ref ref' (obj,obj') then (
346 prerr_endline ("!!!!!!!!!!! CACHE HIT !!!!!!!!!!\n" ^
347 NReference.string_of_reference ref ^ "\n" ^
348 NReference.string_of_reference ref' ^ "\n");
352 prerr_endline ("CACHE SAME NAME: " ^ NReference.string_of_reference ref ^ " <==> " ^ NReference.string_of_reference ref');
354 ) (Hashtbl.find_all cache name);
355 (* prerr_endline "<<< CACHE MISS >>>"; *)
358 | (_,_,_,_,NCic.Fixpoint (true,fl,_)) ,
359 NReference.Ref (x,y,NReference.Fix _) ->
360 ignore(List.fold_left (fun i (_,name,rno,_,_) ->
361 let ref = NReference.mk_fix i rno ref in
362 Hashtbl.add cache name (ref,obj);
365 | (_,_,_,_,NCic.Fixpoint (false,fl,_)) ,
366 NReference.Ref (x,y,NReference.CoFix _) ->
367 ignore(List.fold_left (fun i (_,name,rno,_,_) ->
368 let ref = NReference.mk_cofix i ref in
369 Hashtbl.add cache name (ref,obj);
375 with Found ref -> Some ref
378 (* we are lambda-lifting also variables that do not occur *)
379 (* ctx does not distinguish successive blocks of cofix, since there may be no
380 * lambda separating them *)
381 let convert_term uri t =
382 (* k=true if we are converting a term to be pushed in a ctx or if we are
383 converting the type of a fix;
384 k=false if we are converting a term to be put in the body of a fix;
385 in the latter case, we must permute Rels since the Fix abstraction will
386 preceed its lefts parameters; in the former case, there is nothing to
388 let rec aux k octx (ctx : ctx list) n_fix uri = function
389 | Cic.CoFix _ as cofix ->
390 let octx,ctx,fix,rels = restrict octx ctx cofix in
392 match fix with Cic.CoFix (cofixno,fl)->cofixno,fl | _-> assert false in
394 UriManager.uri_of_string
395 (UriManager.buri_of_uri uri^"/"^
396 UriManager.name_of_uri uri ^ "___" ^ get_fresh () ^ ".con")
398 let bctx, fixpoints_tys, tys, _ =
400 (fun (name,ty,_) (bctx, fixpoints, tys, idx) ->
401 let ty, fixpoints_ty = aux true octx ctx n_fix uri ty in
402 let r = Ref.reference_of_ouri buri(Ref.CoFix idx) in
403 bctx @ [Fix (lazy (r,name,ty))],
404 fixpoints_ty @ fixpoints,ty::tys,idx-1)
405 fl ([], [], [], List.length fl-1)
407 let bctx = bctx @ ctx in
408 let n_fl = List.length fl in
411 (fun (types,len) (n,ty,_) ->
412 (Some (Cic.Name n,(Cic.Decl (CicSubstitution.lift len ty)))::types,
417 (fun (name,_,bo) ty (l,fixpoints) ->
418 let bo, fixpoints_bo = aux false boctx bctx n_fl buri bo in
419 let splty,fixpoints_splty = splat true ctx ty in
420 let splbo,fixpoints_splbo = splat false ctx bo in
421 (([],name,~-1,splty,splbo)::l),
422 fixpoints_bo @ fixpoints_splty @ fixpoints_splbo @ fixpoints)
423 fl tys ([],fixpoints_tys)
426 NUri.nuri_of_ouri buri,0,[],[],
427 NCic.Fixpoint (false, fl, (`Generated, `Definition))
429 let r = Ref.reference_of_ouri buri (Ref.CoFix cofixno) in
431 let _,name,_,_,_ = List.nth fl cofixno in
432 match find_in_cache name obj r with
436 splat_args ctx (NCic.Const r) n_fix rels, fixpoints @ obj
437 | Cic.Fix _ as fix ->
438 let octx,ctx,fix,rels = restrict octx ctx fix in
440 match fix with Cic.Fix (fixno,fl) -> fixno,fl | _ -> assert false in
442 UriManager.uri_of_string
443 (UriManager.buri_of_uri uri^"/"^
444 UriManager.name_of_uri uri ^ "___" ^ get_fresh () ^ ".con")
446 let bad_bctx, fixpoints_tys, tys, _ =
448 (fun (name,recno,ty,_) (bctx, fixpoints, tys, idx) ->
449 let ty, fixpoints_ty = aux true octx ctx n_fix uri ty in
450 let r = (* recno is dummy here, must be lifted by the ctx len *)
451 Ref.reference_of_ouri buri (Ref.Fix (idx,recno))
453 bctx @ [Fix (lazy (r,name,ty))],
454 fixpoints_ty@fixpoints,ty::tys,idx-1)
455 fl ([], [], [], List.length fl-1)
457 let _, _, free_decls, _ = context_tassonomy (bad_bctx @ ctx) in
458 let free_decls = Lazy.force free_decls in
460 List.map (function ce -> match strictify ce with
461 | `Fix (Ref.Ref (_,_,Ref.Fix (idx, recno)),name, ty) ->
462 Fix (lazy (Ref.reference_of_ouri buri
463 (Ref.Fix (idx,recno+free_decls)),name,ty))
464 | _ -> assert false) bad_bctx @ ctx
466 let n_fl = List.length fl in
469 (fun (types,len) (n,_,ty,_) ->
470 (Some (Cic.Name n,(Cic.Decl (CicSubstitution.lift len ty)))::types,
473 let rno_fixno = ref 0 in
474 let fl, fixpoints,_ =
476 (fun (name,rno,_,bo) ty (l,fixpoints,idx) ->
477 let bo, fixpoints_bo = aux false boctx bctx n_fl buri bo in
478 let splty,fixpoints_splty = splat true ctx ty in
479 let splbo,fixpoints_splbo = splat false ctx bo in
480 let rno = rno + free_decls in
481 if idx = fixno then rno_fixno := rno;
482 (([],name,rno,splty,splbo)::l),
483 fixpoints_bo@fixpoints_splty@fixpoints_splbo@fixpoints,idx+1)
484 fl tys ([],fixpoints_tys,0)
487 NUri.nuri_of_ouri buri,max_int,[],[],
488 NCic.Fixpoint (true, fl, (`Generated, `Definition)) in
489 let r = Ref.reference_of_ouri buri (Ref.Fix (fixno,!rno_fixno)) in
491 let _,name,_,_,_ = List.nth fl fixno in
492 match find_in_cache name obj r with
496 splat_args ctx (NCic.Const r) n_fix rels, fixpoints @ obj
498 let bound, _, _, primo_ce_dopo_fix = context_tassonomy ctx in
499 (match List.nth ctx (n-1) with
500 | Fix l when n < primo_ce_dopo_fix ->
501 let r,_,_ = Lazy.force l in
502 splat_args_for_rel ctx (NCic.Const r) n_fix, []
503 | Ce _ when n <= bound -> NCic.Rel n, []
504 | Fix _ when n <= bound -> assert false
505 | Fix _ | Ce _ when k = true -> NCic.Rel n, []
506 | Fix _ | Ce _ -> NCic.Rel (n-n_fix), [])
507 | Cic.Lambda (name, (s as old_s), t) ->
508 let s, fixpoints_s = aux k octx ctx n_fix uri s in
509 let s'_and_fixpoints_s' = lazy (aux true octx ctx n_fix uri old_s) in
512 let s',fixpoints_s' = Lazy.force s'_and_fixpoints_s' in
513 ((cn_to_s name, NCic.Decl s'),fixpoints_s'))::ctx in
514 let octx = Some (name, Cic.Decl old_s) :: octx in
515 let t, fixpoints_t = aux k octx ctx n_fix uri t in
516 NCic.Lambda (cn_to_s name, s, t), fixpoints_s @ fixpoints_t
517 | Cic.Prod (name, (s as old_s), t) ->
518 let s, fixpoints_s = aux k octx ctx n_fix uri s in
519 let s'_and_fixpoints_s' = lazy (aux true octx ctx n_fix uri old_s) in
522 let s',fixpoints_s' = Lazy.force s'_and_fixpoints_s' in
523 ((cn_to_s name, NCic.Decl s'),fixpoints_s'))::ctx in
524 let octx = Some (name, Cic.Decl old_s) :: octx in
525 let t, fixpoints_t = aux k octx ctx n_fix uri t in
526 NCic.Prod (cn_to_s name, s, t), fixpoints_s @ fixpoints_t
527 | Cic.LetIn (name, (te as old_te), (ty as old_ty), t) ->
528 let te, fixpoints_s = aux k octx ctx n_fix uri te in
529 let te_and_fixpoints_s' = lazy (aux true octx ctx n_fix uri old_te) in
530 let ty, fixpoints_ty = aux k octx ctx n_fix uri ty in
531 let ty_and_fixpoints_ty' = lazy (aux true octx ctx n_fix uri old_ty) in
534 let te',fixpoints_s' = Lazy.force te_and_fixpoints_s' in
535 let ty',fixpoints_ty' = Lazy.force ty_and_fixpoints_ty' in
536 let fixpoints' = fixpoints_s' @ fixpoints_ty' in
537 ((cn_to_s name, NCic.Def (te', ty')),fixpoints'))::ctx in
538 let octx = Some (name, Cic.Def (old_te, old_ty)) :: octx in
539 let t, fixpoints_t = aux k octx ctx n_fix uri t in
540 NCic.LetIn (cn_to_s name, ty, te, t),
541 fixpoints_s @ fixpoints_t @ fixpoints_ty
543 let t, fixpoints_t = aux k octx ctx n_fix uri t in
544 let ty, fixpoints_ty = aux k octx ctx n_fix uri ty in
545 NCic.LetIn ("cast", ty, t, NCic.Rel 1), fixpoints_t @ fixpoints_ty
546 | Cic.Sort Cic.Prop -> NCic.Sort NCic.Prop,[]
547 | Cic.Sort Cic.CProp -> NCic.Sort NCic.CProp,[]
548 | Cic.Sort (Cic.Type u) ->
549 NCic.Sort (NCic.Type (CicUniv.get_rank u)),[]
550 | Cic.Sort Cic.Set -> NCic.Sort (NCic.Type 0),[]
551 (* calculate depth in the univ_graph*)
556 let t, fixpoints = aux k octx ctx n_fix uri t in
557 (t::l,fixpoints@acc))
561 | (NCic.Appl l1)::l2 -> NCic.Appl (l1@l2), fixpoints
562 | _ -> NCic.Appl l, fixpoints)
563 | Cic.Const (curi, ens) ->
564 aux_ens k curi octx ctx n_fix uri ens
565 (match fst(CicEnvironment.get_obj CicUniv.oblivion_ugraph curi) with
566 | Cic.Constant (_,Some _,_,_,_) ->
567 NCic.Const (Ref.reference_of_ouri curi Ref.Def)
568 | Cic.Constant (_,None,_,_,_) ->
569 NCic.Const (Ref.reference_of_ouri curi Ref.Decl)
571 | Cic.MutInd (curi, tyno, ens) ->
572 aux_ens k curi octx ctx n_fix uri ens
573 (NCic.Const (Ref.reference_of_ouri curi (Ref.Ind tyno)))
574 | Cic.MutConstruct (curi, tyno, consno, ens) ->
575 aux_ens k curi octx ctx n_fix uri ens
576 (NCic.Const (Ref.reference_of_ouri curi (Ref.Con (tyno,consno))))
577 | Cic.Var (curi, ens) ->
578 (match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph curi) with
579 Cic.Variable (_,Some bo,_,_,_) ->
580 aux k octx ctx n_fix uri (CicSubstitution.subst_vars ens bo)
582 | Cic.MutCase (curi, tyno, outty, t, branches) ->
583 let r = Ref.reference_of_ouri curi (Ref.Ind tyno) in
584 let outty, fixpoints_outty = aux k octx ctx n_fix uri outty in
585 let t, fixpoints_t = aux k octx ctx n_fix uri t in
586 let branches, fixpoints =
589 let t, fixpoints = aux k octx ctx n_fix uri t in
590 (t::l,fixpoints@acc))
593 NCic.Match (r,outty,t,branches), fixpoints_outty@fixpoints_t@fixpoints
594 | Cic.Implicit _ | Cic.Meta _ -> assert false
595 and aux_ens k curi octx ctx n_fix uri ens he =
600 match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph curi) with
601 Cic.Constant (_,_,_,params,_)
602 | Cic.InductiveDefinition (_,params,_,_) -> params
604 | Cic.CurrentProof _ -> assert false
608 (fun luri (l,objs) ->
609 match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph luri) with
610 Cic.Variable (_,Some _,_,_,_) -> l, objs
611 | Cic.Variable (_,None,_,_,_) ->
612 let t = List.assoc luri ens in
613 let t,o = aux k octx ctx n_fix uri t in
620 | _::_ -> NCic.Appl (he::ens),objs
622 aux false [] [] 0 uri t
625 let cook mode vars t =
626 let t = fix_outtype t in
627 let varsno = List.length vars in
628 let t = CicSubstitution.lift varsno t in
629 let rec aux n acc l =
631 snd(List.fold_left (fun (i,res) uri -> i+1,(uri,Cic.Rel i)::res) (1,[]) acc)
634 [] -> CicSubstitution.subst_vars subst t
637 match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph uri) with
638 Cic.Variable (_,bo,ty,_,_) ->
639 HExtlib.map_option fix_outtype bo, fix_outtype ty
640 | _ -> assert false in
641 let ty = CicSubstitution.subst_vars subst ty in
642 let bo = HExtlib.map_option (CicSubstitution.subst_vars subst) bo in
643 let id = Cic.Name (UriManager.name_of_uri uri) in
644 let t = aux (n-1) (uri::acc) uris in
645 match bo,ty,mode with
646 None,ty,`Lambda -> Cic.Lambda (id,ty,t)
647 | None,ty,`Pi -> Cic.Prod (id,ty,t)
648 | Some bo,ty,_ -> Cic.LetIn (id,bo,ty,t)
653 let convert_obj_aux uri = function
654 | Cic.Constant (name, None, ty, vars, _) ->
655 let ty = cook `Pi vars ty in
656 let nty, fixpoints = convert_term uri ty in
657 assert(fixpoints = []);
658 NCic.Constant ([], name, None, nty, (`Provided,`Theorem,`Regular)),
660 | Cic.Constant (name, Some bo, ty, vars, _) ->
661 let bo = cook `Lambda vars bo in
662 let ty = cook `Pi vars ty in
663 let nbo, fixpoints_bo = convert_term uri bo in
664 let nty, fixpoints_ty = convert_term uri ty in
665 assert(fixpoints_ty = []);
666 NCic.Constant ([], name, Some nbo, nty, (`Provided,`Theorem,`Regular)),
667 fixpoints_bo @ fixpoints_ty
668 | Cic.InductiveDefinition (itl,vars,leftno,_) ->
669 let ind = let _,x,_,_ = List.hd itl in x in
672 (fun (name, _, ty, cl) (itl,acc) ->
673 let ty = cook `Pi vars ty in
674 let ty, fix_ty = convert_term uri ty in
677 (fun (name, ty) (cl,acc) ->
678 let ty = cook `Pi vars ty in
679 let ty, fix_ty = convert_term uri ty in
680 ([], name, ty)::cl, acc @ fix_ty)
683 ([], name, ty, cl)::itl, fix_ty @ fix_cl @ acc)
686 NCic.Inductive(ind, leftno + List.length
687 (List.filter (fun v ->
688 match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph v) with
689 Cic.Variable (_,Some _,_,_,_) -> false
690 | Cic.Variable (_,None,_,_,_) -> true
693 , itl, (`Provided, `Regular)),
696 | Cic.CurrentProof _ -> assert false
699 let convert_obj uri obj =
701 let o, fixpoints = convert_obj_aux uri obj in
702 let obj = NUri.nuri_of_ouri uri,max_int, [], [], o in