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_______________________________________________________________ *)
14 module Ref = NReference
16 let nuri_of_ouri o = NUri.uri_of_string (UriManager.string_of_uri o);;
19 type reference = Ref of int * NUri.uri * NReference.spec
20 let reference_of_ouri u indinfo =
21 let u = nuri_of_ouri u in
22 NReference.reference_of_string
23 (NReference.string_of_reference (Obj.magic (Ref (max_int,u,indinfo))))
27 | Ce of (NCic.hypothesis * NCic.obj list) Lazy.t
28 | Fix of (Ref.reference * string * NCic.term) Lazy.t
32 Ce l -> `Ce (Lazy.force l)
33 | Fix l -> `Fix (Lazy.force l)
36 (***** A function to restrict the context of a term getting rid of unsed
39 let restrict octx ctx ot =
40 let odummy = Cic.Implicit None in
41 let dummy = NCic.Meta (~-1,(0,NCic.Irl 0)) in
42 let rec aux m acc ot t =
45 | ohe::otl as octx,he::tl ->
46 if CicTypeChecker.does_not_occur octx 0 1 ot then
47 aux (m+1) acc (CicSubstitution.subst odummy ot)
48 (NCicSubstitution.subst dummy t) (otl,tl)
50 (match ohe,strictify he with
51 None,_ -> assert false
52 | Some (name,Cic.Decl oty),`Ce ((name', NCic.Decl ty),objs) ->
53 aux (m+1) ((m+1,objs,None)::acc) (Cic.Lambda (name,oty,ot))
54 (NCic.Lambda (name',ty,t)) (otl,tl)
55 | Some (name,Cic.Decl oty),`Fix (ref,name',ty) ->
56 aux (m+1) ((m+1,[],Some ref)::acc) (Cic.Lambda (name,oty,ot))
57 (NCic.Lambda (name',ty,t)) (otl,tl)
58 | Some (name,Cic.Def (obo,oty)),`Ce ((name', NCic.Def (bo,ty)),objs) ->
59 aux (m+1) ((m+1,objs,None)::acc) (Cic.LetIn (name,obo,oty,ot))
60 (NCic.LetIn (name',bo,ty,t)) (otl,tl)
61 | _,_ -> assert false)
62 | _,_ -> assert false in
63 let rec split_lambdas_and_letins octx ctx infos (ote,te) =
64 match infos, ote, te with
65 ([], _, _) -> octx,ctx,ote
66 | ((_,objs,None)::tl, Cic.Lambda(name,oso,ota), NCic.Lambda(name',so,ta)) ->
67 split_lambdas_and_letins ((Some(name,(Cic.Decl oso)))::octx)
68 (Ce (lazy ((name',NCic.Decl so),objs))::ctx) tl (ota,ta)
69 | ((_,objs,Some r)::tl,Cic.Lambda(name,oso,ota),NCic.Lambda(name',so,ta)) ->
70 split_lambdas_and_letins ((Some(name,(Cic.Decl oso)))::octx)
71 (Fix (lazy (r,name',so))::ctx) tl (ota,ta)
72 | ((_,objs,None)::tl,Cic.LetIn(name,obo,oty,ota),NCic.LetIn(nam',bo,ty,ta))->
73 split_lambdas_and_letins ((Some (name,(Cic.Def (obo,oty))))::octx)
74 (Ce (lazy ((nam',NCic.Def (bo,ty)),objs))::ctx) tl (ota,ta)
75 | (_, _, _) -> assert false
77 let long_t,infos = aux 0 [] ot dummy (octx,ctx) in
78 let clean_octx,clean_ctx,clean_ot= split_lambdas_and_letins [] [] infos long_t
80 (*prerr_endline ("RESTRICT PRIMA: " ^ CicPp.pp ot (List.map (function None -> None | Some (name,_) -> Some name) octx));
81 prerr_endline ("RESTRICT DOPO: " ^ CicPp.pp clean_ot (List.map (function None -> None | Some (name,_) -> Some name) clean_octx));
83 clean_octx,clean_ctx,clean_ot, List.map (fun (rel,_,_) -> rel) infos
87 (**** The translation itself ****)
89 let cn_to_s = function
90 | Cic.Anonymous -> "_"
94 let splat mk_pi ctx t =
97 match strictify c with
98 | `Ce ((name, NCic.Def (bo,ty)),l') -> NCic.LetIn (name, ty, bo, t),l@l'
99 | `Ce ((name, NCic.Decl ty),l') when mk_pi -> NCic.Prod (name, ty, t),l@l'
100 | `Ce ((name, NCic.Decl ty),l') -> NCic.Lambda (name, ty, t),l@l'
101 | `Fix (_,name,ty) when mk_pi -> NCic.Prod (name, ty, t),l
102 | `Fix (_,name,ty) -> NCic.Lambda (name,ty,t),l)
106 let context_tassonomy ctx =
107 let rec split inner acc acc1 = function
108 | Ce _ :: tl when inner -> split inner (acc+1) (acc1+1) tl
109 | Fix _ ::tl -> split false acc (acc1+1) tl
115 (match strictify ce with
116 `Ce ((_, NCic.Decl _),_) -> true
120 acc, List.length l, lazy (List.length (only_decl ())), acc1
125 let splat_args_for_rel ctx t ?rels n_fix =
130 let rec mk_irl = function 0 -> [] | n -> n::mk_irl (n - 1) in
131 mk_irl (List.length ctx)
133 let bound, free, _, primo_ce_dopo_fix = context_tassonomy ctx in
136 let rec aux = function
137 | n,_ when n = bound + n_fix -> []
139 (match strictify (List.nth ctx (n-1)) with
140 | `Fix (refe, _, _) when n < primo_ce_dopo_fix ->
141 NCic.Const refe :: aux (n-1,tl)
142 | `Fix _ | `Ce ((_, NCic.Decl _),_) ->
143 NCic.Rel (he - n_fix)::aux(n-1,tl)
144 | `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 let splat_args ctx t n_fix rels =
154 let bound, free, _, primo_ce_dopo_fix = context_tassonomy ctx in
157 let rec aux = function
160 (match strictify (List.nth ctx (n-1)) with
161 | `Ce ((_, NCic.Decl _),_) when n <= bound ->
162 NCic.Rel he:: aux (n-1,tl)
163 | `Fix (refe, _, _) when n < primo_ce_dopo_fix ->
164 splat_args_for_rel ctx (NCic.Const refe) ~rels n_fix :: aux (n-1,tl)
165 | `Fix _ | `Ce((_, NCic.Decl _),_)-> NCic.Rel (he - n_fix)::aux(n-1,tl)
166 | `Ce ((_, NCic.Def _),_) -> aux (n - 1,tl)
168 | _,_ -> assert false
170 let args = aux (List.length ctx,rels) in
173 | _::_ -> NCic.Appl (t::args)
176 exception Nothing_to_do;;
178 let fix_outty curi tyno t context outty =
180 match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph curi) with
181 Cic.InductiveDefinition (tyl,_,leftno,_) ->
182 let _,_,arity,_ = List.nth tyl tyno in
183 let rec count_prods leftno context arity =
184 match leftno, CicReduction.whd context arity with
186 | 0, Cic.Prod (name,so,ty) ->
187 1 + count_prods 0 (Some (name, Cic.Decl so)::context) ty
188 | n, Cic.Prod (name,so,ty) ->
189 count_prods (leftno - 1) (Some (name, Cic.Decl so)::context) ty
190 | _,_ -> assert false
192 (*prerr_endline (UriManager.string_of_uri curi);
193 prerr_endline ("LEFTNO: " ^ string_of_int leftno ^ " " ^ CicPp.ppterm arity);*)
194 leftno, count_prods leftno [] arity
195 | _ -> assert false in
197 let tty,_= CicTypeChecker.type_of_aux' [] context t CicUniv.oblivion_ugraph in
198 match CicReduction.whd context tty with
199 Cic.MutInd (_,_,ens) -> ens,[]
200 | Cic.Appl (Cic.MutInd (_,_,ens)::args) ->
201 ens,fst (HExtlib.split_nth leftno args)
204 let rec aux n irl context outsort =
205 match n, CicReduction.whd context outsort with
206 0, Cic.Prod _ -> raise Nothing_to_do
208 let irl = List.rev irl in
209 let ty = CicSubstitution.lift rightno (Cic.MutInd (curi,tyno,ens)) in
211 if args = [] && irl = [] then ty
213 Cic.Appl (ty::(List.map (CicSubstitution.lift rightno) args)@irl) in
214 let he = CicSubstitution.lift (rightno + 1) outty in
217 else Cic.Appl (he::List.map (CicSubstitution.lift 1) irl)
219 Cic.Lambda (Cic.Anonymous, ty, t)
220 | n, Cic.Prod (name,so,ty) ->
222 aux (n - 1) (Cic.Rel n::irl) (Some (name, Cic.Decl so)::context) ty
224 Cic.Lambda (name,so,ty')
225 | _,_ -> assert false
227 (*prerr_endline ("RIGHTNO = " ^ string_of_int rightno ^ " OUTTY = " ^ CicPp.ppterm outty);*)
229 fst (CicTypeChecker.type_of_aux' [] context outty CicUniv.oblivion_ugraph)
231 try aux rightno [] context outsort
232 with Nothing_to_do -> outty
233 (*prerr_endline (CicPp.ppterm outty ^ " <==> " ^ CicPp.ppterm outty');*)
237 let module C = Cic in
238 let rec aux context =
241 | C.Var (uri,exp_named_subst) ->
242 let exp_named_subst' =
243 List.map (function i,t -> i, (aux context t)) exp_named_subst in
244 C.Var (uri,exp_named_subst')
246 | C.Meta _ -> assert false
248 | C.Cast (v,t) -> C.Cast (aux context v, aux context t)
250 C.Prod (n, aux context s, aux ((Some (n, C.Decl s))::context) t)
251 | C.Lambda (n,s,t) ->
252 C.Lambda (n, aux context s, aux ((Some (n, C.Decl s))::context) t)
253 | C.LetIn (n,s,ty,t) ->
255 (n, aux context s, aux context ty,
256 aux ((Some (n, C.Def(s,ty)))::context) t)
257 | C.Appl l -> C.Appl (List.map (aux context) l)
258 | C.Const (uri,exp_named_subst) ->
259 let exp_named_subst' =
260 List.map (function i,t -> i, (aux context t)) exp_named_subst
262 C.Const (uri,exp_named_subst')
263 | C.MutInd (uri,tyno,exp_named_subst) ->
264 let exp_named_subst' =
265 List.map (function i,t -> i, (aux context t)) exp_named_subst
267 C.MutInd (uri, tyno, exp_named_subst')
268 | C.MutConstruct (uri,tyno,consno,exp_named_subst) ->
269 let exp_named_subst' =
270 List.map (function i,t -> i, (aux context t)) exp_named_subst
272 C.MutConstruct (uri, tyno, consno, exp_named_subst')
273 | C.MutCase (uri, tyno, outty, term, patterns) ->
274 let outty = fix_outty uri tyno term context outty in
275 C.MutCase (uri, tyno, aux context outty,
276 aux context term, List.map (aux context) patterns)
277 | C.Fix (funno, funs) ->
280 (fun (types,len) (n,_,ty,_) ->
281 ((Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))))::types,
287 (fun (name, indidx, ty, bo) ->
288 (name, indidx, aux context ty, aux (tys@context) bo)
291 | C.CoFix (funno, funs) ->
294 (fun (types,len) (n,ty,_) ->
295 ((Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))))::types,
301 (fun (name, ty, bo) ->
302 (name, aux context ty, aux (tys@context) bo)
309 let get_fresh,reset_seed =
313 string_of_int !seed),
314 (function () -> seed := 0)
318 let alpha t1 t2 ref ref' =
319 let rec aux t1 t2 = match t1,t2 with
320 | NCic.Rel n, NCic.Rel m when n=m -> ()
321 | NCic.Appl l1, NCic.Appl l2 -> List.iter2 aux l1 l2
322 | NCic.Lambda (_,s1,t1), NCic.Lambda (_,s2,t2)
323 | NCic.Prod (_,s1,t1), NCic.Prod (_,s2,t2) -> aux s1 s2; aux t1 t2
324 | NCic.LetIn (_,s1,ty1,t1), NCic.LetIn (_,s2,ty2,t2) ->
325 aux s1 s2; aux ty1 ty2; aux t1 t2
326 | NCic.Const (NReference.Ref (_,uu1,xp1)),
327 NCic.Const (NReference.Ref (_,uu2,xp2)) when
328 let NReference.Ref (_,u1,_) = ref in
329 let NReference.Ref (_,u2,_) = ref' in
330 NUri.eq uu1 u1 && NUri.eq uu2 u2 && xp1 = xp2
332 | NCic.Const r1, NCic.Const r2 when NReference.eq r1 r2 -> ()
333 | NCic.Meta _,NCic.Meta _ -> ()
334 | NCic.Implicit _,NCic.Implicit _ -> ()
335 | NCic.Sort x,NCic.Sort y when x=y -> ()
336 | NCic.Match (_,t1,t11,tl1), NCic.Match (_,t2,t22,tl2) ->
337 aux t1 t2;aux t11 t22;List.iter2 aux tl1 tl2
338 | _-> raise NotSimilar
340 try aux t1 t2; true with NotSimilar -> false
343 exception Found of NReference.reference;;
344 let cache = Hashtbl.create 313;;
345 let same_obj ref ref' =
347 | (_,_,_,_,NCic.Fixpoint (b1,l1,_)), (_,_,_,_,NCic.Fixpoint (b2,l2,_))
348 when List.for_all2 (fun (_,_,_,ty1,bo1) (_,_,_,ty2,bo2) ->
349 alpha ty1 ty2 ref ref' && alpha bo1 bo2 ref ref') l1 l2 && b1=b2->
353 let find_in_cache name obj ref =
356 (function (ref',obj') ->
359 NReference.Ref (_,_,NReference.Fix (fixno,recno)) -> recno,fixno
360 | NReference.Ref (_,_,NReference.CoFix (fixno)) -> ~-1,fixno
361 | _ -> assert false in
364 NReference.Ref (_,_,NReference.Fix (fixno',recno)) -> recno,fixno'
365 | NReference.Ref (_,_,NReference.CoFix (fixno')) -> ~-1,fixno'
366 | _ -> assert false in
367 if recno = recno' && fixno = fixno' && same_obj ref ref' (obj,obj') then (
369 prerr_endline ("!!!!!!!!!!! CACHE HIT !!!!!!!!!!\n" ^
370 NReference.string_of_reference ref ^ "\n" ^
371 NReference.string_of_reference ref' ^ "\n");
375 prerr_endline ("CACHE SAME NAME: " ^ NReference.string_of_reference ref ^ " <==> " ^ NReference.string_of_reference ref');
377 ) (Hashtbl.find_all cache name);
378 (* prerr_endline "<<< CACHE MISS >>>"; *)
381 | (_,_,_,_,NCic.Fixpoint (true,fl,_)) ,
382 NReference.Ref (x,y,NReference.Fix _) ->
383 ignore(List.fold_left (fun i (_,name,rno,_,_) ->
384 let ref = NReference.mk_fix i rno ref in
385 Hashtbl.add cache name (ref,obj);
388 | (_,_,_,_,NCic.Fixpoint (false,fl,_)) ,
389 NReference.Ref (x,y,NReference.CoFix _) ->
390 ignore(List.fold_left (fun i (_,name,rno,_,_) ->
391 let ref = NReference.mk_cofix i ref in
392 Hashtbl.add cache name (ref,obj);
398 with Found ref -> Some ref
401 (* we are lambda-lifting also variables that do not occur *)
402 (* ctx does not distinguish successive blocks of cofix, since there may be no
403 * lambda separating them *)
404 let convert_term uri t =
405 (* k=true if we are converting a term to be pushed in a ctx or if we are
406 converting the type of a fix;
407 k=false if we are converting a term to be put in the body of a fix;
408 in the latter case, we must permute Rels since the Fix abstraction will
409 preceed its lefts parameters; in the former case, there is nothing to
411 let rec aux k octx (ctx : ctx list) n_fix uri = function
412 | Cic.CoFix _ as cofix ->
413 let octx,ctx,fix,rels = restrict octx ctx cofix in
415 match fix with Cic.CoFix (cofixno,fl)->cofixno,fl | _-> assert false in
417 UriManager.uri_of_string
418 (UriManager.buri_of_uri uri^"/"^
419 UriManager.name_of_uri uri ^ "___" ^ get_fresh () ^ ".con")
421 let bctx, fixpoints_tys, tys, _ =
423 (fun (name,ty,_) (bctx, fixpoints, tys, idx) ->
424 let ty, fixpoints_ty = aux true octx ctx n_fix uri ty in
425 let r = reference_of_ouri buri(Ref.CoFix idx) in
426 bctx @ [Fix (lazy (r,name,ty))],
427 fixpoints_ty @ fixpoints,ty::tys,idx-1)
428 fl ([], [], [], List.length fl-1)
430 let bctx = bctx @ ctx in
431 let n_fl = List.length fl in
434 (fun (types,len) (n,ty,_) ->
435 (Some (Cic.Name n,(Cic.Decl (CicSubstitution.lift len ty)))::types,
440 (fun (name,_,bo) ty (l,fixpoints) ->
441 let bo, fixpoints_bo = aux false boctx bctx n_fl buri bo in
442 let splty,fixpoints_splty = splat true ctx ty in
443 let splbo,fixpoints_splbo = splat false ctx bo in
444 (([],name,~-1,splty,splbo)::l),
445 fixpoints_bo @ fixpoints_splty @ fixpoints_splbo @ fixpoints)
446 fl tys ([],fixpoints_tys)
449 nuri_of_ouri buri,0,[],[],
450 NCic.Fixpoint (false, fl, (`Generated, `Definition))
452 let r = reference_of_ouri buri (Ref.CoFix cofixno) in
454 let _,name,_,_,_ = List.nth fl cofixno in
455 match find_in_cache name obj r with
459 splat_args ctx (NCic.Const r) n_fix rels, fixpoints @ obj
460 | Cic.Fix _ as fix ->
461 let octx,ctx,fix,rels = restrict octx ctx fix in
463 match fix with Cic.Fix (fixno,fl) -> fixno,fl | _ -> assert false in
465 UriManager.uri_of_string
466 (UriManager.buri_of_uri uri^"/"^
467 UriManager.name_of_uri uri ^ "___" ^ get_fresh () ^ ".con")
469 let bad_bctx, fixpoints_tys, tys, _ =
471 (fun (name,recno,ty,_) (bctx, fixpoints, tys, idx) ->
472 let ty, fixpoints_ty = aux true octx ctx n_fix uri ty in
473 let r = (* recno is dummy here, must be lifted by the ctx len *)
474 reference_of_ouri buri (Ref.Fix (idx,recno))
476 bctx @ [Fix (lazy (r,name,ty))],
477 fixpoints_ty@fixpoints,ty::tys,idx-1)
478 fl ([], [], [], List.length fl-1)
480 let _, _, free_decls, _ = context_tassonomy (bad_bctx @ ctx) in
481 let free_decls = Lazy.force free_decls in
483 List.map (function ce -> match strictify ce with
484 | `Fix (Ref.Ref (_,_,Ref.Fix (idx, recno)),name, ty) ->
485 Fix (lazy (reference_of_ouri buri
486 (Ref.Fix (idx,recno+free_decls)),name,ty))
487 | _ -> assert false) bad_bctx @ ctx
489 let n_fl = List.length fl in
492 (fun (types,len) (n,_,ty,_) ->
493 (Some (Cic.Name n,(Cic.Decl (CicSubstitution.lift len ty)))::types,
496 let rno_fixno = ref 0 in
497 let fl, fixpoints,_ =
499 (fun (name,rno,_,bo) ty (l,fixpoints,idx) ->
500 let bo, fixpoints_bo = aux false boctx bctx n_fl buri bo in
501 let splty,fixpoints_splty = splat true ctx ty in
502 let splbo,fixpoints_splbo = splat false ctx bo in
503 let rno = rno + free_decls in
504 if idx = fixno then rno_fixno := rno;
505 (([],name,rno,splty,splbo)::l),
506 fixpoints_bo@fixpoints_splty@fixpoints_splbo@fixpoints,idx+1)
507 fl tys ([],fixpoints_tys,0)
510 nuri_of_ouri buri,max_int,[],[],
511 NCic.Fixpoint (true, fl, (`Generated, `Definition)) in
512 let r = reference_of_ouri buri (Ref.Fix (fixno,!rno_fixno)) in
514 let _,name,_,_,_ = List.nth fl fixno in
515 match find_in_cache name obj r with
519 splat_args ctx (NCic.Const r) n_fix rels, fixpoints @ obj
521 let bound, _, _, primo_ce_dopo_fix = context_tassonomy ctx in
522 (match List.nth ctx (n-1) with
523 | Fix l when n < primo_ce_dopo_fix ->
524 let r,_,_ = Lazy.force l in
525 splat_args_for_rel ctx (NCic.Const r) n_fix, []
526 | Ce _ when n <= bound -> NCic.Rel n, []
527 | Fix _ when n <= bound -> assert false
528 | Fix _ | Ce _ when k = true -> NCic.Rel n, []
529 | Fix _ | Ce _ -> NCic.Rel (n-n_fix), [])
530 | Cic.Lambda (name, (s as old_s), t) ->
531 let s, fixpoints_s = aux k octx ctx n_fix uri s in
532 let s'_and_fixpoints_s' = lazy (aux true octx ctx n_fix uri old_s) in
535 let s',fixpoints_s' = Lazy.force s'_and_fixpoints_s' in
536 ((cn_to_s name, NCic.Decl s'),fixpoints_s'))::ctx in
537 let octx = Some (name, Cic.Decl old_s) :: octx in
538 let t, fixpoints_t = aux k octx ctx n_fix uri t in
539 NCic.Lambda (cn_to_s name, s, t), fixpoints_s @ fixpoints_t
540 | Cic.Prod (name, (s as old_s), t) ->
541 let s, fixpoints_s = aux k octx ctx n_fix uri s in
542 let s'_and_fixpoints_s' = lazy (aux true octx ctx n_fix uri old_s) in
545 let s',fixpoints_s' = Lazy.force s'_and_fixpoints_s' in
546 ((cn_to_s name, NCic.Decl s'),fixpoints_s'))::ctx in
547 let octx = Some (name, Cic.Decl old_s) :: octx in
548 let t, fixpoints_t = aux k octx ctx n_fix uri t in
549 NCic.Prod (cn_to_s name, s, t), fixpoints_s @ fixpoints_t
550 | Cic.LetIn (name, (te as old_te), (ty as old_ty), t) ->
551 let te, fixpoints_s = aux k octx ctx n_fix uri te in
552 let te_and_fixpoints_s' = lazy (aux true octx ctx n_fix uri old_te) in
553 let ty, fixpoints_ty = aux k octx ctx n_fix uri ty in
554 let ty_and_fixpoints_ty' = lazy (aux true octx ctx n_fix uri old_ty) in
557 let te',fixpoints_s' = Lazy.force te_and_fixpoints_s' in
558 let ty',fixpoints_ty' = Lazy.force ty_and_fixpoints_ty' in
559 let fixpoints' = fixpoints_s' @ fixpoints_ty' in
560 ((cn_to_s name, NCic.Def (te', ty')),fixpoints'))::ctx in
561 let octx = Some (name, Cic.Def (old_te, old_ty)) :: octx in
562 let t, fixpoints_t = aux k octx ctx n_fix uri t in
563 NCic.LetIn (cn_to_s name, ty, te, t),
564 fixpoints_s @ fixpoints_t @ fixpoints_ty
566 let t, fixpoints_t = aux k octx ctx n_fix uri t in
567 let ty, fixpoints_ty = aux k octx ctx n_fix uri ty in
568 NCic.LetIn ("cast", ty, t, NCic.Rel 1), fixpoints_t @ fixpoints_ty
569 | Cic.Sort Cic.Prop -> NCic.Sort NCic.Prop,[]
570 | Cic.Sort Cic.CProp -> NCic.Sort NCic.CProp,[]
571 | Cic.Sort (Cic.Type u) ->
572 NCic.Sort (NCic.Type (CicUniv.get_rank u)),[]
573 | Cic.Sort Cic.Set -> NCic.Sort (NCic.Type 0),[]
574 (* calculate depth in the univ_graph*)
579 let t, fixpoints = aux k octx ctx n_fix uri t in
580 (t::l,fixpoints@acc))
584 | (NCic.Appl l1)::l2 -> NCic.Appl (l1@l2), fixpoints
585 | _ -> NCic.Appl l, fixpoints)
586 | Cic.Const (curi, ens) ->
587 aux_ens k curi octx ctx n_fix uri ens
588 (match fst(CicEnvironment.get_obj CicUniv.oblivion_ugraph curi) with
589 | Cic.Constant (_,Some _,_,_,_) ->
590 NCic.Const (reference_of_ouri curi Ref.Def)
591 | Cic.Constant (_,None,_,_,_) ->
592 NCic.Const (reference_of_ouri curi Ref.Decl)
594 | Cic.MutInd (curi, tyno, ens) ->
596 match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph curi) with
597 Cic.InductiveDefinition ([],_,_,_) -> true
598 | Cic.InductiveDefinition ((_,b,_,_)::_,_,_,_) -> b
601 aux_ens k curi octx ctx n_fix uri ens
602 (NCic.Const (reference_of_ouri curi (Ref.Ind (is_inductive,tyno))))
603 | Cic.MutConstruct (curi, tyno, consno, ens) ->
604 aux_ens k curi octx ctx n_fix uri ens
605 (NCic.Const (reference_of_ouri curi (Ref.Con (tyno,consno))))
606 | Cic.Var (curi, ens) ->
607 (match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph curi) with
608 Cic.Variable (_,Some bo,_,_,_) ->
609 aux k octx ctx n_fix uri (CicSubstitution.subst_vars ens bo)
611 | Cic.MutCase (curi, tyno, outty, t, branches) ->
613 match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph curi) with
614 Cic.InductiveDefinition ([],_,_,_) -> true
615 | Cic.InductiveDefinition ((_,b,_,_)::_,_,_,_) -> b
616 | _ -> assert false in
617 let r = reference_of_ouri curi (Ref.Ind (is_inductive,tyno)) in
618 let outty, fixpoints_outty = aux k octx ctx n_fix uri outty in
619 let t, fixpoints_t = aux k octx ctx n_fix uri t in
620 let branches, fixpoints =
623 let t, fixpoints = aux k octx ctx n_fix uri t in
624 (t::l,fixpoints@acc))
627 NCic.Match (r,outty,t,branches), fixpoints_outty@fixpoints_t@fixpoints
628 | Cic.Implicit _ | Cic.Meta _ -> assert false
629 and aux_ens k curi octx ctx n_fix uri ens he =
634 match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph curi) with
635 Cic.Constant (_,_,_,params,_)
636 | Cic.InductiveDefinition (_,params,_,_) -> params
638 | Cic.CurrentProof _ -> assert false
642 (fun luri (l,objs) ->
643 match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph luri) with
644 Cic.Variable (_,Some _,_,_,_) -> l, objs
645 | Cic.Variable (_,None,_,_,_) ->
646 let t = List.assoc luri ens in
647 let t,o = aux k octx ctx n_fix uri t in
654 | _::_ -> NCic.Appl (he::ens),objs
656 aux false [] [] 0 uri t
659 let cook mode vars t =
660 let t = fix_outtype t in
661 let varsno = List.length vars in
662 let t = CicSubstitution.lift varsno t in
663 let rec aux n acc l =
665 snd(List.fold_left (fun (i,res) uri -> i+1,(uri,Cic.Rel i)::res) (1,[]) acc)
668 [] -> CicSubstitution.subst_vars subst t
671 match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph uri) with
672 Cic.Variable (_,bo,ty,_,_) ->
673 HExtlib.map_option fix_outtype bo, fix_outtype ty
674 | _ -> assert false in
675 let ty = CicSubstitution.subst_vars subst ty in
676 let bo = HExtlib.map_option (CicSubstitution.subst_vars subst) bo in
677 let id = Cic.Name (UriManager.name_of_uri uri) in
678 let t = aux (n-1) (uri::acc) uris in
679 match bo,ty,mode with
680 None,ty,`Lambda -> Cic.Lambda (id,ty,t)
681 | None,ty,`Pi -> Cic.Prod (id,ty,t)
682 | Some bo,ty,_ -> Cic.LetIn (id,bo,ty,t)
687 let convert_obj_aux uri = function
688 | Cic.Constant (name, None, ty, vars, _) ->
689 let ty = cook `Pi vars ty in
690 let nty, fixpoints = convert_term uri ty in
691 assert(fixpoints = []);
692 NCic.Constant ([], name, None, nty, (`Provided,`Theorem,`Regular)),
694 | Cic.Constant (name, Some bo, ty, vars, _) ->
695 let bo = cook `Lambda vars bo in
696 let ty = cook `Pi vars ty in
697 let nbo, fixpoints_bo = convert_term uri bo in
698 let nty, fixpoints_ty = convert_term uri ty in
699 assert(fixpoints_ty = []);
700 NCic.Constant ([], name, Some nbo, nty, (`Provided,`Theorem,`Regular)),
701 fixpoints_bo @ fixpoints_ty
702 | Cic.InductiveDefinition (itl,vars,leftno,_) ->
703 let ind = let _,x,_,_ = List.hd itl in x in
706 (fun (name, _, ty, cl) (itl,acc) ->
707 let ty = cook `Pi vars ty in
708 let ty, fix_ty = convert_term uri ty in
711 (fun (name, ty) (cl,acc) ->
712 let ty = cook `Pi vars ty in
713 let ty, fix_ty = convert_term uri ty in
714 ([], name, ty)::cl, acc @ fix_ty)
717 ([], name, ty, cl)::itl, fix_ty @ fix_cl @ acc)
720 NCic.Inductive(ind, leftno + List.length
721 (List.filter (fun v ->
722 match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph v) with
723 Cic.Variable (_,Some _,_,_,_) -> false
724 | Cic.Variable (_,None,_,_,_) -> true
727 , itl, (`Provided, `Regular)),
730 | Cic.CurrentProof _ -> assert false
733 let convert_obj uri obj =
735 let o, fixpoints = convert_obj_aux uri obj in
736 let obj = nuri_of_ouri uri,max_int, [], [], o in