1 (* Copyright (C) 2000, HELM Team.
3 * This file is part of HELM, an Hypertextual, Electronic
4 * Library of Mathematics, developed at the Computer Science
5 * Department, University of Bologna, Italy.
7 * HELM is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version 2
10 * of the License, or (at your option) any later version.
12 * HELM is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with HELM; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
22 * For details, see the HELM World-Wide-Web page,
23 * http://cs.unibo.it/helm/.
28 exception RefineFailure of string;;
29 exception Uncertain of string;;
30 exception AssertFailure of string;;
32 let debug_print = fun _ -> ()
34 let fo_unif_subst subst context metasenv t1 t2 ugraph =
36 CicUnification.fo_unif_subst subst context metasenv t1 t2 ugraph
38 (CicUnification.UnificationFailure msg) -> raise (RefineFailure msg)
39 | (CicUnification.Uncertain msg) -> raise (Uncertain msg)
45 | (he::tl, n) -> let (l1,l2) = split tl (n-1) in (he::l1,l2)
46 | (_,_) -> raise (AssertFailure "split: list too short")
49 let rec type_of_constant uri ugraph =
51 let module R = CicReduction in
52 let module U = UriManager in
56 CicEnvironment.get_cooked_obj uri
57 with Not_found -> assert false
60 let obj,u= CicEnvironment.get_obj ugraph uri in
62 C.Constant (_,_,ty,_,_) -> ty,u
63 | C.CurrentProof (_,_,_,ty,_,_) -> ty,u
66 (RefineFailure ("Unknown constant definition " ^ U.string_of_uri uri))
68 and type_of_variable uri ugraph =
70 let module R = CicReduction in
71 let module U = UriManager in
75 CicEnvironment.get_cooked_obj uri
76 with Not_found -> assert false
79 let obj,u = CicEnvironment.get_obj ugraph uri in
81 C.Variable (_,_,ty,_,_) -> ty,u
85 ("Unknown variable definition " ^ UriManager.string_of_uri uri))
87 and type_of_mutual_inductive_defs uri i ugraph =
89 let module R = CicReduction in
90 let module U = UriManager in
94 CicEnvironment.get_cooked_obj uri
95 with Not_found -> assert false
98 let obj,u = CicEnvironment.get_obj ugraph uri in
100 C.InductiveDefinition (dl,_,_,_) ->
101 let (_,_,arity,_) = List.nth dl i in
106 ("Unknown mutual inductive definition " ^ U.string_of_uri uri))
108 and type_of_mutual_inductive_constr uri i j ugraph =
109 let module C = Cic in
110 let module R = CicReduction in
111 let module U = UriManager in
115 CicEnvironment.get_cooked_obj uri
116 with Not_found -> assert false
119 let obj,u = CicEnvironment.get_obj ugraph uri in
121 C.InductiveDefinition (dl,_,_,_) ->
122 let (_,_,_,cl) = List.nth dl i in
123 let (_,ty) = List.nth cl (j-1) in
128 ("Unkown mutual inductive definition " ^ U.string_of_uri uri))
131 (* type_of_aux' is just another name (with a different scope) for type_of_aux *)
133 (* the check_branch function checks if a branch of a case is refinable.
134 It returns a pair (outype_instance,args), a subst and a metasenv.
135 outype_instance is the expected result of applying the case outtype
137 The problem is that outype is in general unknown, and we should
138 try to synthesize it from the above information, that is in general
139 a second order unification problem. *)
141 and check_branch n context metasenv subst left_args_no actualtype term expectedtype ugraph =
142 let module C = Cic in
143 (* let module R = CicMetaSubst in *)
144 let module R = CicReduction in
145 match R.whd ~subst context expectedtype with
147 (n,context,actualtype, [term]), subst, metasenv, ugraph
148 | C.Appl (C.MutInd (_,_,_)::tl) ->
149 let (_,arguments) = split tl left_args_no in
150 (n,context,actualtype, arguments@[term]), subst, metasenv, ugraph
151 | C.Prod (name,so,de) ->
152 (* we expect that the actual type of the branch has the due
154 (match R.whd ~subst context actualtype with
155 C.Prod (name',so',de') ->
156 let subst, metasenv, ugraph1 =
157 fo_unif_subst subst context metasenv so so' ugraph in
159 (match CicSubstitution.lift 1 term with
160 C.Appl l -> C.Appl (l@[C.Rel 1])
161 | t -> C.Appl [t ; C.Rel 1]) in
162 (* we should also check that the name variable is anonymous in
163 the actual type de' ?? *)
165 ((Some (name,(C.Decl so)))::context)
166 metasenv subst left_args_no de' term' de ugraph1
167 | _ -> raise (AssertFailure "Wrong number of arguments"))
168 | _ -> raise (AssertFailure "Prod or MutInd expected")
170 and type_of_aux' metasenv context t ugraph =
171 let rec type_of_aux subst metasenv context t ugraph =
172 let module C = Cic in
173 let module S = CicSubstitution in
174 let module U = UriManager in
179 match List.nth context (n - 1) with
180 Some (_,C.Decl ty) ->
181 t,S.lift n ty,subst,metasenv, ugraph
182 | Some (_,C.Def (_,Some ty)) ->
183 t,S.lift n ty,subst,metasenv, ugraph
184 | Some (_,C.Def (bo,None)) ->
185 type_of_aux subst metasenv context (S.lift n bo) ugraph
186 | None -> raise (RefineFailure "Rel to hidden hypothesis")
188 _ -> raise (RefineFailure "Not a close term")
190 | C.Var (uri,exp_named_subst) ->
191 let exp_named_subst',subst',metasenv',ugraph1 =
192 check_exp_named_subst
193 subst metasenv context exp_named_subst ugraph
195 let ty_uri,ugraph1 = type_of_variable uri ugraph in
197 CicSubstitution.subst_vars exp_named_subst' ty_uri
199 C.Var (uri,exp_named_subst'),ty,subst',metasenv',ugraph1
202 let (canonical_context, term,ty) =
203 CicUtil.lookup_subst n subst
205 let l',subst',metasenv',ugraph1 =
206 check_metasenv_consistency n subst metasenv context
207 canonical_context l ugraph
209 (* trust or check ??? *)
210 C.Meta (n,l'),CicSubstitution.subst_meta l' ty,
211 subst', metasenv', ugraph1
212 (* type_of_aux subst metasenv
213 context (CicSubstitution.subst_meta l term) *)
214 with CicUtil.Subst_not_found _ ->
215 let (_,canonical_context,ty) = CicUtil.lookup_meta n metasenv in
216 let l',subst',metasenv', ugraph1 =
217 check_metasenv_consistency n subst metasenv context
218 canonical_context l ugraph
220 C.Meta (n,l'),CicSubstitution.subst_meta l' ty,
221 subst', metasenv',ugraph1)
222 | C.Sort (C.Type tno) ->
223 let tno' = CicUniv.fresh() in
224 let ugraph1 = CicUniv.add_gt tno' tno ugraph in
225 t,(C.Sort (C.Type tno')),subst,metasenv,ugraph1
227 t,C.Sort (C.Type (CicUniv.fresh())),subst,metasenv,ugraph
228 | C.Implicit _ -> raise (AssertFailure "21")
230 let ty',_,subst',metasenv',ugraph1 =
231 type_of_aux subst metasenv context ty ugraph
233 let te',inferredty,subst'',metasenv'',ugraph2 =
234 type_of_aux subst' metasenv' context te ugraph1
237 let subst''',metasenv''',ugraph3 =
238 fo_unif_subst subst'' context metasenv''
239 inferredty ty ugraph2
241 C.Cast (te',ty'),ty',subst''',metasenv''',ugraph3
243 _ -> raise (RefineFailure "Cast"))
244 | C.Prod (name,s,t) ->
245 let s',sort1,subst',metasenv',ugraph1 =
246 type_of_aux subst metasenv context s ugraph
248 let t',sort2,subst'',metasenv'',ugraph2 =
249 type_of_aux subst' metasenv'
250 ((Some (name,(C.Decl s')))::context) t ugraph1
252 let sop,subst''',metasenv''',ugraph3 =
253 sort_of_prod subst'' metasenv''
254 context (name,s') (sort1,sort2) ugraph2
256 C.Prod (name,s',t'),sop,subst''',metasenv''',ugraph3
257 | C.Lambda (n,s,t) ->
258 let s',sort1,subst',metasenv',ugraph1 =
259 type_of_aux subst metasenv context s ugraph
261 (match CicReduction.whd ~subst:subst' context sort1 with
265 raise (RefineFailure (sprintf
266 "Not well-typed lambda-abstraction: the source %s should be a type;
267 instead it is a term of type %s" (CicPp.ppterm s)
268 (CicPp.ppterm sort1)))
270 let t',type2,subst'',metasenv'',ugraph2 =
271 type_of_aux subst' metasenv'
272 ((Some (n,(C.Decl s')))::context) t ugraph1
274 C.Lambda (n,s',t'),C.Prod (n,s',type2),
275 subst'',metasenv'',ugraph2
277 (* only to check if s is well-typed *)
278 let s',ty,subst',metasenv',ugraph1 =
279 type_of_aux subst metasenv context s ugraph
281 let t',inferredty,subst'',metasenv'',ugraph2 =
282 type_of_aux subst' metasenv'
283 ((Some (n,(C.Def (s',Some ty))))::context) t ugraph1
285 (* One-step LetIn reduction.
286 * Even faster than the previous solution.
287 * Moreover the inferred type is closer to the expected one.
289 C.LetIn (n,s',t'),CicSubstitution.subst s' inferredty,
290 subst',metasenv',ugraph2
291 | C.Appl (he::((_::_) as tl)) ->
292 let he',hetype,subst',metasenv',ugraph1 =
293 type_of_aux subst metasenv context he ugraph
295 let tlbody_and_type,subst'',metasenv'',ugraph2 =
297 (fun x (res,subst,metasenv,ugraph) ->
298 let x',ty,subst',metasenv',ugraph1 =
299 type_of_aux subst metasenv context x ugraph
301 (x', ty)::res,subst',metasenv',ugraph1
302 ) tl ([],subst',metasenv',ugraph1)
304 let tl',applty,subst''',metasenv''',ugraph3 =
305 eat_prods subst'' metasenv'' context
306 hetype tlbody_and_type ugraph2
308 C.Appl (he'::tl'), applty,subst''',metasenv''',ugraph3
309 | C.Appl _ -> raise (RefineFailure "Appl: no arguments")
310 | C.Const (uri,exp_named_subst) ->
311 let exp_named_subst',subst',metasenv',ugraph1 =
312 check_exp_named_subst subst metasenv context
313 exp_named_subst ugraph in
314 let ty_uri,ugraph2 = type_of_constant uri ugraph1 in
316 CicSubstitution.subst_vars exp_named_subst' ty_uri
318 C.Const (uri,exp_named_subst'),cty,subst',metasenv',ugraph2
319 | C.MutInd (uri,i,exp_named_subst) ->
320 let exp_named_subst',subst',metasenv',ugraph1 =
321 check_exp_named_subst subst metasenv context
322 exp_named_subst ugraph
324 let ty_uri,ugraph2 = type_of_mutual_inductive_defs uri i ugraph1 in
326 CicSubstitution.subst_vars exp_named_subst' ty_uri in
327 C.MutInd (uri,i,exp_named_subst'),cty,subst',metasenv',ugraph2
328 | C.MutConstruct (uri,i,j,exp_named_subst) ->
329 let exp_named_subst',subst',metasenv',ugraph1 =
330 check_exp_named_subst subst metasenv context
331 exp_named_subst ugraph
334 type_of_mutual_inductive_constr uri i j ugraph1
337 CicSubstitution.subst_vars exp_named_subst' ty_uri
339 C.MutConstruct (uri,i,j,exp_named_subst'),cty,subst',
341 | C.MutCase (uri, i, outtype, term, pl) ->
342 (* first, get the inductive type (and noparams)
343 * in the environment *)
344 let (_,b,arity,constructors), expl_params, no_left_params,ugraph =
345 let obj,u = CicEnvironment.get_obj ugraph uri in
347 C.InductiveDefinition (l,expl_params,parsno,_) ->
348 List.nth l i , expl_params, parsno, u
352 ("Unkown mutual inductive definition " ^
353 U.string_of_uri uri))
355 let rec count_prod t =
356 match CicReduction.whd ~subst context t with
357 C.Prod (_, _, t) -> 1 + (count_prod t)
360 let no_args = count_prod arity in
361 (* now, create a "generic" MutInd *)
362 let metasenv,left_args =
363 CicMkImplicit.n_fresh_metas metasenv subst context no_left_params
365 let metasenv,right_args =
366 let no_right_params = no_args - no_left_params in
367 if no_right_params < 0 then assert false
368 else CicMkImplicit.n_fresh_metas
369 metasenv subst context no_right_params
371 let metasenv,exp_named_subst =
372 CicMkImplicit.fresh_subst metasenv subst context expl_params in
375 C.MutInd (uri,i,exp_named_subst)
378 (C.MutInd (uri,i,exp_named_subst)::(left_args @ right_args))
380 (* check consistency with the actual type of term *)
381 let term',actual_type,subst,metasenv,ugraph1 =
382 type_of_aux subst metasenv context term ugraph in
383 let expected_type',_, subst, metasenv,ugraph2 =
384 type_of_aux subst metasenv context expected_type ugraph1
386 let actual_type = CicReduction.whd ~subst context actual_type in
387 let subst,metasenv,ugraph3 =
388 fo_unif_subst subst context metasenv
389 expected_type' actual_type ugraph2
391 let rec instantiate_prod t =
395 match CicReduction.whd ~subst context t with
397 instantiate_prod (CicSubstitution.subst he t') tl
400 let arity_instantiated_with_left_args =
401 instantiate_prod arity left_args in
402 (* TODO: check if the sort elimination
403 * is allowed: [(I q1 ... qr)|B] *)
404 let (pl',_,outtypeinstances,subst,metasenv,ugraph4) =
406 (fun (pl,j,outtypeinstances,subst,metasenv,ugraph) p ->
408 if left_args = [] then
409 (C.MutConstruct (uri,i,j,exp_named_subst))
412 (C.MutConstruct (uri,i,j,exp_named_subst)::left_args))
414 let p',actual_type,subst,metasenv,ugraph1 =
415 type_of_aux subst metasenv context p ugraph
417 let constructor',expected_type, subst, metasenv,ugraph2 =
418 type_of_aux subst metasenv context constructor ugraph1
420 let outtypeinstance,subst,metasenv,ugraph3 =
421 check_branch 0 context metasenv subst no_left_params
422 actual_type constructor' expected_type ugraph2
425 outtypeinstance::outtypeinstances,subst,metasenv,ugraph3))
426 ([],1,[],subst,metasenv,ugraph3) pl
429 (* we are left to check that the outype matches his instances.
430 The easy case is when the outype is specified, that amount
431 to a trivial check. Otherwise, we should guess a type from
437 (let candidate,ugraph5,metasenv =
438 let exp_name_subst, metasenv =
440 CicEnvironment.get_obj CicUniv.empty_ugraph uri
442 let uris = CicUtil.params_of_obj o in
444 fun uri (acc,metasenv) ->
445 let metasenv',new_meta =
446 CicMkImplicit.mk_implicit metasenv subst context
449 CicMkImplicit.identity_relocation_list_for_metavariable
452 (uri, Cic.Meta(new_meta,irl))::acc, metasenv'
456 match left_args,right_args with
457 [],[] -> Cic.MutInd(uri, i, exp_name_subst)
459 let rec mk_right_args =
462 | n -> (Cic.Rel n)::(mk_right_args (n - 1))
464 Cic.Appl (Cic.MutInd(uri,i,exp_name_subst)::
465 (left_args @ mk_right_args (List.length right_args)))
468 FreshNamesGenerator.mk_fresh_name ~subst metasenv
469 context Cic.Anonymous ~typ:ty
471 match outtypeinstances with
473 let extended_context =
474 let rec add_right_args b =
476 Cic.Prod (name,ty,t) ->
477 Some (name,Cic.Decl ty)::(add_right_args b t)
478 | _ -> (Some (fresh_name,Cic.Decl ty))::b
480 add_right_args context arity_instantiated_with_left_args
482 let metasenv,new_meta =
483 CicMkImplicit.mk_implicit metasenv subst extended_context
486 CicMkImplicit.identity_relocation_list_for_metavariable
489 let rec add_lambdas b =
491 Cic.Prod (name,ty,t) ->
492 Cic.Lambda (name,ty,(add_lambdas b t))
493 | _ -> Cic.Lambda (fresh_name, ty, b)
496 add_lambdas (Cic.Meta (new_meta,irl))
497 arity_instantiated_with_left_args
499 (Some candidate),ugraph4,metasenv
500 | (constructor_args_no,_,instance,_)::tl ->
503 CicSubstitution.delift constructor_args_no
504 (CicMetaSubst.apply_subst subst instance)
506 let candidate,ugraph,metasenv =
508 fun (candidate_oty,ugraph,metasenv)
509 (constructor_args_no,_,instance,_) ->
510 match candidate_oty with
511 | None -> None,ugraph,metasenv
515 CicSubstitution.delift
517 (CicMetaSubst.apply_subst subst instance)
520 CicReduction.are_convertible context
524 candidate_oty,ugraph1,metasenv
527 with Failure s -> None,ugraph,metasenv
528 ) (Some instance',ugraph4,metasenv) tl
531 | None -> None, ugraph,metasenv
533 let rec add_lambdas n b =
535 Cic.Prod (name,ty,t) ->
536 Cic.Lambda (name,ty,(add_lambdas (n + 1) b t))
538 Cic.Lambda (fresh_name, ty,
539 CicSubstitution.lift (n + 1) t)
542 (add_lambdas 0 t arity_instantiated_with_left_args),
545 None,ugraph4,metasenv
548 | None -> raise (Uncertain "can't solve an higher order unification problem")
551 fo_unif_subst subst context metasenv
552 candidate outtype ugraph5
554 C.MutCase (uri, i, outtype, term', pl'),
555 (Cic.Appl (outtype::right_args@[term'])),s,m,u)
556 | _ -> (* easy case *)
557 let _,_, subst, metasenv,ugraph5 =
558 type_of_aux subst metasenv context
559 (C.Appl ((outtype :: right_args) @ [term'])) ugraph4
561 let (subst,metasenv,ugraph6) =
563 (fun (subst,metasenv,ugraph)
564 (constructor_args_no,context,instance,args) ->
568 CicSubstitution.lift constructor_args_no outtype
570 C.Appl (outtype'::args)
572 CicReduction.whd ~subst context appl
574 fo_unif_subst subst context metasenv
575 instance instance' ugraph)
576 (subst,metasenv,ugraph5) outtypeinstances
578 C.MutCase (uri, i, outtype, term', pl'),
579 CicReduction.whd ~subst context
580 (C.Appl(outtype::right_args@[term])),
581 subst,metasenv,ugraph6)
583 let fl_ty',subst,metasenv,types,ugraph1 =
585 (fun (fl,subst,metasenv,types,ugraph) (n,_,ty,_) ->
586 let ty',_,subst',metasenv',ugraph1 =
587 type_of_aux subst metasenv context ty ugraph
589 fl @ [ty'],subst',metasenv',
590 Some (C.Name n,(C.Decl ty')) :: types, ugraph
591 ) ([],subst,metasenv,[],ugraph) fl
593 let len = List.length types in
594 let context' = types@context in
595 let fl_bo',subst,metasenv,ugraph2 =
597 (fun (fl,subst,metasenv,ugraph) (name,x,ty,bo) ->
598 let bo',ty_of_bo,subst,metasenv,ugraph1 =
599 type_of_aux subst metasenv context' bo ugraph
601 let subst',metasenv',ugraph' =
602 fo_unif_subst subst context' metasenv
603 ty_of_bo (CicSubstitution.lift len ty) ugraph1
605 fl @ [bo'] , subst',metasenv',ugraph'
606 ) ([],subst,metasenv,ugraph1) fl
608 let (_,_,ty,_) = List.nth fl i in
609 (* now we have the new ty in fl_ty', the new bo in fl_bo',
610 * and we want the new fl with bo' and ty' injected in the right
613 let rec map3 f l1 l2 l3 =
616 | h1::tl1,h2::tl2,h3::tl3 -> (f h1 h2 h3) :: (map3 f tl1 tl2 tl3)
619 let fl'' = map3 (fun ty' bo' (name,x,ty,bo) -> (name,x,ty',bo') )
622 C.Fix (i,fl''),ty,subst,metasenv,ugraph2
624 let fl_ty',subst,metasenv,types,ugraph1 =
626 (fun (fl,subst,metasenv,types,ugraph) (n,ty,_) ->
627 let ty',_,subst',metasenv',ugraph1 =
628 type_of_aux subst metasenv context ty ugraph
630 fl @ [ty'],subst',metasenv',
631 Some (C.Name n,(C.Decl ty')) :: types, ugraph1
632 ) ([],subst,metasenv,[],ugraph) fl
634 let len = List.length types in
635 let context' = types@context in
636 let fl_bo',subst,metasenv,ugraph2 =
638 (fun (fl,subst,metasenv,ugraph) (name,ty,bo) ->
639 let bo',ty_of_bo,subst,metasenv,ugraph1 =
640 type_of_aux subst metasenv context' bo ugraph
642 let subst',metasenv',ugraph' =
643 fo_unif_subst subst context' metasenv
644 ty_of_bo (CicSubstitution.lift len ty) ugraph1
646 fl @ [bo'],subst',metasenv',ugraph'
647 ) ([],subst,metasenv,ugraph1) fl
649 let (_,ty,_) = List.nth fl i in
650 (* now we have the new ty in fl_ty', the new bo in fl_bo',
651 * and we want the new fl with bo' and ty' injected in the right
654 let rec map3 f l1 l2 l3 =
657 | h1::tl1,h2::tl2,h3::tl3 -> (f h1 h2 h3) :: (map3 f tl1 tl2 tl3)
660 let fl'' = map3 (fun ty' bo' (name,ty,bo) -> (name,ty',bo') )
663 C.CoFix (i,fl''),ty,subst,metasenv,ugraph2
665 (* check_metasenv_consistency checks that the "canonical" context of a
666 metavariable is consitent - up to relocation via the relocation list l -
667 with the actual context *)
668 and check_metasenv_consistency
669 metano subst metasenv context canonical_context l ugraph
671 let module C = Cic in
672 let module R = CicReduction in
673 let module S = CicSubstitution in
674 let lifted_canonical_context =
678 | (Some (n,C.Decl t))::tl ->
679 (Some (n,C.Decl (S.subst_meta l (S.lift i t))))::(aux (i+1) tl)
680 | (Some (n,C.Def (t,None)))::tl ->
681 (Some (n,C.Def ((S.subst_meta l (S.lift i t)),None)))::(aux (i+1) tl)
682 | None::tl -> None::(aux (i+1) tl)
683 | (Some (n,C.Def (t,Some ty)))::tl ->
685 C.Def ((S.subst_meta l (S.lift i t)),
686 Some (S.subst_meta l (S.lift i ty))))) :: (aux (i+1) tl)
688 aux 1 canonical_context
692 (fun (l,subst,metasenv,ugraph) t ct ->
695 l @ [None],subst,metasenv,ugraph
696 | Some t,Some (_,C.Def (ct,_)) ->
697 let subst',metasenv',ugraph' =
699 fo_unif_subst subst context metasenv t ct ugraph
700 with e -> raise (RefineFailure (sprintf "The local context is not consistent with the canonical context, since %s cannot be unified with %s. Reason: %s" (CicMetaSubst.ppterm subst t) (CicMetaSubst.ppterm subst ct) (match e with AssertFailure msg -> msg | _ -> (Printexc.to_string e)))))
702 l @ [Some t],subst',metasenv',ugraph'
703 | Some t,Some (_,C.Decl ct) ->
704 let t',inferredty,subst',metasenv',ugraph1 =
705 type_of_aux subst metasenv context t ugraph
707 let subst'',metasenv'',ugraph2 =
710 subst' context metasenv' inferredty ct ugraph1
711 with e -> raise (RefineFailure (sprintf "The local context is not consistent with the canonical context, since the type %s of %s cannot be unified with the expected type %s. Reason: %s" (CicMetaSubst.ppterm subst' inferredty) (CicMetaSubst.ppterm subst' t) (CicMetaSubst.ppterm subst' ct) (match e with AssertFailure msg -> msg | _ -> (Printexc.to_string e)))))
713 l @ [Some t'], subst'',metasenv'',ugraph2
715 raise (RefineFailure (sprintf
716 "Not well typed metavariable instance %s: the local context does not instantiate an hypothesis even if the hypothesis is not restricted in the canonical context %s"
717 (CicMetaSubst.ppterm subst (Cic.Meta (metano, l)))
718 (CicMetaSubst.ppcontext subst canonical_context)))
719 ) ([],subst,metasenv,ugraph) l lifted_canonical_context
721 Invalid_argument _ ->
725 "Not well typed metavariable instance %s: the length of the local context does not match the length of the canonical context %s"
726 (CicMetaSubst.ppterm subst (Cic.Meta (metano, l)))
727 (CicMetaSubst.ppcontext subst canonical_context)))
729 and check_exp_named_subst metasubst metasenv context tl ugraph =
730 let rec check_exp_named_subst_aux metasubst metasenv substs tl ugraph =
732 [] -> [],metasubst,metasenv,ugraph
733 | ((uri,t) as subst)::tl ->
734 let ty_uri,ugraph1 = type_of_variable uri ugraph in
736 CicSubstitution.subst_vars substs ty_uri in
737 (* CSC: why was this code here? it is wrong
738 (match CicEnvironment.get_cooked_obj ~trust:false uri with
739 Cic.Variable (_,Some bo,_,_) ->
742 "A variable with a body can not be explicit substituted")
743 | Cic.Variable (_,None,_,_) -> ()
747 ("Unkown variable definition " ^ UriManager.string_of_uri uri))
750 let t',typeoft,metasubst',metasenv',ugraph2 =
751 type_of_aux metasubst metasenv context t ugraph1
753 let metasubst'',metasenv'',ugraph3 =
756 metasubst' context metasenv' typeoft typeofvar ugraph2
759 ("Wrong Explicit Named Substitution: " ^
760 CicMetaSubst.ppterm metasubst' typeoft ^
761 " not unifiable with " ^
762 CicMetaSubst.ppterm metasubst' typeofvar))
764 (* FIXME: no mere tail recursive! *)
765 let exp_name_subst, metasubst''', metasenv''', ugraph4 =
766 check_exp_named_subst_aux
767 metasubst'' metasenv'' (substs@[subst]) tl ugraph3
769 ((uri,t')::exp_name_subst), metasubst''', metasenv''', ugraph4
771 check_exp_named_subst_aux metasubst metasenv [] tl ugraph
774 and sort_of_prod subst metasenv context (name,s) (t1, t2) ugraph =
775 let module C = Cic in
776 let context_for_t2 = (Some (name,C.Decl s))::context in
777 let t1'' = CicReduction.whd ~subst context t1 in
778 let t2'' = CicReduction.whd ~subst context_for_t2 t2 in
779 match (t1'', t2'') with
780 (C.Sort s1, C.Sort s2)
781 when (s2 = C.Prop or s2 = C.Set or s2 = C.CProp) -> (* different than Coq manual!!! *)
782 C.Sort s2,subst,metasenv,ugraph
783 | (C.Sort (C.Type t1), C.Sort (C.Type t2)) ->
784 (* TASSI: CONSRTAINTS: the same in cictypechecker, doubletypeinference *)
785 let t' = CicUniv.fresh() in
786 let ugraph1 = CicUniv.add_ge t' t1 ugraph in
787 let ugraph2 = CicUniv.add_ge t' t2 ugraph1 in
788 C.Sort (C.Type t'),subst,metasenv,ugraph2
789 | (C.Sort _,C.Sort (C.Type t1)) ->
790 (* TASSI: CONSRTAINTS: the same in cictypechecker, doubletypeinference *)
791 C.Sort (C.Type t1),subst,metasenv,ugraph
792 | (C.Meta _, C.Sort _) -> t2'',subst,metasenv,ugraph
793 | (C.Sort _,C.Meta _) | (C.Meta _,C.Meta _) ->
794 (* TODO how can we force the meta to become a sort? If we don't we
795 * brake the invariant that refine produce only well typed terms *)
796 (* TODO if we check the non meta term and if it is a sort then we are
797 * likely to know the exact value of the result e.g. if the rhs is a
798 * Sort (Prop | Set | CProp) then the result is the rhs *)
800 CicMkImplicit.mk_implicit_sort metasenv subst in
801 let (subst, metasenv,ugraph1) =
802 fo_unif_subst subst context_for_t2 metasenv (C.Meta (idx,[])) t2'' ugraph
804 t2'',subst,metasenv,ugraph1
806 raise (RefineFailure (sprintf
807 "Two sorts were expected, found %s (that reduces to %s) and %s (that reduces to %s)"
808 (CicPp.ppterm t1) (CicPp.ppterm t1'') (CicPp.ppterm t2)
809 (CicPp.ppterm t2'')))
811 and eat_prods subst metasenv context hetype tlbody_and_type ugraph =
812 let rec mk_prod metasenv context =
815 let (metasenv, idx) =
816 CicMkImplicit.mk_implicit_type metasenv subst context
819 CicMkImplicit.identity_relocation_list_for_metavariable context
821 metasenv,Cic.Meta (idx, irl)
823 let (metasenv, idx) =
824 CicMkImplicit.mk_implicit_type metasenv subst context
827 CicMkImplicit.identity_relocation_list_for_metavariable context
829 let meta = Cic.Meta (idx,irl) in
831 (* The name must be fresh for context. *)
832 (* Nevertheless, argty is well-typed only in context. *)
833 (* Thus I generate a name (name_hint) in context and *)
834 (* then I generate a name --- using the hint name_hint *)
835 (* --- that is fresh in (context'@context). *)
837 (* Cic.Name "pippo" *)
838 FreshNamesGenerator.mk_fresh_name ~subst metasenv
839 (* (CicMetaSubst.apply_subst_metasenv subst metasenv) *)
840 (CicMetaSubst.apply_subst_context subst context)
842 ~typ:(CicMetaSubst.apply_subst subst argty)
844 (* [] and (Cic.Sort Cic.prop) are dummy: they will not be used *)
845 FreshNamesGenerator.mk_fresh_name ~subst
846 [] context name_hint ~typ:(Cic.Sort Cic.Prop)
848 let metasenv,target =
849 mk_prod metasenv ((Some (name, Cic.Decl meta))::context) tl
851 metasenv,Cic.Prod (name,meta,target)
853 let metasenv,hetype' = mk_prod metasenv context tlbody_and_type in
854 let (subst, metasenv,ugraph1) =
856 fo_unif_subst subst context metasenv hetype hetype' ugraph
858 debug_print (Printf.sprintf "hetype=%s\nhetype'=%s\nmetasenv=%s\nsubst=%s"
859 (CicPp.ppterm hetype)
860 (CicPp.ppterm hetype')
861 (CicMetaSubst.ppmetasenv metasenv [])
862 (CicMetaSubst.ppsubst subst));
866 let rec eat_prods metasenv subst context hetype ugraph =
868 | [] -> [],metasenv,subst,hetype,ugraph
869 | (hete, hety)::tl ->
872 let arg,subst,metasenv,ugraph1 =
874 let subst,metasenv,ugraph1 =
875 fo_unif_subst subst context metasenv hety s ugraph
877 hete,subst,metasenv,ugraph1
879 (* we search a coercion from hety to s *)
880 let coer = CoercGraph.look_for_coercion
881 (CicMetaSubst.apply_subst subst hety)
882 (CicMetaSubst.apply_subst subst s)
887 (Cic.Appl [ c ; hete ]), subst, metasenv, ugraph
889 let coerced_args,metasenv',subst',t',ugraph2 =
890 eat_prods metasenv subst context
891 (* (CicMetaSubst.subst subst hete t) tl *)
892 (CicSubstitution.subst hete t) ugraph1 tl
894 arg::coerced_args,metasenv',subst',t',ugraph2
898 let coerced_args,metasenv,subst,t,ugraph2 =
899 eat_prods metasenv subst context hetype' ugraph1 tlbody_and_type
901 coerced_args,t,subst,metasenv,ugraph2
904 (* eat prods ends here! *)
906 let t',ty,subst',metasenv',ugraph1 =
907 type_of_aux [] metasenv context t ugraph
909 let substituted_t = CicMetaSubst.apply_subst subst' t' in
910 let substituted_ty = CicMetaSubst.apply_subst subst' ty in
911 (* Andrea: ho rimesso qui l'applicazione della subst al
912 metasenv dopo che ho droppato l'invariante che il metsaenv
913 e' sempre istanziato *)
914 let substituted_metasenv =
915 CicMetaSubst.apply_subst_metasenv subst' metasenv' in
917 (* substituted_t,substituted_ty,substituted_metasenv *)
918 (* ANDREA: spostare tutta questa robaccia da un altra parte *)
920 FreshNamesGenerator.clean_dummy_dependent_types substituted_t in
922 FreshNamesGenerator.clean_dummy_dependent_types substituted_ty in
923 let cleaned_metasenv =
925 (function (n,context,ty) ->
926 let ty' = FreshNamesGenerator.clean_dummy_dependent_types ty in
931 | Some (n, Cic.Decl t) ->
933 Cic.Decl (FreshNamesGenerator.clean_dummy_dependent_types t))
934 | Some (n, Cic.Def (bo,ty)) ->
935 let bo' = FreshNamesGenerator.clean_dummy_dependent_types bo in
940 Some (FreshNamesGenerator.clean_dummy_dependent_types ty)
942 Some (n, Cic.Def (bo',ty'))
946 ) substituted_metasenv
948 (cleaned_t,cleaned_ty,cleaned_metasenv,ugraph1)
951 let type_of_aux' metasenv context term ugraph =
953 type_of_aux' metasenv context term ugraph
955 CicUniv.UniverseInconsistency msg -> raise (RefineFailure msg)
959 let type_of_aux' metasenv context term =
962 type_of_aux' metasenv context term in
964 ("@@@ REFINE SUCCESSFUL: " ^ CicPp.ppterm t ^ " : " ^ CicPp.ppterm ty);
966 ("@@@ REFINE SUCCESSFUL (metasenv):\n" ^ CicMetaSubst.ppmetasenv ~sep:";" m []);
969 | RefineFailure msg as e ->
970 debug_print ("@@@ REFINE FAILED: " ^ msg);
972 | Uncertain msg as e ->
973 debug_print ("@@@ REFINE UNCERTAIN: " ^ msg);