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);;
20 [false, NUri.uri_of_string ("cic:/matita/pts/Type.univ")]
22 [false, NUri.uri_of_string ("cic:/matita/pts/Type"^string_of_int n^".univ")]
27 [false, NUri.uri_of_string ("cic:/matita/pts/CProp.univ")]
29 [false, NUri.uri_of_string ("cic:/matita/pts/CProp"^string_of_int n^".univ")]
32 let is_proof_irrelevant context ty =
34 CicReduction.whd context
35 (fst (CicTypeChecker.type_of_aux' [] context ty CicUniv.oblivion_ugraph))
37 Cic.Sort Cic.Prop -> true
44 let get_relevance ty =
45 let rec aux context ty =
46 match CicReduction.whd context ty with
48 not (is_proof_irrelevant context s)::aux (Some (n,Cic.Decl s)::context) t
51 (* | ty -> if is_proof_irrelevant context ty then raise InProp else []
58 type reference = Ref of NUri.uri * NReference.spec
59 let reference_of_ouri u indinfo =
60 let u = nuri_of_ouri u in
61 NReference.reference_of_string
62 (NReference.string_of_reference (Obj.magic (Ref (u,indinfo))))
66 | Ce of (NCic.hypothesis * NCic.obj list) Lazy.t
67 | Fix of (Ref.reference * string * NCic.term) Lazy.t
71 Ce l -> `Ce (Lazy.force l)
72 | Fix l -> `Fix (Lazy.force l)
77 (List.filter (fun v ->
78 match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph v) with
79 Cic.Variable (_,Some _,_,_,_) -> false
80 | Cic.Variable (_,None,_,_,_) -> true
81 | _ -> assert false) vars)
85 (***** A function to restrict the context of a term getting rid of unsed
88 let restrict octx ctx ot =
89 let odummy = Cic.Implicit None in
90 let dummy = NCic.Meta (~-1,(0,NCic.Irl 0)) in
91 let rec aux m acc ot t =
94 | ohe::otl as octx,he::tl ->
95 if CicTypeChecker.does_not_occur octx 0 1 ot then
96 aux (m+1) acc (CicSubstitution.subst odummy ot)
97 (NCicSubstitution.subst dummy t) (otl,tl)
99 (match ohe,strictify he with
100 None,_ -> assert false
101 | Some (name,Cic.Decl oty),`Ce ((name', NCic.Decl ty),objs) ->
102 aux (m+1) ((m+1,objs,None)::acc) (Cic.Lambda (name,oty,ot))
103 (NCic.Lambda (name',ty,t)) (otl,tl)
104 | Some (name,Cic.Decl oty),`Fix (ref,name',ty) ->
105 aux (m+1) ((m+1,[],Some ref)::acc) (Cic.Lambda (name,oty,ot))
106 (NCic.Lambda (name',ty,t)) (otl,tl)
107 | Some (name,Cic.Def (obo,oty)),`Ce ((name', NCic.Def (bo,ty)),objs) ->
108 aux (m+1) ((m+1,objs,None)::acc) (Cic.LetIn (name,obo,oty,ot))
109 (NCic.LetIn (name',bo,ty,t)) (otl,tl)
110 | _,_ -> assert false)
111 | _,_ -> assert false in
112 let rec split_lambdas_and_letins octx ctx infos (ote,te) =
113 match infos, ote, te with
114 ([], _, _) -> octx,ctx,ote
115 | ((_,objs,None)::tl, Cic.Lambda(name,oso,ota), NCic.Lambda(name',so,ta)) ->
116 split_lambdas_and_letins ((Some(name,(Cic.Decl oso)))::octx)
117 (Ce (lazy ((name',NCic.Decl so),objs))::ctx) tl (ota,ta)
118 | ((_,_,Some r)::tl,Cic.Lambda(name,oso,ota),NCic.Lambda(name',so,ta)) ->
119 split_lambdas_and_letins ((Some(name,(Cic.Decl oso)))::octx)
120 (Fix (lazy (r,name',so))::ctx) tl (ota,ta)
121 | ((_,objs,None)::tl,Cic.LetIn(name,obo,oty,ota),NCic.LetIn(nam',bo,ty,ta))->
122 split_lambdas_and_letins ((Some (name,(Cic.Def (obo,oty))))::octx)
123 (Ce (lazy ((nam',NCic.Def (bo,ty)),objs))::ctx) tl (ota,ta)
124 | (_, _, _) -> assert false
126 let long_t,infos = aux 0 [] ot dummy (octx,ctx) in
127 let clean_octx,clean_ctx,clean_ot= split_lambdas_and_letins [] [] infos long_t
129 (*prerr_endline ("RESTRICT PRIMA: " ^ CicPp.pp ot (List.map (function None -> None | Some (name,_) -> Some name) octx));
130 prerr_endline ("RESTRICT DOPO: " ^ CicPp.pp clean_ot (List.map (function None -> None | Some (name,_) -> Some name) clean_octx));
132 clean_octx,clean_ctx,clean_ot, List.map (fun (rel,_,_) -> rel) infos
136 (**** The translation itself ****)
138 let cn_to_s = function
139 | Cic.Anonymous -> "_"
143 let splat mk_pi ctx t =
146 match strictify c with
147 | `Ce ((name, NCic.Def (bo,ty)),l') -> NCic.LetIn (name, ty, bo, t),l@l'
148 | `Ce ((name, NCic.Decl ty),l') when mk_pi -> NCic.Prod (name, ty, t),l@l'
149 | `Ce ((name, NCic.Decl ty),l') -> NCic.Lambda (name, ty, t),l@l'
150 | `Fix (_,name,ty) when mk_pi -> NCic.Prod (name, ty, t),l
151 | `Fix (_,name,ty) -> NCic.Lambda (name,ty,t),l)
155 let osplat mk_pi ctx t =
159 | Some (name, Cic.Def (bo,ty)) -> Cic.LetIn (name, ty, bo, t)
160 | Some (name, Cic.Decl ty) when mk_pi -> Cic.Prod (name, ty, t)
161 | Some (name, Cic.Decl ty) -> Cic.Lambda (name, ty, t)
162 | None -> assert false)
166 let context_tassonomy ctx =
167 let rec split inner acc acc1 = function
168 | Ce _ :: tl when inner -> split inner (acc+1) (acc1+1) tl
169 | Fix _ ::tl -> split false acc (acc1+1) tl
175 (match strictify ce with
176 `Ce ((_, NCic.Decl _),_) -> true
180 acc, List.length l, lazy (List.length (only_decl ())), acc1
185 let splat_args_for_rel ctx t ?rels n_fix =
190 let rec mk_irl = function 0 -> [] | n -> n::mk_irl (n - 1) in
191 mk_irl (List.length ctx)
193 let bound, free, _, primo_ce_dopo_fix = context_tassonomy ctx in
196 let rec aux = function
197 | n,_ when n = bound + n_fix -> []
199 (match strictify (List.nth ctx (n-1)) with
200 | `Fix (refe, _, _) when n < primo_ce_dopo_fix ->
201 NCic.Const refe :: aux (n-1,tl)
202 | `Fix _ | `Ce ((_, NCic.Decl _),_) ->
203 NCic.Rel (he - n_fix)::aux(n-1,tl)
204 | `Ce ((_, NCic.Def _),_) -> aux (n-1,tl))
205 | _,_ -> assert false
207 let args = aux (List.length ctx,rels) in
210 | _::_ -> NCic.Appl (t::args)
213 let splat_args ctx t n_fix rels =
214 let bound, _, _, primo_ce_dopo_fix = context_tassonomy ctx in
217 let rec aux = function
220 (match strictify (List.nth ctx (n-1)) with
221 | `Ce ((_, NCic.Decl _),_) when n <= bound ->
222 NCic.Rel he:: aux (n-1,tl)
223 | `Fix (refe, _, _) when n < primo_ce_dopo_fix ->
224 splat_args_for_rel ctx (NCic.Const refe) ~rels n_fix :: aux (n-1,tl)
225 | `Fix _ | `Ce((_, NCic.Decl _),_)-> NCic.Rel (he - n_fix)::aux(n-1,tl)
226 | `Ce ((_, NCic.Def _),_) -> aux (n - 1,tl)
228 | _,_ -> assert false
230 let args = aux (List.length ctx,rels) in
233 | _::_ -> NCic.Appl (t::args)
236 exception Nothing_to_do;;
238 let fix_outty curi tyno t context outty =
240 match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph curi) with
241 Cic.InductiveDefinition (tyl,_,leftno,_) ->
242 let _,_,arity,_ = List.nth tyl tyno in
243 let rec count_prods leftno context arity =
244 match leftno, CicReduction.whd context arity with
246 | 0, Cic.Prod (name,so,ty) ->
247 1 + count_prods 0 (Some (name, Cic.Decl so)::context) ty
248 | _, Cic.Prod (name,so,ty) ->
249 count_prods (leftno - 1) (Some (name, Cic.Decl so)::context) ty
250 | _,_ -> assert false
252 (*prerr_endline (UriManager.string_of_uri curi);
253 prerr_endline ("LEFTNO: " ^ string_of_int leftno ^ " " ^ CicPp.ppterm arity);*)
254 leftno, count_prods leftno [] arity
255 | _ -> assert false in
257 let tty,_= CicTypeChecker.type_of_aux' [] context t CicUniv.oblivion_ugraph in
258 match CicReduction.whd context tty with
259 Cic.MutInd (_,_,ens) -> ens,[]
260 | Cic.Appl (Cic.MutInd (_,_,ens)::args) ->
261 ens,fst (HExtlib.split_nth leftno args)
264 let rec aux n irl context outsort =
265 match n, CicReduction.whd context outsort with
266 0, Cic.Prod _ -> raise Nothing_to_do
268 let irl = List.rev irl in
269 let ty = CicSubstitution.lift rightno (Cic.MutInd (curi,tyno,ens)) in
271 if args = [] && irl = [] then ty
273 Cic.Appl (ty::(List.map (CicSubstitution.lift rightno) args)@irl) in
274 let he = CicSubstitution.lift (rightno + 1) outty in
277 else Cic.Appl (he::List.map (CicSubstitution.lift 1) irl)
279 Cic.Lambda (Cic.Anonymous, ty, t)
280 | n, Cic.Prod (name,so,ty) ->
282 aux (n - 1) (Cic.Rel n::irl) (Some (name, Cic.Decl so)::context) ty
284 Cic.Lambda (name,so,ty')
285 | _,_ -> assert false
287 (*prerr_endline ("RIGHTNO = " ^ string_of_int rightno ^ " OUTTY = " ^ CicPp.ppterm outty);*)
289 fst (CicTypeChecker.type_of_aux' [] context outty CicUniv.oblivion_ugraph)
291 try aux rightno [] context outsort
292 with Nothing_to_do -> outty
293 (*prerr_endline (CicPp.ppterm outty ^ " <==> " ^ CicPp.ppterm outty');*)
297 let module C = Cic in
298 let rec aux context =
301 | C.Var (uri,exp_named_subst) ->
302 let exp_named_subst' =
303 List.map (function i,t -> i, (aux context t)) exp_named_subst in
304 C.Var (uri,exp_named_subst')
306 | C.Meta _ -> assert false
308 | C.Cast (v,t) -> C.Cast (aux context v, aux context t)
310 C.Prod (n, aux context s, aux ((Some (n, C.Decl s))::context) t)
311 | C.Lambda (n,s,t) ->
312 C.Lambda (n, aux context s, aux ((Some (n, C.Decl s))::context) t)
313 | C.LetIn (n,s,ty,t) ->
315 (n, aux context s, aux context ty,
316 aux ((Some (n, C.Def(s,ty)))::context) t)
317 | C.Appl l -> C.Appl (List.map (aux context) l)
318 | C.Const (uri,exp_named_subst) ->
319 let exp_named_subst' =
320 List.map (function i,t -> i, (aux context t)) exp_named_subst
322 C.Const (uri,exp_named_subst')
323 | C.MutInd (uri,tyno,exp_named_subst) ->
324 let exp_named_subst' =
325 List.map (function i,t -> i, (aux context t)) exp_named_subst
327 C.MutInd (uri, tyno, exp_named_subst')
328 | C.MutConstruct (uri,tyno,consno,exp_named_subst) ->
329 let exp_named_subst' =
330 List.map (function i,t -> i, (aux context t)) exp_named_subst
332 C.MutConstruct (uri, tyno, consno, exp_named_subst')
333 | C.MutCase (uri, tyno, outty, term, patterns) ->
334 let outty = fix_outty uri tyno term context outty in
335 C.MutCase (uri, tyno, aux context outty,
336 aux context term, List.map (aux context) patterns)
337 | C.Fix (funno, funs) ->
340 (fun (types,len) (n,_,ty,_) ->
341 ((Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))))::types,
347 (fun (name, indidx, ty, bo) ->
348 (name, indidx, aux context ty, aux (tys@context) bo)
351 | C.CoFix (funno, funs) ->
354 (fun (types,len) (n,ty,_) ->
355 ((Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))))::types,
361 (fun (name, ty, bo) ->
362 (name, aux context ty, aux (tys@context) bo)
369 let get_fresh,reset_seed =
373 string_of_int !seed),
374 (function () -> seed := 0)
378 let alpha t1 t2 ref ref' =
379 let rec aux t1 t2 = match t1,t2 with
380 | NCic.Rel n, NCic.Rel m when n=m -> ()
381 | NCic.Appl l1, NCic.Appl l2 -> List.iter2 aux l1 l2
382 | NCic.Lambda (_,s1,t1), NCic.Lambda (_,s2,t2)
383 | NCic.Prod (_,s1,t1), NCic.Prod (_,s2,t2) -> aux s1 s2; aux t1 t2
384 | NCic.LetIn (_,s1,ty1,t1), NCic.LetIn (_,s2,ty2,t2) ->
385 aux s1 s2; aux ty1 ty2; aux t1 t2
386 | NCic.Const (NReference.Ref (uu1,xp1)),
387 NCic.Const (NReference.Ref (uu2,xp2)) when
388 let NReference.Ref (u1,_) = ref in
389 let NReference.Ref (u2,_) = ref' in
390 NUri.eq uu1 u1 && NUri.eq uu2 u2 && xp1 = xp2
392 | NCic.Const r1, NCic.Const r2 when NReference.eq r1 r2 -> ()
393 | NCic.Meta _,NCic.Meta _ -> ()
394 | NCic.Implicit _,NCic.Implicit _ -> ()
395 | NCic.Sort x,NCic.Sort y when x=y -> ()
396 | NCic.Match (_,t1,t11,tl1), NCic.Match (_,t2,t22,tl2) ->
397 aux t1 t2;aux t11 t22;List.iter2 aux tl1 tl2
398 | _-> raise NotSimilar
400 try aux t1 t2; true with NotSimilar -> false
403 exception Found of NReference.reference;;
404 let cache = Hashtbl.create 313;;
405 let same_obj ref ref' =
407 | (_,_,_,_,NCic.Fixpoint (b1,l1,_)), (_,_,_,_,NCic.Fixpoint (b2,l2,_))
408 when List.for_all2 (fun (_,_,_,ty1,bo1) (_,_,_,ty2,bo2) ->
409 alpha ty1 ty2 ref ref' && alpha bo1 bo2 ref ref') l1 l2 && b1=b2->
413 let find_in_cache name obj ref =
416 (function (ref',obj') ->
419 NReference.Ref (_,NReference.Fix (fixno,recno,_)) -> recno,fixno
420 | NReference.Ref (_,NReference.CoFix (fixno)) -> ~-1,fixno
421 | _ -> assert false in
424 NReference.Ref (_,NReference.Fix (fixno',recno,_)) -> recno,fixno'
425 | NReference.Ref (_,NReference.CoFix (fixno')) -> ~-1,fixno'
426 | _ -> assert false in
427 if recno = recno' && fixno = fixno' && same_obj ref ref' (obj,obj') then (
429 prerr_endline ("!!!!!!!!!!! CACHE HIT !!!!!!!!!!\n" ^
430 NReference.string_of_reference ref ^ "\n" ^
431 NReference.string_of_reference ref' ^ "\n");
435 prerr_endline ("CACHE SAME NAME: " ^ NReference.string_of_reference ref ^ " <==> " ^ NReference.string_of_reference ref');
437 ) (Hashtbl.find_all cache name);
438 (* prerr_endline "<<< CACHE MISS >>>"; *)
441 | (_,_,_,_,NCic.Fixpoint (true,fl,_)) ,
442 NReference.Ref (_,NReference.Fix _) ->
443 ignore(List.fold_left (fun i (_,name,rno,_,_) ->
444 let ref = NReference.mk_fix i rno ref in
445 Hashtbl.add cache name (ref,obj);
448 | (_,_,_,_,NCic.Fixpoint (false,fl,_)) ,
449 NReference.Ref (_,NReference.CoFix _) ->
450 ignore(List.fold_left (fun i (_,name,_,_,_) ->
451 let ref = NReference.mk_cofix i ref in
452 Hashtbl.add cache name (ref,obj);
458 with Found ref -> Some ref
462 let cache = UriManager.UriHashtbl.create 313 in
465 UriManager.UriHashtbl.find cache u
470 match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph u) with
471 Cic.Constant (_,Some bo,ty,params,_)
472 | Cic.Variable (_,Some bo,ty,params,_) ->
473 ignore (height_of_term ~h bo);
474 ignore (height_of_term ~h ty);
475 List.iter (function uri -> h := max !h (get_height uri)) params;
479 UriManager.UriHashtbl.add cache u res;
481 and height_of_term ?(h=ref 0) t =
486 | Cic.Implicit _ -> assert false
487 | Cic.Var (uri,exp_named_subst)
488 | Cic.Const (uri,exp_named_subst)
489 | Cic.MutInd (uri,_,exp_named_subst)
490 | Cic.MutConstruct (uri,_,_,exp_named_subst) ->
491 h := max !h (get_height uri);
492 List.iter (function (_,t) -> aux t) exp_named_subst
493 | Cic.Meta (_,l) -> List.iter (function None -> () | Some t -> aux t) l
496 | Cic.Lambda (_,t1,t2) -> aux t1; aux t2
497 | Cic.LetIn (_,s,ty,t) -> aux s; aux ty; aux t
498 | Cic.Appl l -> List.iter aux l
499 | Cic.MutCase (_,_,outty,t,pl) -> aux outty; aux t; List.iter aux pl
500 | Cic.Fix (_, fl) -> List.iter (fun (_, _, ty, bo) -> aux ty; aux bo) fl; incr h
501 | Cic.CoFix (_, fl) -> List.iter (fun (_, ty, bo) -> aux ty; aux bo) fl; incr h
507 (* we are lambda-lifting also variables that do not occur *)
508 (* ctx does not distinguish successive blocks of cofix, since there may be no
509 * lambda separating them *)
510 let convert_term uri t =
511 (* k=true if we are converting a term to be pushed in a ctx or if we are
512 converting the type of a fix;
513 k=false if we are converting a term to be put in the body of a fix;
514 in the latter case, we must permute Rels since the Fix abstraction will
515 preceed its lefts parameters; in the former case, there is nothing to
517 let rec aux k octx (ctx : ctx list) n_fix uri = function
518 | Cic.CoFix _ as cofix ->
519 let octx,ctx,fix,rels = restrict octx ctx cofix in
521 match fix with Cic.CoFix (cofixno,fl)->cofixno,fl | _-> assert false in
523 UriManager.uri_of_string
524 (UriManager.buri_of_uri uri^"/"^
525 UriManager.name_of_uri uri ^ "___" ^ get_fresh () ^ ".con")
527 let bctx, fixpoints_tys, tys, _ =
529 (fun (name,ty,_) (bctx, fixpoints, tys, idx) ->
530 let ty, fixpoints_ty = aux true octx ctx n_fix uri ty in
531 let r = reference_of_ouri buri(Ref.CoFix idx) in
532 bctx @ [Fix (lazy (r,name,ty))],
533 fixpoints_ty @ fixpoints,ty::tys,idx-1)
534 fl ([], [], [], List.length fl-1)
536 let bctx = bctx @ ctx in
537 let n_fl = List.length fl in
540 (fun (types,len) (n,ty,_) ->
541 (Some (Cic.Name n,(Cic.Decl (CicSubstitution.lift len ty)))::types,
546 (fun (name,_,bo) ty (l,fixpoints) ->
547 let bo, fixpoints_bo = aux false boctx bctx n_fl buri bo in
548 let splty,fixpoints_splty = splat true ctx ty in
549 let splbo,fixpoints_splbo = splat false ctx bo in
550 (([],name,~-1,splty,splbo)::l),
551 fixpoints_bo @ fixpoints_splty @ fixpoints_splbo @ fixpoints)
552 fl tys ([],fixpoints_tys)
555 nuri_of_ouri buri,0,[],[],
556 NCic.Fixpoint (false, fl, (`Generated, `Definition))
558 let r = reference_of_ouri buri (Ref.CoFix cofixno) in
560 let _,name,_,_,_ = List.nth fl cofixno in
561 match find_in_cache name obj r with
565 splat_args ctx (NCic.Const r) n_fix rels, fixpoints @ obj
566 | Cic.Fix _ as fix ->
567 let octx,ctx,fix,rels = restrict octx ctx fix in
569 match fix with Cic.Fix (fixno,fl) -> fixno,fl | _ -> assert false in
571 UriManager.uri_of_string
572 (UriManager.buri_of_uri uri^"/"^
573 UriManager.name_of_uri uri ^ "___" ^ get_fresh () ^ ".con") in
574 let height = height_of_term fix - 1 in
575 let bad_bctx, fixpoints_tys, tys, _ =
577 (fun (name,recno,ty,_) (bctx, fixpoints, tys, idx) ->
578 let ty, fixpoints_ty = aux true octx ctx n_fix uri ty in
579 let r = (* recno is dummy here, must be lifted by the ctx len *)
580 reference_of_ouri buri (Ref.Fix (idx,recno,height))
582 bctx @ [Fix (lazy (r,name,ty))],
583 fixpoints_ty@fixpoints,ty::tys,idx-1)
584 fl ([], [], [], List.length fl-1)
586 let _, _, free_decls, _ = context_tassonomy (bad_bctx @ ctx) in
587 let free_decls = Lazy.force free_decls in
589 List.map (function ce -> match strictify ce with
590 | `Fix (Ref.Ref (_,Ref.Fix (idx, recno,height)),name, ty) ->
591 Fix (lazy (reference_of_ouri buri
592 (Ref.Fix (idx,recno+free_decls,height)),name,ty))
593 | _ -> assert false) bad_bctx @ ctx
595 let n_fl = List.length fl in
598 (fun (types,len) (n,_,ty,_) ->
599 (Some (Cic.Name n,(Cic.Decl (CicSubstitution.lift len ty)))::types,
602 let rno_fixno = ref 0 in
603 let fl, fixpoints,_ =
605 (fun (name,rno,oty,bo) ty (l,fixpoints,idx) ->
606 let bo, fixpoints_bo = aux false boctx bctx n_fl buri bo in
607 let splty,fixpoints_splty = splat true ctx ty in
608 let splbo,fixpoints_splbo = splat false ctx bo in
609 let rno = rno + free_decls in
610 if idx = fixno then rno_fixno := rno;
611 ((get_relevance (osplat true octx oty),name,rno,splty,splbo)::l),
612 fixpoints_bo@fixpoints_splty@fixpoints_splbo@fixpoints,idx+1)
613 fl tys ([],fixpoints_tys,0)
616 nuri_of_ouri buri,height,[],[],
617 NCic.Fixpoint (true, fl, (`Generated, `Definition)) in
618 (*prerr_endline ("H(" ^ UriManager.string_of_uri buri ^ ") = " ^ string_of_int * height);*)
619 let r = reference_of_ouri buri (Ref.Fix (fixno,!rno_fixno,height)) in
621 let _,name,_,_,_ = List.nth fl fixno in
622 match find_in_cache name obj r with
626 splat_args ctx (NCic.Const r) n_fix rels, fixpoints @ obj
628 let bound, _, _, primo_ce_dopo_fix = context_tassonomy ctx in
629 (match List.nth ctx (n-1) with
630 | Fix l when n < primo_ce_dopo_fix ->
631 let r,_,_ = Lazy.force l in
632 splat_args_for_rel ctx (NCic.Const r) n_fix, []
633 | Ce _ when n <= bound -> NCic.Rel n, []
634 | Fix _ when n <= bound -> assert false
635 | Fix _ | Ce _ when k = true -> NCic.Rel n, []
636 | Fix _ | Ce _ -> NCic.Rel (n-n_fix), [])
637 | Cic.Lambda (name, (s as old_s), t) ->
638 let s, fixpoints_s = aux k octx ctx n_fix uri s in
639 let s'_and_fixpoints_s' = lazy (aux true octx ctx n_fix uri old_s) in
642 let s',fixpoints_s' = Lazy.force s'_and_fixpoints_s' in
643 ((cn_to_s name, NCic.Decl s'),fixpoints_s'))::ctx in
644 let octx = Some (name, Cic.Decl old_s) :: octx in
645 let t, fixpoints_t = aux k octx ctx n_fix uri t in
646 NCic.Lambda (cn_to_s name, s, t), fixpoints_s @ fixpoints_t
647 | Cic.Prod (name, (s as old_s), t) ->
648 let s, fixpoints_s = aux k octx ctx n_fix uri s in
649 let s'_and_fixpoints_s' = lazy (aux true octx ctx n_fix uri old_s) in
652 let s',fixpoints_s' = Lazy.force s'_and_fixpoints_s' in
653 ((cn_to_s name, NCic.Decl s'),fixpoints_s'))::ctx in
654 let octx = Some (name, Cic.Decl old_s) :: octx in
655 let t, fixpoints_t = aux k octx ctx n_fix uri t in
656 NCic.Prod (cn_to_s name, s, t), fixpoints_s @ fixpoints_t
657 | Cic.LetIn (name, (te as old_te), (ty as old_ty), t) ->
658 let te, fixpoints_s = aux k octx ctx n_fix uri te in
659 let te_and_fixpoints_s' = lazy (aux true octx ctx n_fix uri old_te) in
660 let ty, fixpoints_ty = aux k octx ctx n_fix uri ty in
661 let ty_and_fixpoints_ty' = lazy (aux true octx ctx n_fix uri old_ty) in
664 let te',fixpoints_s' = Lazy.force te_and_fixpoints_s' in
665 let ty',fixpoints_ty' = Lazy.force ty_and_fixpoints_ty' in
666 let fixpoints' = fixpoints_s' @ fixpoints_ty' in
667 ((cn_to_s name, NCic.Def (te', ty')),fixpoints'))::ctx in
668 let octx = Some (name, Cic.Def (old_te, old_ty)) :: octx in
669 let t, fixpoints_t = aux k octx ctx n_fix uri t in
670 NCic.LetIn (cn_to_s name, ty, te, t),
671 fixpoints_s @ fixpoints_t @ fixpoints_ty
673 let t, fixpoints_t = aux k octx ctx n_fix uri t in
674 let ty, fixpoints_ty = aux k octx ctx n_fix uri ty in
675 NCic.LetIn ("cast", ty, t, NCic.Rel 1), fixpoints_t @ fixpoints_ty
676 | Cic.Sort Cic.Prop -> NCic.Sort NCic.Prop,[]
677 | Cic.Sort (Cic.CProp u) ->
678 NCic.Sort (NCic.Type (mk_cprop (CicUniv.get_rank u))),[]
679 | Cic.Sort (Cic.Type u) ->
680 NCic.Sort (NCic.Type (mk_type (CicUniv.get_rank u))),[]
681 | Cic.Sort Cic.Set -> NCic.Sort (NCic.Type (mk_type 0)),[]
682 (* calculate depth in the univ_graph*)
687 let t, fixpoints = aux k octx ctx n_fix uri t in
688 (t::l,fixpoints@acc))
692 | (NCic.Appl l1)::l2 -> NCic.Appl (l1@l2), fixpoints
693 | _ -> NCic.Appl l, fixpoints)
694 | Cic.Const (curi, ens) ->
695 aux_ens k curi octx ctx n_fix uri ens
696 (match fst(CicEnvironment.get_obj CicUniv.oblivion_ugraph curi) with
697 | Cic.Constant (_,Some _,_,_,_) ->
698 NCic.Const (reference_of_ouri curi (Ref.Def (get_height curi)))
699 | Cic.Constant (_,None,_,_,_) ->
700 NCic.Const (reference_of_ouri curi Ref.Decl)
702 | Cic.MutInd (curi, tyno, ens) ->
703 let is_inductive, lno =
704 match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph curi) with
705 Cic.InductiveDefinition ([],vars,lno,_) -> true, lno + count_vars vars
706 | Cic.InductiveDefinition ((_,b,_,_)::_,vars,lno,_) -> b, lno + count_vars vars
709 aux_ens k curi octx ctx n_fix uri ens
710 (NCic.Const (reference_of_ouri curi (Ref.Ind (is_inductive,tyno,lno))))
711 | Cic.MutConstruct (curi, tyno, consno, ens) ->
713 match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph curi) with
714 Cic.InductiveDefinition (_,vars,lno,_) -> lno + count_vars vars
717 aux_ens k curi octx ctx n_fix uri ens
718 (NCic.Const (reference_of_ouri curi (Ref.Con (tyno,consno,lno))))
719 | Cic.Var (curi, ens) ->
720 (match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph curi) with
721 Cic.Variable (_,Some bo,_,_,_) ->
722 aux k octx ctx n_fix uri (CicSubstitution.subst_vars ens bo)
724 | Cic.MutCase (curi, tyno, outty, t, branches) ->
725 let is_inductive,lno =
726 match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph curi) with
727 Cic.InductiveDefinition ([],vars,lno,_) -> true, lno + count_vars vars
728 | Cic.InductiveDefinition ((_,b,_,_)::_,vars,lno,_) -> b, lno + count_vars vars
729 | _ -> assert false in
730 let r = reference_of_ouri curi (Ref.Ind (is_inductive,tyno,lno)) in
731 let outty, fixpoints_outty = aux k octx ctx n_fix uri outty in
732 let t, fixpoints_t = aux k octx ctx n_fix uri t in
733 let branches, fixpoints =
736 let t, fixpoints = aux k octx ctx n_fix uri t in
737 (t::l,fixpoints@acc))
740 NCic.Match (r,outty,t,branches), fixpoints_outty@fixpoints_t@fixpoints
741 | Cic.Implicit _ | Cic.Meta _ -> assert false
742 and aux_ens k curi octx ctx n_fix uri ens he =
747 match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph curi) with
748 Cic.Constant (_,_,_,params,_)
749 | Cic.InductiveDefinition (_,params,_,_) -> params
751 | Cic.CurrentProof _ -> assert false
755 (fun luri (l,objs) ->
756 match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph luri) with
757 Cic.Variable (_,Some _,_,_,_) -> l, objs
758 | Cic.Variable (_,None,_,_,_) ->
759 let t = List.assoc luri ens in
760 let t,o = aux k octx ctx n_fix uri t in
767 | _::_ -> NCic.Appl (he::ens),objs
769 aux false [] [] 0 uri t
772 let cook mode vars t =
773 let t = fix_outtype t in
774 let varsno = List.length vars in
775 let t = CicSubstitution.lift varsno t in
776 let rec aux n acc l =
778 snd(List.fold_left (fun (i,res) uri -> i+1,(uri,Cic.Rel i)::res) (1,[]) acc)
781 [] -> CicSubstitution.subst_vars subst t
784 match fst (CicEnvironment.get_obj CicUniv.oblivion_ugraph uri) with
785 Cic.Variable (_,bo,ty,_,_) ->
786 HExtlib.map_option fix_outtype bo, fix_outtype ty
787 | _ -> assert false in
788 let ty = CicSubstitution.subst_vars subst ty in
789 let bo = HExtlib.map_option (CicSubstitution.subst_vars subst) bo in
790 let id = Cic.Name (UriManager.name_of_uri uri) in
791 let t = aux (n-1) (uri::acc) uris in
792 match bo,ty,mode with
793 None,ty,`Lambda -> Cic.Lambda (id,ty,t)
794 | None,ty,`Pi -> Cic.Prod (id,ty,t)
795 | Some bo,ty,_ -> Cic.LetIn (id,bo,ty,t)
800 let convert_obj_aux uri = function
801 | Cic.Constant (name, None, ty, vars, _) ->
802 let ty = cook `Pi vars ty in
803 let nty, fixpoints = convert_term uri ty in
804 assert(fixpoints = []);
805 NCic.Constant (get_relevance ty, name, None, nty, (`Provided,`Theorem,`Regular)),
807 | Cic.Constant (name, Some bo, ty, vars, _) ->
808 let bo = cook `Lambda vars bo in
809 let ty = cook `Pi vars ty in
810 let nbo, fixpoints_bo = convert_term uri bo in
811 let nty, fixpoints_ty = convert_term uri ty in
812 assert(fixpoints_ty = []);
813 NCic.Constant (get_relevance ty, name, Some nbo, nty, (`Provided,`Theorem,`Regular)),
814 fixpoints_bo @ fixpoints_ty
815 | Cic.InductiveDefinition (itl,vars,leftno,_) ->
816 let ind = let _,x,_,_ = List.hd itl in x in
819 (fun (name, _, ty, cl) (itl,acc) ->
820 let ty = cook `Pi vars ty in
821 let nty, fix_ty = convert_term uri ty in
824 (fun (name, ty) (cl,acc) ->
825 let ty = cook `Pi vars ty in
826 let nty, fix_ty = convert_term uri ty in
827 (get_relevance ty, name, nty)::cl, acc @ fix_ty)
830 (get_relevance ty, name, nty, cl)::itl, fix_ty @ fix_cl @ acc)
833 NCic.Inductive(ind, leftno + count_vars vars, itl, (`Provided, `Regular)),
836 | Cic.CurrentProof _ -> assert false
839 let convert_obj uri obj =
841 let o, fixpoints = convert_obj_aux uri obj in
842 let obj = nuri_of_ouri uri,get_height uri, [], [], o in
843 (*prerr_endline ("H(" ^ UriManager.string_of_uri uri ^ ") = " ^ string_of_int * (get_height uri));*)