1 (* Copyright (C) 2003, HELM Team.
4 * This file is part of HELM, an Hypertextual, Electronic
5 * Library of Mathematics, developed at the Computer Science
6 * Department, University of Bologna, Italy.
8 * HELM is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU General Public License
10 * as published by the Free Software Foundation; either version 2
11 * of the License, or (at your option) any later version.
13 * HELM is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public License
19 * along with HELM; if not, write to the Free Software
20 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
23 * For details, see the HELM World-Wide-Web page,
24 * http://cs.unibo.it/helm/.
33 let deref_counter = ref 0
34 let apply_subst_context_counter = ref 0
35 let apply_subst_metasenv_counter = ref 0
36 let lift_counter = ref 0
37 let subst_counter = ref 0
38 let whd_counter = ref 0
39 let are_convertible_counter = ref 0
40 let metasenv_length = ref 0
41 let context_length = ref 0
42 let reset_counters () =
43 apply_subst_counter := 0;
44 apply_subst_context_counter := 0;
45 apply_subst_metasenv_counter := 0;
49 are_convertible_counter := 0;
52 let print_counters () =
53 debug_print (lazy (Printf.sprintf
55 apply_subst_context: %d
56 apply_subst_metasenv: %d
61 metasenv length: %d (avg = %.2f)
62 context length: %d (avg = %.2f)
64 !apply_subst_counter !apply_subst_context_counter
65 !apply_subst_metasenv_counter !lift_counter !subst_counter !whd_counter
66 !are_convertible_counter !metasenv_length
67 ((float !metasenv_length) /. (float !apply_subst_metasenv_counter))
69 ((float !context_length) /. (float !apply_subst_context_counter))
74 exception MetaSubstFailure of string Lazy.t
75 exception Uncertain of string Lazy.t
76 exception AssertFailure of string Lazy.t
77 exception DeliftingARelWouldCaptureAFreeVariable;;
79 let debug_print = fun _ -> ()
81 type substitution = (int * (Cic.context * Cic.term)) list
85 let third _,_,a = a in
90 (CicSubstitution.subst_meta
91 l (third (CicUtil.lookup_subst n subst)))
93 CicUtil.Subst_not_found _ -> t)
98 let lookup_subst = CicUtil.lookup_subst
101 (* clean_up_meta take a metasenv and a term and make every local context
102 of each occurrence of a metavariable consistent with its canonical context,
103 with respect to the hidden hipothesis *)
106 let clean_up_meta subst metasenv t =
107 let module C = Cic in
112 | C.Implicit _ -> assert false
113 | C.Meta (n,l) as t ->
116 let (cc,_) = lookup_subst n subst in cc
117 with CicUtil.Subst_not_found _ ->
119 let (_,cc,_) = CicUtil.lookup_meta n metasenv in cc
120 with CicUtil.Meta_not_found _ -> assert false) in
129 Invalid_argument _ -> assert false) in
131 | C.Cast (te,ty) -> C.Cast (aux te, aux ty)
132 | C.Prod (name,so,dest) -> C.Prod (name, aux so, aux dest)
133 | C.Lambda (name,so,dest) -> C.Lambda (name, aux so, aux dest)
134 | C.LetIn (name,so,dest) -> C.LetIn (name, aux so, aux dest)
135 | C.Appl l -> C.Appl (List.map aux l)
136 | C.Var (uri,exp_named_subst) ->
137 let exp_named_subst' =
138 List.map (fun (uri,t) -> (uri, aux t)) exp_named_subst
140 C.Var (uri, exp_named_subst')
141 | C.Const (uri, exp_named_subst) ->
142 let exp_named_subst' =
143 List.map (fun (uri,t) -> (uri, aux t)) exp_named_subst
145 C.Const (uri, exp_named_subst')
146 | C.MutInd (uri,tyno,exp_named_subst) ->
147 let exp_named_subst' =
148 List.map (fun (uri,t) -> (uri, aux t)) exp_named_subst
150 C.MutInd (uri, tyno, exp_named_subst')
151 | C.MutConstruct (uri,tyno,consno,exp_named_subst) ->
152 let exp_named_subst' =
153 List.map (fun (uri,t) -> (uri, aux t)) exp_named_subst
155 C.MutConstruct (uri, tyno, consno, exp_named_subst')
156 | C.MutCase (uri,tyno,out,te,pl) ->
157 C.MutCase (uri, tyno, aux out, aux te, List.map aux pl)
161 (fun (name,j,ty,bo) -> (name, j, aux ty, aux bo)) fl
167 (fun (name,ty,bo) -> (name, aux ty, aux bo)) fl
173 (*** Functions to apply a substitution ***)
175 let apply_subst_gen ~appl_fun subst term =
177 let module C = Cic in
178 let module S = CicSubstitution in
181 | C.Var (uri,exp_named_subst) ->
182 let exp_named_subst' =
183 List.map (fun (uri, t) -> (uri, um_aux t)) exp_named_subst
185 C.Var (uri, exp_named_subst')
188 let (_, t,_) = lookup_subst i subst in
189 um_aux (S.subst_meta l t)
190 with CicUtil.Subst_not_found _ ->
191 (* unconstrained variable, i.e. free in subst*)
193 List.map (function None -> None | Some t -> Some (um_aux t)) l
197 | C.Implicit _ as t -> t
198 | C.Cast (te,ty) -> C.Cast (um_aux te, um_aux ty)
199 | C.Prod (n,s,t) -> C.Prod (n, um_aux s, um_aux t)
200 | C.Lambda (n,s,t) -> C.Lambda (n, um_aux s, um_aux t)
201 | C.LetIn (n,s,t) -> C.LetIn (n, um_aux s, um_aux t)
202 | C.Appl (hd :: tl) -> appl_fun um_aux hd tl
203 | C.Appl _ -> assert false
204 | C.Const (uri,exp_named_subst) ->
205 let exp_named_subst' =
206 List.map (fun (uri, t) -> (uri, um_aux t)) exp_named_subst
208 C.Const (uri, exp_named_subst')
209 | C.MutInd (uri,typeno,exp_named_subst) ->
210 let exp_named_subst' =
211 List.map (fun (uri, t) -> (uri, um_aux t)) exp_named_subst
213 C.MutInd (uri,typeno,exp_named_subst')
214 | C.MutConstruct (uri,typeno,consno,exp_named_subst) ->
215 let exp_named_subst' =
216 List.map (fun (uri, t) -> (uri, um_aux t)) exp_named_subst
218 C.MutConstruct (uri,typeno,consno,exp_named_subst')
219 | C.MutCase (sp,i,outty,t,pl) ->
220 let pl' = List.map um_aux pl in
221 C.MutCase (sp, i, um_aux outty, um_aux t, pl')
224 List.map (fun (name, i, ty, bo) -> (name, i, um_aux ty, um_aux bo)) fl
229 List.map (fun (name, ty, bo) -> (name, um_aux ty, um_aux bo)) fl
237 let appl_fun um_aux he tl =
238 let tl' = List.map um_aux tl in
241 Cic.Appl l -> Cic.Appl (l@tl')
242 | he' -> Cic.Appl (he'::tl')
246 Cic.Meta (m,_) -> CicReduction.head_beta_reduce t'
251 (* incr apply_subst_counter; *)
252 apply_subst_gen ~appl_fun s t
255 let profiler = HExtlib.profile "U/CicMetaSubst.apply_subst"
256 let apply_subst s t =
257 profiler.HExtlib.profile (apply_subst s) t
260 let rec apply_subst_context subst context =
262 incr apply_subst_context_counter;
263 context_length := !context_length + List.length context;
268 | Some (n, Cic.Decl t) ->
269 let t' = apply_subst subst t in
270 Some (n, Cic.Decl t') :: context
271 | Some (n, Cic.Def (t, ty)) ->
275 | Some ty -> Some (apply_subst subst ty)
277 let t' = apply_subst subst t in
278 Some (n, Cic.Def (t', ty')) :: context
279 | None -> None :: context)
282 let apply_subst_metasenv subst metasenv =
284 incr apply_subst_metasenv_counter;
285 metasenv_length := !metasenv_length + List.length metasenv;
288 (fun (n, context, ty) ->
289 (n, apply_subst_context subst context, apply_subst subst ty))
291 (fun (i, _, _) -> not (List.mem_assoc i subst))
294 (***** Pretty printing functions ******)
296 let ppterm subst term = CicPp.ppterm (apply_subst subst term)
298 let ppterm_in_name_context subst term name_context =
299 CicPp.pp (apply_subst subst term) name_context
301 let ppterm_in_context subst term context =
303 List.map (function None -> None | Some (n,_) -> Some n) context
305 ppterm_in_name_context subst term name_context
307 let ppcontext' ?(sep = "\n") subst context =
308 let separate s = if s = "" then "" else s ^ sep in
310 (fun context_entry (i,name_context) ->
311 match context_entry with
312 Some (n,Cic.Decl t) ->
313 sprintf "%s%s : %s" (separate i) (CicPp.ppname n)
314 (ppterm_in_name_context subst t name_context), (Some n)::name_context
315 | Some (n,Cic.Def (bo,ty)) ->
316 sprintf "%s%s : %s := %s" (separate i) (CicPp.ppname n)
319 | Some ty -> ppterm_in_name_context subst ty name_context)
320 (ppterm_in_name_context subst bo name_context), (Some n)::name_context
322 sprintf "%s_ :? _" (separate i), None::name_context
325 let ppsubst_unfolded subst =
328 (fun (idx, (c, t,_)) ->
329 let context,name_context = ppcontext' ~sep:"; " subst c in
330 sprintf "%s |- ?%d:= %s" context idx
331 (ppterm_in_name_context subst t name_context))
334 Printf.sprintf "?%d := %s" idx (CicPp.ppterm term))
341 (fun (idx, (c, t, _)) ->
342 let context,name_context = ppcontext' ~sep:"; " [] c in
343 sprintf "%s |- ?%d:= %s" context idx
344 (ppterm_in_name_context [] t name_context))
348 let ppcontext ?sep subst context = fst (ppcontext' ?sep subst context)
350 let ppmetasenv ?(sep = "\n") subst metasenv =
354 let context,name_context = ppcontext' ~sep:"; " subst c in
355 sprintf "%s |- ?%d: %s" context i
356 (ppterm_in_name_context subst t name_context))
358 (fun (i, _, _) -> not (List.mem_assoc i subst))
361 let tempi_type_of_aux_subst = ref 0.0;;
362 let tempi_subst = ref 0.0;;
363 let tempi_type_of_aux = ref 0.0;;
366 (* the delift function takes in input a metavariable index, an ordered list of
367 * optional terms [t1,...,tn] and a term t, and substitutes every tk = Some
368 * (rel(nk)) with rel(k). Typically, the list of optional terms is the explicit
369 * substitution that is applied to a metavariable occurrence and the result of
370 * the delift function is a term the implicit variable can be substituted with
371 * to make the term [t] unifiable with the metavariable occurrence. In general,
372 * the problem is undecidable if we consider equivalence in place of alpha
373 * convertibility. Our implementation, though, is even weaker than alpha
374 * convertibility, since it replace the term [tk] if and only if [tk] is a Rel
375 * (missing all the other cases). Does this matter in practice?
376 * The metavariable index is the index of the metavariable that must not occur
377 * in the term (for occur check).
380 exception NotInTheList;;
385 [] -> raise NotInTheList
386 | (Some (Cic.Rel m))::_ when m=n -> k
387 | _::tl -> aux (k+1) tl in
393 let rec force_does_not_occur subst to_be_restricted t =
394 let module C = Cic in
395 let more_to_be_restricted = ref [] in
396 let rec aux k = function
397 C.Rel r when List.mem (r - k) to_be_restricted -> raise Occur
400 | C.Implicit _ -> assert false
402 (* we do not retrieve the term associated to ?n in subst since *)
403 (* in this way we can restrict if something goes wrong *)
415 more_to_be_restricted := (n,!i) :: !more_to_be_restricted;
420 | C.Cast (te,ty) -> C.Cast (aux k te, aux k ty)
421 | C.Prod (name,so,dest) -> C.Prod (name, aux k so, aux (k+1) dest)
422 | C.Lambda (name,so,dest) -> C.Lambda (name, aux k so, aux (k+1) dest)
423 | C.LetIn (name,so,dest) -> C.LetIn (name, aux k so, aux (k+1) dest)
424 | C.Appl l -> C.Appl (List.map (aux k) l)
425 | C.Var (uri,exp_named_subst) ->
426 let exp_named_subst' =
427 List.map (fun (uri,t) -> (uri, aux k t)) exp_named_subst
429 C.Var (uri, exp_named_subst')
430 | C.Const (uri, exp_named_subst) ->
431 let exp_named_subst' =
432 List.map (fun (uri,t) -> (uri, aux k t)) exp_named_subst
434 C.Const (uri, exp_named_subst')
435 | C.MutInd (uri,tyno,exp_named_subst) ->
436 let exp_named_subst' =
437 List.map (fun (uri,t) -> (uri, aux k t)) exp_named_subst
439 C.MutInd (uri, tyno, exp_named_subst')
440 | C.MutConstruct (uri,tyno,consno,exp_named_subst) ->
441 let exp_named_subst' =
442 List.map (fun (uri,t) -> (uri, aux k t)) exp_named_subst
444 C.MutConstruct (uri, tyno, consno, exp_named_subst')
445 | C.MutCase (uri,tyno,out,te,pl) ->
446 C.MutCase (uri, tyno, aux k out, aux k te, List.map (aux k) pl)
448 let len = List.length fl in
449 let k_plus_len = k + len in
452 (fun (name,j,ty,bo) -> (name, j, aux k ty, aux k_plus_len bo)) fl
456 let len = List.length fl in
457 let k_plus_len = k + len in
460 (fun (name,ty,bo) -> (name, aux k ty, aux k_plus_len bo)) fl
465 (!more_to_be_restricted, res)
467 let rec restrict subst to_be_restricted metasenv =
468 let names_of_context_indexes context indexes =
473 match List.nth context (i-1) with
474 | None -> assert false
475 | Some (n, _) -> CicPp.ppname n
477 Failure _ -> assert false
480 let force_does_not_occur_in_context to_be_restricted = function
482 | Some (name, Cic.Decl t) ->
483 let (more_to_be_restricted, t') =
484 force_does_not_occur subst to_be_restricted t
486 more_to_be_restricted, Some (name, Cic.Decl t')
487 | Some (name, Cic.Def (bo, ty)) ->
488 let (more_to_be_restricted, bo') =
489 force_does_not_occur subst to_be_restricted bo
491 let more_to_be_restricted, ty' =
493 | None -> more_to_be_restricted, None
495 let more_to_be_restricted', ty' =
496 force_does_not_occur subst to_be_restricted ty
498 more_to_be_restricted @ more_to_be_restricted',
501 more_to_be_restricted, Some (name, Cic.Def (bo', ty'))
503 let rec erase i to_be_restricted n = function
504 | [] -> [], to_be_restricted, []
506 let more_to_be_restricted,restricted,tl' =
507 erase (i+1) to_be_restricted n tl
509 let restrict_me = List.mem i restricted in
511 more_to_be_restricted, restricted, None:: tl'
514 let more_to_be_restricted', hd' =
515 let delifted_restricted =
519 | j::tl when j > i -> (j - i)::aux tl
524 force_does_not_occur_in_context delifted_restricted hd
526 more_to_be_restricted @ more_to_be_restricted',
527 restricted, hd' :: tl'
529 more_to_be_restricted, (i :: restricted), None :: tl')
531 let (more_to_be_restricted, metasenv) = (* restrict metasenv *)
533 (fun (n, context, t) (more, metasenv) ->
534 let to_be_restricted =
535 List.map snd (List.filter (fun (m, _) -> m = n) to_be_restricted)
537 let (more_to_be_restricted, restricted, context') =
538 (* just an optimization *)
539 if to_be_restricted = [] then
542 erase 1 to_be_restricted n context
545 let more_to_be_restricted', t' =
546 force_does_not_occur subst restricted t
548 let metasenv' = (n, context', t') :: metasenv in
549 (more @ more_to_be_restricted @ more_to_be_restricted',
552 raise (MetaSubstFailure (lazy (sprintf
553 "Cannot restrict the context of the metavariable ?%d over the hypotheses %s since metavariable's type depends on at least one of them"
554 n (names_of_context_indexes context to_be_restricted)))))
557 let (more_to_be_restricted', subst) = (* restrict subst *)
559 (* TODO: cambiare dopo l'aggiunta del ty *)
560 (fun (n, (context, term,ty)) (more, subst') ->
561 let to_be_restricted =
562 List.map snd (List.filter (fun (m, _) -> m = n) to_be_restricted)
565 let (more_to_be_restricted, restricted, context') =
566 (* just an optimization *)
567 if to_be_restricted = [] then
570 erase 1 to_be_restricted n context
572 let more_to_be_restricted', term' =
573 force_does_not_occur subst restricted term
575 let more_to_be_restricted'', ty' =
576 force_does_not_occur subst restricted ty in
577 let subst' = (n, (context', term',ty')) :: subst' in
579 more @ more_to_be_restricted
580 @ more_to_be_restricted'@more_to_be_restricted'' in
583 let error_msg = lazy (sprintf
584 "Cannot restrict the context of the metavariable ?%d over the hypotheses %s since ?%d is already instantiated with %s and at least one of the hypotheses occurs in the substituted term"
585 n (names_of_context_indexes context to_be_restricted) n
589 debug_print (lazy error_msg);
590 debug_print (lazy ("metasenv = \n" ^ (ppmetasenv metasenv subst)));
591 debug_print (lazy ("subst = \n" ^ (ppsubst subst)));
592 debug_print (lazy ("context = \n" ^ (ppcontext subst context))); *)
593 raise (MetaSubstFailure error_msg)))
596 match more_to_be_restricted @ more_to_be_restricted' with
597 | [] -> (metasenv, subst)
598 | l -> restrict subst l metasenv
601 (*CSC: maybe we should rename delift in abstract, as I did in my dissertation *)(*Andrea: maybe not*)
603 let delift n subst context metasenv l t =
604 (* INVARIANT: we suppose that t is not another occurrence of Meta(n,_),
605 otherwise the occur check does not make sense *)
608 debug_print (lazy ("sto deliftando il termine " ^ (CicPp.ppterm t) ^ " rispetto
609 al contesto locale " ^ (CicPp.ppterm (Cic.Meta(0,l)))));
612 let module S = CicSubstitution in
614 let (_, canonical_context, _) = CicUtil.lookup_meta n metasenv in
615 List.map2 (fun ct lt ->
621 let to_be_restricted = ref [] in
622 let rec deliftaux k =
623 let module C = Cic in
630 match List.nth context (m-k-1) with
631 Some (_,C.Def (t,_)) ->
632 (*CSC: Hmmm. This bit of reduction is not in the spirit of *)
633 (*CSC: first order unification. Does it help or does it harm? *)
634 (*CSC: ANSWER: it hurts performances since it is possible to *)
635 (*CSC: have an exponential explosion of the size of the proof.*)
636 (*CSC: However, without this bit of reduction some "apply" in *)
637 (*CSC: the library fail (e.g. nat/nth_prime.ma). *)
638 deliftaux k (S.lift m t)
639 | Some (_,C.Decl t) ->
640 C.Rel ((position (m-k) l) + k)
641 | None -> raise (MetaSubstFailure (lazy "RelToHiddenHypothesis"))
644 raise (MetaSubstFailure (lazy "Unbound variable found in deliftaux"))
646 | C.Var (uri,exp_named_subst) ->
647 let exp_named_subst' =
648 List.map (function (uri,t) -> uri,deliftaux k t) exp_named_subst
650 C.Var (uri,exp_named_subst')
651 | C.Meta (i, l1) as t ->
653 let (_,t,_) = CicUtil.lookup_subst i subst in
654 deliftaux k (CicSubstitution.subst_meta l1 t)
655 with CicUtil.Subst_not_found _ ->
656 (* see the top level invariant *)
658 raise (MetaSubstFailure (lazy (sprintf
659 "Cannot unify the metavariable ?%d with a term that has as subterm %s in which the same metavariable occurs (occur check)"
660 i (ppterm subst t))))
663 (* I do not consider the term associated to ?i in subst since *)
664 (* in this way I can restrict if something goes wrong. *)
668 | None::tl -> None::(deliftl (j+1) tl)
670 let l1' = (deliftl (j+1) tl) in
672 Some (deliftaux k t)::l1'
675 | MetaSubstFailure _ ->
677 (i,j)::!to_be_restricted ; None::l1'
679 let l' = deliftl 1 l1 in
683 | C.Implicit _ as t -> t
684 | C.Cast (te,ty) -> C.Cast (deliftaux k te, deliftaux k ty)
685 | C.Prod (n,s,t) -> C.Prod (n, deliftaux k s, deliftaux (k+1) t)
686 | C.Lambda (n,s,t) -> C.Lambda (n, deliftaux k s, deliftaux (k+1) t)
687 | C.LetIn (n,s,t) -> C.LetIn (n, deliftaux k s, deliftaux (k+1) t)
688 | C.Appl l -> C.Appl (List.map (deliftaux k) l)
689 | C.Const (uri,exp_named_subst) ->
690 let exp_named_subst' =
691 List.map (function (uri,t) -> uri,deliftaux k t) exp_named_subst
693 C.Const (uri,exp_named_subst')
694 | C.MutInd (uri,typeno,exp_named_subst) ->
695 let exp_named_subst' =
696 List.map (function (uri,t) -> uri,deliftaux k t) exp_named_subst
698 C.MutInd (uri,typeno,exp_named_subst')
699 | C.MutConstruct (uri,typeno,consno,exp_named_subst) ->
700 let exp_named_subst' =
701 List.map (function (uri,t) -> uri,deliftaux k t) exp_named_subst
703 C.MutConstruct (uri,typeno,consno,exp_named_subst')
704 | C.MutCase (sp,i,outty,t,pl) ->
705 C.MutCase (sp, i, deliftaux k outty, deliftaux k t,
706 List.map (deliftaux k) pl)
708 let len = List.length fl in
711 (fun (name, i, ty, bo) ->
712 (name, i, deliftaux k ty, deliftaux (k+len) bo))
717 let len = List.length fl in
720 (fun (name, ty, bo) -> (name, deliftaux k ty, deliftaux (k+len) bo))
723 C.CoFix (i, liftedfl)
730 (* This is the case where we fail even first order unification. *)
731 (* The reason is that our delift function is weaker than first *)
732 (* order (in the sense of alpha-conversion). See comment above *)
733 (* related to the delift function. *)
734 (* debug_print (lazy "First Order UnificationFailure during delift") ;
735 debug_print(lazy (sprintf
736 "Error trying to abstract %s over [%s]: the algorithm only tried to abstract over bound variables"
740 (function Some t -> ppterm subst t | None -> "_") l
742 let msg = (lazy (sprintf
743 "Error trying to abstract %s over [%s]: the algorithm only tried to abstract over bound variables"
747 (function Some t -> ppterm subst t | None -> "_")
753 Some t -> CicUtil.is_meta_closed (apply_subst subst t)
756 raise (Uncertain msg)
758 raise (MetaSubstFailure msg)
760 let (metasenv, subst) = restrict subst !to_be_restricted metasenv in
764 (* delifts a term t of n levels strating from k, that is changes (Rel m)
765 * to (Rel (m - n)) when m > (k + n). if k <= m < k + n delift fails
767 let delift_rels_from subst metasenv k n =
768 let rec liftaux subst metasenv k =
769 let module C = Cic in
773 C.Rel m, subst, metasenv
774 else if m < k + n then
775 raise DeliftingARelWouldCaptureAFreeVariable
777 C.Rel (m - n), subst, metasenv
778 | C.Var (uri,exp_named_subst) ->
779 let exp_named_subst',subst,metasenv =
781 (fun (uri,t) (l,subst,metasenv) ->
782 let t',subst,metasenv = liftaux subst metasenv k t in
783 (uri,t')::l,subst,metasenv) exp_named_subst ([],subst,metasenv)
785 C.Var (uri,exp_named_subst'),subst,metasenv
788 let (_, t,_) = lookup_subst i subst in
789 liftaux subst metasenv k (CicSubstitution.subst_meta l t)
790 with CicUtil.Subst_not_found _ ->
791 let l',to_be_restricted,subst,metasenv =
792 let rec aux con l subst metasenv =
794 [] -> [],[],subst,metasenv
796 let tl',to_be_restricted,subst,metasenv =
797 aux (con + 1) tl subst metasenv in
798 let he',more_to_be_restricted,subst,metasenv =
800 None -> None,[],subst,metasenv
803 let t',subst,metasenv = liftaux subst metasenv k t in
804 Some t',[],subst,metasenv
806 DeliftingARelWouldCaptureAFreeVariable ->
807 None,[i,con],subst,metasenv
809 he'::tl',more_to_be_restricted@to_be_restricted,subst,metasenv
811 aux 1 l subst metasenv in
812 let metasenv,subst = restrict subst to_be_restricted metasenv in
813 C.Meta(i,l'),subst,metasenv)
814 | C.Sort _ as t -> t,subst,metasenv
815 | C.Implicit _ as t -> t,subst,metasenv
817 let te',subst,metasenv = liftaux subst metasenv k te in
818 let ty',subst,metasenv = liftaux subst metasenv k ty in
819 C.Cast (te',ty'),subst,metasenv
821 let s',subst,metasenv = liftaux subst metasenv k s in
822 let t',subst,metasenv = liftaux subst metasenv (k+1) t in
823 C.Prod (n,s',t'),subst,metasenv
824 | C.Lambda (n,s,t) ->
825 let s',subst,metasenv = liftaux subst metasenv k s in
826 let t',subst,metasenv = liftaux subst metasenv (k+1) t in
827 C.Lambda (n,s',t'),subst,metasenv
829 let s',subst,metasenv = liftaux subst metasenv k s in
830 let t',subst,metasenv = liftaux subst metasenv (k+1) t in
831 C.LetIn (n,s',t'),subst,metasenv
833 let l',subst,metasenv =
835 (fun t (l,subst,metasenv) ->
836 let t',subst,metasenv = liftaux subst metasenv k t in
837 t'::l,subst,metasenv) l ([],subst,metasenv) in
838 C.Appl l',subst,metasenv
839 | C.Const (uri,exp_named_subst) ->
840 let exp_named_subst',subst,metasenv =
842 (fun (uri,t) (l,subst,metasenv) ->
843 let t',subst,metasenv = liftaux subst metasenv k t in
844 (uri,t')::l,subst,metasenv) exp_named_subst ([],subst,metasenv)
846 C.Const (uri,exp_named_subst'),subst,metasenv
847 | C.MutInd (uri,tyno,exp_named_subst) ->
848 let exp_named_subst',subst,metasenv =
850 (fun (uri,t) (l,subst,metasenv) ->
851 let t',subst,metasenv = liftaux subst metasenv k t in
852 (uri,t')::l,subst,metasenv) exp_named_subst ([],subst,metasenv)
854 C.MutInd (uri,tyno,exp_named_subst'),subst,metasenv
855 | C.MutConstruct (uri,tyno,consno,exp_named_subst) ->
856 let exp_named_subst',subst,metasenv =
858 (fun (uri,t) (l,subst,metasenv) ->
859 let t',subst,metasenv = liftaux subst metasenv k t in
860 (uri,t')::l,subst,metasenv) exp_named_subst ([],subst,metasenv)
862 C.MutConstruct (uri,tyno,consno,exp_named_subst'),subst,metasenv
863 | C.MutCase (sp,i,outty,t,pl) ->
864 let outty',subst,metasenv = liftaux subst metasenv k outty in
865 let t',subst,metasenv = liftaux subst metasenv k t in
866 let pl',subst,metasenv =
868 (fun t (l,subst,metasenv) ->
869 let t',subst,metasenv = liftaux subst metasenv k t in
870 t'::l,subst,metasenv) pl ([],subst,metasenv)
872 C.MutCase (sp,i,outty',t',pl'),subst,metasenv
874 let len = List.length fl in
875 let liftedfl,subst,metasenv =
877 (fun (name, i, ty, bo) (l,subst,metasenv) ->
878 let ty',subst,metasenv = liftaux subst metasenv k ty in
879 let bo',subst,metasenv = liftaux subst metasenv (k+len) bo in
880 (name,i,ty',bo')::l,subst,metasenv
881 ) fl ([],subst,metasenv)
883 C.Fix (i, liftedfl),subst,metasenv
885 let len = List.length fl in
886 let liftedfl,subst,metasenv =
888 (fun (name, ty, bo) (l,subst,metasenv) ->
889 let ty',subst,metasenv = liftaux subst metasenv k ty in
890 let bo',subst,metasenv = liftaux subst metasenv (k+len) bo in
891 (name,ty',bo')::l,subst,metasenv
892 ) fl ([],subst,metasenv)
894 C.CoFix (i, liftedfl),subst,metasenv
896 liftaux subst metasenv k
898 let delift_rels subst metasenv n t =
899 delift_rels_from subst metasenv 1 n t
902 (**** END OF DELIFT ****)
905 (** {2 Format-like pretty printers} *)
908 Format.pp_print_string ppf s;
909 Format.pp_print_newline ppf ();
910 Format.pp_print_flush ppf ()
912 let fppsubst ppf subst = fpp_gen ppf (ppsubst subst)
913 let fppterm ppf term = fpp_gen ppf (CicPp.ppterm term)
914 let fppmetasenv ppf metasenv = fpp_gen ppf (ppmetasenv [] metasenv)