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_______________________________________________________________ *)
12 (* $Id: nCicReduction.ml 8250 2008-03-25 17:56:20Z tassi $ *)
14 exception TypeCheckerFailure of string Lazy.t
15 exception AssertFailure of string Lazy.t
17 (* $Id: cicTypeChecker.ml 8213 2008-03-13 18:48:26Z sacerdot $ *)
20 let debrujin_constructor ?(cb=fun _ _ -> ()) uri number_of_types =
25 C.Rel n as t when n <= k -> t
27 raise (TypeCheckerFailure (lazy "unbound variable found in constructor type"))
28 | C.Var (uri,exp_named_subst) ->
29 let exp_named_subst' =
30 List.map (function (uri,t) -> (uri,aux k t)) exp_named_subst
32 C.Var (uri,exp_named_subst')
34 let l' = List.map (function None -> None | Some t -> Some (aux k t)) l in
37 | C.Implicit _ as t -> t
38 | C.Cast (te,ty) -> C.Cast (aux k te, aux k ty)
39 | C.Prod (n,s,t) -> C.Prod (n, aux k s, aux (k+1) t)
40 | C.Lambda (n,s,t) -> C.Lambda (n, aux k s, aux (k+1) t)
41 | C.LetIn (n,s,ty,t) -> C.LetIn (n, aux k s, aux k ty, aux (k+1) t)
42 | C.Appl l -> C.Appl (List.map (aux k) l)
43 | C.Const (uri,exp_named_subst) ->
44 let exp_named_subst' =
45 List.map (function (uri,t) -> (uri,aux k t)) exp_named_subst
47 C.Const (uri,exp_named_subst')
48 | C.MutInd (uri',tyno,exp_named_subst) when UriManager.eq uri uri' ->
49 if exp_named_subst != [] then
50 raise (TypeCheckerFailure
51 (lazy ("non-empty explicit named substitution is applied to "^
52 "a mutual inductive type which is being defined"))) ;
53 C.Rel (k + number_of_types - tyno) ;
54 | C.MutInd (uri',tyno,exp_named_subst) ->
55 let exp_named_subst' =
56 List.map (function (uri,t) -> (uri,aux k t)) exp_named_subst
58 C.MutInd (uri',tyno,exp_named_subst')
59 | C.MutConstruct (uri,tyno,consno,exp_named_subst) ->
60 let exp_named_subst' =
61 List.map (function (uri,t) -> (uri,aux k t)) exp_named_subst
63 C.MutConstruct (uri,tyno,consno,exp_named_subst')
64 | C.MutCase (sp,i,outty,t,pl) ->
65 C.MutCase (sp, i, aux k outty, aux k t,
68 let len = List.length fl in
71 (fun (name, i, ty, bo) -> (name, i, aux k ty, aux (k+len) bo))
76 let len = List.length fl in
79 (fun (name, ty, bo) -> (name, aux k ty, aux (k+len) bo))
90 exception CicEnvironmentError;;
92 let rec type_of_constant ~logger uri ugraph =
94 let module R = CicReduction in
95 let module U = UriManager in
97 match CicEnvironment.is_type_checked ~trust:true ugraph uri with
98 CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
99 | CicEnvironment.UncheckedObj uobj ->
100 logger#log (`Start_type_checking uri) ;
101 (* let's typecheck the uncooked obj *)
103 (****************************************************************
104 TASSI: FIXME qui e' inutile ricordarselo,
105 tanto poi lo richiediamo alla cache che da quello su disco
106 *****************************************************************)
110 C.Constant (_,Some te,ty,_,_) ->
111 let _,ugraph = type_of ~logger ty ugraph in
112 let type_of_te,ugraph' = type_of ~logger te ugraph in
113 let b',ugraph'' = (R.are_convertible [] type_of_te ty ugraph') in
115 raise (TypeCheckerFailure (lazy (sprintf
116 "the constant %s is not well typed because the type %s of the body is not convertible to the declared type %s"
117 (U.string_of_uri uri) (CicPp.ppterm type_of_te)
121 | C.Constant (_,None,ty,_,_) ->
122 (* only to check that ty is well-typed *)
123 let _,ugraph' = type_of ~logger ty ugraph in
125 | C.CurrentProof (_,conjs,te,ty,_,_) ->
128 (fun (metasenv,ugraph) ((_,context,ty) as conj) ->
130 type_of_aux' ~logger metasenv context ty ugraph
132 (metasenv @ [conj],ugraph')
135 let _,ugraph2 = type_of_aux' ~logger conjs [] ty ugraph1 in
136 let type_of_te,ugraph3 =
137 type_of_aux' ~logger conjs [] te ugraph2
139 let b,ugraph4 = (R.are_convertible [] type_of_te ty ugraph3) in
141 raise (TypeCheckerFailure (lazy (sprintf
142 "the current proof %s is not well typed because the type %s of the body is not convertible to the declared type %s"
143 (U.string_of_uri uri) (CicPp.ppterm type_of_te)
149 (TypeCheckerFailure (lazy ("Unknown constant:" ^ U.string_of_uri uri))))
152 CicEnvironment.set_type_checking_info uri;
153 logger#log (`Type_checking_completed uri) ;
154 match CicEnvironment.is_type_checked ~trust:false ugraph uri with
155 CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
156 | CicEnvironment.UncheckedObj _ -> raise CicEnvironmentError
157 with Invalid_argument s ->
158 (*debug_print (lazy s);*)
161 match cobj,ugraph with
162 (C.Constant (_,_,ty,_,_)),g -> ty,g
163 | (C.CurrentProof (_,_,_,ty,_,_)),g -> ty,g
165 raise (TypeCheckerFailure (lazy ("Unknown constant:" ^ U.string_of_uri uri)))
167 and type_of_variable ~logger uri ugraph =
168 let module C = Cic in
169 let module R = CicReduction in
170 let module U = UriManager in
171 (* 0 because a variable is never cooked => no partial cooking at one level *)
172 match CicEnvironment.is_type_checked ~trust:true ugraph uri with
173 CicEnvironment.CheckedObj ((C.Variable (_,_,ty,_,_)),ugraph') -> ty,ugraph'
174 | CicEnvironment.UncheckedObj (C.Variable (_,bo,ty,_,_)) ->
175 logger#log (`Start_type_checking uri) ;
176 (* only to check that ty is well-typed *)
177 let _,ugraph1 = type_of ~logger ty ugraph in
182 let ty_bo,ugraph' = type_of ~logger bo ugraph1 in
183 let b,ugraph'' = (R.are_convertible [] ty_bo ty ugraph') in
185 raise (TypeCheckerFailure
186 (lazy ("Unknown variable:" ^ U.string_of_uri uri)))
191 CicEnvironment.set_type_checking_info uri ;
192 logger#log (`Type_checking_completed uri) ;
193 match CicEnvironment.is_type_checked ~trust:false ugraph uri with
194 CicEnvironment.CheckedObj ((C.Variable (_,_,ty,_,_)),ugraph') ->
196 | CicEnvironment.CheckedObj _
197 | CicEnvironment.UncheckedObj _ -> raise CicEnvironmentError
198 with Invalid_argument s ->
199 (*debug_print (lazy s);*)
202 raise (TypeCheckerFailure (lazy ("Unknown variable:" ^ U.string_of_uri uri)))
204 and does_not_occur ?(subst=[]) context n nn te =
205 let module C = Cic in
207 C.Rel m when m > n && m <= nn -> false
210 (match List.nth context (m-1) with
211 Some (_,C.Def (bo,_)) ->
212 does_not_occur ~subst context n nn (CicSubstitution.lift m bo)
215 Failure _ -> assert false)
217 | C.Implicit _ -> true
223 | Some x -> i && does_not_occur ~subst context n nn x) l true &&
225 let (canonical_context,term,ty) = CicUtil.lookup_subst n subst in
226 does_not_occur ~subst context n nn (CicSubstitution.subst_meta l term)
228 CicUtil.Subst_not_found _ -> true)
230 does_not_occur ~subst context n nn te && does_not_occur ~subst context n nn ty
231 | C.Prod (name,so,dest) ->
232 does_not_occur ~subst context n nn so &&
233 does_not_occur ~subst ((Some (name,(C.Decl so)))::context) (n + 1)
235 | C.Lambda (name,so,dest) ->
236 does_not_occur ~subst context n nn so &&
237 does_not_occur ~subst ((Some (name,(C.Decl so)))::context) (n + 1) (nn + 1)
239 | C.LetIn (name,so,ty,dest) ->
240 does_not_occur ~subst context n nn so &&
241 does_not_occur ~subst context n nn ty &&
242 does_not_occur ~subst ((Some (name,(C.Def (so,ty))))::context)
243 (n + 1) (nn + 1) dest
245 List.fold_right (fun x i -> i && does_not_occur ~subst context n nn x) l true
246 | C.Var (_,exp_named_subst)
247 | C.Const (_,exp_named_subst)
248 | C.MutInd (_,_,exp_named_subst)
249 | C.MutConstruct (_,_,_,exp_named_subst) ->
250 List.fold_right (fun (_,x) i -> i && does_not_occur ~subst context n nn x)
252 | C.MutCase (_,_,out,te,pl) ->
253 does_not_occur ~subst context n nn out && does_not_occur ~subst context n nn te &&
254 List.fold_right (fun x i -> i && does_not_occur ~subst context n nn x) pl true
256 let len = List.length fl in
257 let n_plus_len = n + len in
258 let nn_plus_len = nn + len in
261 (fun (types,len) (n,_,ty,_) ->
262 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
267 (fun (_,_,ty,bo) i ->
268 i && does_not_occur ~subst context n nn ty &&
269 does_not_occur ~subst (tys @ context) n_plus_len nn_plus_len bo
272 let len = List.length fl in
273 let n_plus_len = n + len in
274 let nn_plus_len = nn + len in
277 (fun (types,len) (n,ty,_) ->
278 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
284 i && does_not_occur ~subst context n nn ty &&
285 does_not_occur ~subst (tys @ context) n_plus_len nn_plus_len bo
288 (*CSC l'indice x dei tipi induttivi e' t.c. n < x <= nn *)
289 (*CSC questa funzione e' simile alla are_all_occurrences_positive, ma fa *)
290 (*CSC dei controlli leggermente diversi. Viene invocata solamente dalla *)
291 (*CSC strictly_positive *)
292 (*CSC definizione (giusta???) tratta dalla mail di Hugo ;-) *)
293 and weakly_positive context n nn uri te =
294 let module C = Cic in
295 (*CSC: Che schifo! Bisogna capire meglio e trovare una soluzione ragionevole!*)
297 C.MutInd (HelmLibraryObjects.Datatypes.nat_URI,0,[])
299 (*CSC: mettere in cicSubstitution *)
300 let rec subst_inductive_type_with_dummy_mutind =
302 C.MutInd (uri',0,_) when UriManager.eq uri' uri ->
304 | C.Appl ((C.MutInd (uri',0,_))::tl) when UriManager.eq uri' uri ->
306 | C.Cast (te,ty) -> subst_inductive_type_with_dummy_mutind te
307 | C.Prod (name,so,ta) ->
308 C.Prod (name, subst_inductive_type_with_dummy_mutind so,
309 subst_inductive_type_with_dummy_mutind ta)
310 | C.Lambda (name,so,ta) ->
311 C.Lambda (name, subst_inductive_type_with_dummy_mutind so,
312 subst_inductive_type_with_dummy_mutind ta)
314 C.Appl (List.map subst_inductive_type_with_dummy_mutind tl)
315 | C.MutCase (uri,i,outtype,term,pl) ->
317 subst_inductive_type_with_dummy_mutind outtype,
318 subst_inductive_type_with_dummy_mutind term,
319 List.map subst_inductive_type_with_dummy_mutind pl)
321 C.Fix (i,List.map (fun (name,i,ty,bo) -> (name,i,
322 subst_inductive_type_with_dummy_mutind ty,
323 subst_inductive_type_with_dummy_mutind bo)) fl)
325 C.CoFix (i,List.map (fun (name,ty,bo) -> (name,
326 subst_inductive_type_with_dummy_mutind ty,
327 subst_inductive_type_with_dummy_mutind bo)) fl)
328 | C.Const (uri,exp_named_subst) ->
329 let exp_named_subst' =
331 (function (uri,t) -> (uri,subst_inductive_type_with_dummy_mutind t))
334 C.Const (uri,exp_named_subst')
335 | C.MutInd (uri,typeno,exp_named_subst) ->
336 let exp_named_subst' =
338 (function (uri,t) -> (uri,subst_inductive_type_with_dummy_mutind t))
341 C.MutInd (uri,typeno,exp_named_subst')
342 | C.MutConstruct (uri,typeno,consno,exp_named_subst) ->
343 let exp_named_subst' =
345 (function (uri,t) -> (uri,subst_inductive_type_with_dummy_mutind t))
348 C.MutConstruct (uri,typeno,consno,exp_named_subst')
351 match CicReduction.whd context te with
353 C.Appl ((C.MutInd (uri',0,_))::tl) when UriManager.eq uri' uri -> true
355 C.Appl ((C.MutInd (uri',_,_))::tl) when UriManager.eq uri' uri -> true
356 | C.MutInd (uri',0,_) when UriManager.eq uri' uri -> true
357 | C.Prod (C.Anonymous,source,dest) ->
358 strictly_positive context n nn
359 (subst_inductive_type_with_dummy_mutind source) &&
360 weakly_positive ((Some (C.Anonymous,(C.Decl source)))::context)
361 (n + 1) (nn + 1) uri dest
362 | C.Prod (name,source,dest) when
363 does_not_occur ((Some (name,(C.Decl source)))::context) 0 n dest ->
364 (* dummy abstraction, so we behave as in the anonimous case *)
365 strictly_positive context n nn
366 (subst_inductive_type_with_dummy_mutind source) &&
367 weakly_positive ((Some (name,(C.Decl source)))::context)
368 (n + 1) (nn + 1) uri dest
369 | C.Prod (name,source,dest) ->
370 does_not_occur context n nn
371 (subst_inductive_type_with_dummy_mutind source)&&
372 weakly_positive ((Some (name,(C.Decl source)))::context)
373 (n + 1) (nn + 1) uri dest
375 raise (TypeCheckerFailure (lazy "Malformed inductive constructor type"))
377 (* instantiate_parameters ps (x1:T1)...(xn:Tn)C *)
378 (* returns ((x_|ps|:T_|ps|)...(xn:Tn)C){ps_1 / x1 ; ... ; ps_|ps| / x_|ps|} *)
379 and instantiate_parameters params c =
380 let module C = Cic in
381 match (c,params) with
383 | (C.Prod (_,_,ta), he::tl) ->
384 instantiate_parameters tl
385 (CicSubstitution.subst he ta)
386 | (C.Cast (te,_), _) -> instantiate_parameters params te
387 | (t,l) -> raise (AssertFailure (lazy "1"))
389 and strictly_positive context n nn te =
390 let module C = Cic in
391 let module U = UriManager in
392 match CicReduction.whd context te with
393 | t when does_not_occur context n nn t -> true
396 (*CSC: bisogna controllare ty????*)
397 strictly_positive context n nn te
398 | C.Prod (name,so,ta) ->
399 does_not_occur context n nn so &&
400 strictly_positive ((Some (name,(C.Decl so)))::context) (n+1) (nn+1) ta
401 | C.Appl ((C.Rel m)::tl) when m > n && m <= nn ->
402 List.fold_right (fun x i -> i && does_not_occur context n nn x) tl true
403 | C.Appl ((C.MutInd (uri,i,exp_named_subst))::tl) ->
404 let (ok,paramsno,ity,cl,name) =
405 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
407 C.InductiveDefinition (tl,_,paramsno,_) ->
408 let (name,_,ity,cl) = List.nth tl i in
409 (List.length tl = 1, paramsno, ity, cl, name)
410 (* (true, paramsno, ity, cl, name) *)
414 (lazy ("Unknown inductive type:" ^ U.string_of_uri uri)))
416 let (params,arguments) = split tl paramsno in
417 let lifted_params = List.map (CicSubstitution.lift 1) params in
421 instantiate_parameters lifted_params
422 (CicSubstitution.subst_vars exp_named_subst te)
427 (fun x i -> i && does_not_occur context n nn x)
429 (*CSC: MEGAPATCH3 (sara' quella giusta?)*)
434 ((Some (C.Name name,(Cic.Decl ity)))::context) (n+1) (nn+1) uri
439 (* the inductive type indexes are s.t. n < x <= nn *)
440 and are_all_occurrences_positive context uri indparamsno i n nn te =
441 let module C = Cic in
442 match CicReduction.whd context te with
443 C.Appl ((C.Rel m)::tl) when m = i ->
444 (*CSC: riscrivere fermandosi a 0 *)
445 (* let's check if the inductive type is applied at least to *)
446 (* indparamsno parameters *)
452 match CicReduction.whd context x with
453 C.Rel m when m = n - (indparamsno - k) -> k - 1
455 raise (TypeCheckerFailure
457 ("Non-positive occurence in mutual inductive definition(s) [1]" ^
458 UriManager.string_of_uri uri)))
462 List.fold_right (fun x i -> i && does_not_occur context n nn x) tl true
464 raise (TypeCheckerFailure
465 (lazy ("Non-positive occurence in mutual inductive definition(s) [2]"^
466 UriManager.string_of_uri uri)))
467 | C.Rel m when m = i ->
468 if indparamsno = 0 then
471 raise (TypeCheckerFailure
472 (lazy ("Non-positive occurence in mutual inductive definition(s) [3]"^
473 UriManager.string_of_uri uri)))
474 | C.Prod (C.Anonymous,source,dest) ->
475 let b = strictly_positive context n nn source in
477 are_all_occurrences_positive
478 ((Some (C.Anonymous,(C.Decl source)))::context) uri indparamsno
479 (i+1) (n + 1) (nn + 1) dest
480 | C.Prod (name,source,dest) when
481 does_not_occur ((Some (name,(C.Decl source)))::context) 0 n dest ->
482 (* dummy abstraction, so we behave as in the anonimous case *)
483 strictly_positive context n nn source &&
484 are_all_occurrences_positive
485 ((Some (name,(C.Decl source)))::context) uri indparamsno
486 (i+1) (n + 1) (nn + 1) dest
487 | C.Prod (name,source,dest) ->
488 does_not_occur context n nn source &&
489 are_all_occurrences_positive ((Some (name,(C.Decl source)))::context)
490 uri indparamsno (i+1) (n + 1) (nn + 1) dest
493 (TypeCheckerFailure (lazy ("Malformed inductive constructor type " ^
494 (UriManager.string_of_uri uri))))
496 (* Main function to checks the correctness of a mutual *)
497 (* inductive block definition. This is the function *)
498 (* exported to the proof-engine. *)
499 and typecheck_mutual_inductive_defs ~logger uri (itl,_,indparamsno) ugraph =
500 let module U = UriManager in
501 (* let's check if the arity of the inductive types are well *)
503 let ugrap1 = List.fold_left
504 (fun ugraph (_,_,x,_) -> let _,ugraph' =
505 type_of ~logger x ugraph in ugraph')
508 (* let's check if the types of the inductive constructors *)
509 (* are well formed. *)
510 (* In order not to use type_of_aux we put the types of the *)
511 (* mutual inductive types at the head of the types of the *)
512 (* constructors using Prods *)
513 let len = List.length itl in
515 List.map (fun (n,_,ty,_) -> Some (Cic.Name n,(Cic.Decl ty))) itl in
518 (fun (_,_,_,cl) (i,ugraph) ->
521 (fun ugraph (name,te) ->
522 let debrujinedte = debrujin_constructor uri len te in
525 (fun (name,_,ty,_) i -> Cic.Prod (Cic.Name name, ty, i))
528 let _,ugraph' = type_of ~logger augmented_term ugraph in
529 (* let's check also the positivity conditions *)
532 (are_all_occurrences_positive tys uri indparamsno i 0 len
536 prerr_endline (UriManager.string_of_uri uri);
537 prerr_endline (string_of_int (List.length tys));
540 (lazy ("Non positive occurence in " ^ U.string_of_uri uri))) end
549 (* Main function to checks the correctness of a mutual *)
550 (* inductive block definition. *)
551 and check_mutual_inductive_defs uri obj ugraph =
553 Cic.InductiveDefinition (itl, params, indparamsno, _) ->
554 typecheck_mutual_inductive_defs uri (itl,params,indparamsno) ugraph
556 raise (TypeCheckerFailure (
557 lazy ("Unknown mutual inductive definition:" ^
558 UriManager.string_of_uri uri)))
560 and type_of_mutual_inductive_defs ~logger uri i ugraph =
561 let module C = Cic in
562 let module R = CicReduction in
563 let module U = UriManager in
565 match CicEnvironment.is_type_checked ~trust:true ugraph uri with
566 CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
567 | CicEnvironment.UncheckedObj uobj ->
568 logger#log (`Start_type_checking uri) ;
570 check_mutual_inductive_defs ~logger uri uobj ugraph
572 (* TASSI: FIXME: check ugraph1 == ugraph ritornato da env *)
574 CicEnvironment.set_type_checking_info uri ;
575 logger#log (`Type_checking_completed uri) ;
576 (match CicEnvironment.is_type_checked ~trust:false ugraph uri with
577 CicEnvironment.CheckedObj (cobj,ugraph') -> (cobj,ugraph')
578 | CicEnvironment.UncheckedObj _ -> raise CicEnvironmentError
581 Invalid_argument s ->
582 (*debug_print (lazy s);*)
586 C.InductiveDefinition (dl,_,_,_) ->
587 let (_,_,arity,_) = List.nth dl i in
590 raise (TypeCheckerFailure
591 (lazy ("Unknown mutual inductive definition:" ^ U.string_of_uri uri)))
593 and type_of_mutual_inductive_constr ~logger uri i j ugraph =
594 let module C = Cic in
595 let module R = CicReduction in
596 let module U = UriManager in
598 match CicEnvironment.is_type_checked ~trust:true ugraph uri with
599 CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
600 | CicEnvironment.UncheckedObj uobj ->
601 logger#log (`Start_type_checking uri) ;
603 check_mutual_inductive_defs ~logger uri uobj ugraph
605 (* check ugraph1 validity ??? == ugraph' *)
607 CicEnvironment.set_type_checking_info uri ;
608 logger#log (`Type_checking_completed uri) ;
610 CicEnvironment.is_type_checked ~trust:false ugraph uri
612 CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
613 | CicEnvironment.UncheckedObj _ ->
614 raise CicEnvironmentError)
616 Invalid_argument s ->
617 (*debug_print (lazy s);*)
621 C.InductiveDefinition (dl,_,_,_) ->
622 let (_,_,_,cl) = List.nth dl i in
623 let (_,ty) = List.nth cl (j-1) in
626 raise (TypeCheckerFailure
627 (lazy ("Unknown mutual inductive definition:" ^ UriManager.string_of_uri uri)))
629 and recursive_args context n nn te =
630 let module C = Cic in
631 match CicReduction.whd context te with
637 | C.Cast _ (*CSC ??? *) ->
638 raise (AssertFailure (lazy "3")) (* due to type-checking *)
639 | C.Prod (name,so,de) ->
640 (not (does_not_occur context n nn so)) ::
641 (recursive_args ((Some (name,(C.Decl so)))::context) (n+1) (nn + 1) de)
644 raise (AssertFailure (lazy "4")) (* due to type-checking *)
646 | C.Const _ -> raise (AssertFailure (lazy "5"))
651 | C.CoFix _ -> raise (AssertFailure (lazy "6")) (* due to type-checking *)
653 and get_new_safes ~subst context p c rl safes n nn x =
654 let module C = Cic in
655 let module U = UriManager in
656 let module R = CicReduction in
657 match (R.whd ~subst context c, R.whd ~subst context p, rl) with
658 (C.Prod (_,so,ta1), C.Lambda (name,_,ta2), b::tl) ->
659 (* we are sure that the two sources are convertible because we *)
660 (* have just checked this. So let's go along ... *)
662 List.map (fun x -> x + 1) safes
665 if b then 1::safes' else safes'
667 get_new_safes ~subst ((Some (name,(C.Decl so)))::context)
668 ta2 ta1 tl safes'' (n+1) (nn+1) (x+1)
669 | (C.Prod _, (C.MutConstruct _ as e), _)
670 | (C.Prod _, (C.Rel _ as e), _)
671 | (C.MutInd _, e, [])
672 | (C.Appl _, e, []) -> (e,safes,n,nn,x,context)
674 (* CSC: If the next exception is raised, it just means that *)
675 (* CSC: the proof-assistant allows to use very strange things *)
676 (* CSC: as a branch of a case whose type is a Prod. In *)
677 (* CSC: particular, this means that a new (C.Prod, x,_) case *)
678 (* CSC: must be considered in this match. (e.g. x = MutCase) *)
681 (Printf.sprintf "Get New Safes: c=%s ; p=%s"
682 (CicPp.ppterm c) (CicPp.ppterm p))))
684 and split_prods ~subst context n te =
685 let module C = Cic in
686 let module R = CicReduction in
687 match (n, R.whd ~subst context te) with
689 | (n, C.Prod (name,so,ta)) when n > 0 ->
690 split_prods ~subst ((Some (name,(C.Decl so)))::context) (n - 1) ta
691 | (_, _) -> raise (AssertFailure (lazy "8"))
693 and eat_lambdas ~subst context n te =
694 let module C = Cic in
695 let module R = CicReduction in
696 match (n, R.whd ~subst context te) with
697 (0, _) -> (te, 0, context)
698 | (n, C.Lambda (name,so,ta)) when n > 0 ->
699 let (te, k, context') =
700 eat_lambdas ~subst ((Some (name,(C.Decl so)))::context) (n - 1) ta
702 (te, k + 1, context')
704 raise (AssertFailure (lazy (sprintf "9 (%d, %s)" n (CicPp.ppterm te))))
706 (*CSC: Tutto quello che segue e' l'intuzione di luca ;-) *)
707 and check_is_really_smaller_arg ~subst context n nn kl x safes te =
708 (*CSC: forse la whd si puo' fare solo quando serve veramente. *)
709 (*CSC: cfr guarded_by_destructors *)
710 let module C = Cic in
711 let module U = UriManager in
712 match CicReduction.whd ~subst context te with
713 C.Rel m when List.mem m safes -> true
720 (* | C.Cast (te,ty) ->
721 check_is_really_smaller_arg ~subst n nn kl x safes te &&
722 check_is_really_smaller_arg ~subst n nn kl x safes ty*)
723 (* | C.Prod (_,so,ta) ->
724 check_is_really_smaller_arg ~subst n nn kl x safes so &&
725 check_is_really_smaller_arg ~subst (n+1) (nn+1) kl (x+1)
726 (List.map (fun x -> x + 1) safes) ta*)
727 | C.Prod _ -> raise (AssertFailure (lazy "10"))
728 | C.Lambda (name,so,ta) ->
729 check_is_really_smaller_arg ~subst context n nn kl x safes so &&
730 check_is_really_smaller_arg ~subst ((Some (name,(C.Decl so)))::context)
731 (n+1) (nn+1) kl (x+1) (List.map (fun x -> x + 1) safes) ta
732 | C.LetIn (name,so,ty,ta) ->
733 check_is_really_smaller_arg ~subst context n nn kl x safes so &&
734 check_is_really_smaller_arg ~subst context n nn kl x safes ty &&
735 check_is_really_smaller_arg ~subst ((Some (name,(C.Def (so,ty))))::context)
736 (n+1) (nn+1) kl (x+1) (List.map (fun x -> x + 1) safes) ta
738 (*CSC: sulla coda ci vogliono dei controlli? secondo noi no, ma *)
739 (*CSC: solo perche' non abbiamo trovato controesempi *)
740 check_is_really_smaller_arg ~subst context n nn kl x safes he
741 | C.Appl [] -> raise (AssertFailure (lazy "11"))
743 | C.MutInd _ -> raise (AssertFailure (lazy "12"))
744 | C.MutConstruct _ -> false
745 | C.MutCase (uri,i,outtype,term,pl) ->
747 C.Rel m when List.mem m safes || m = x ->
748 let (lefts_and_tys,len,isinductive,paramsno,cl) =
749 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
751 C.InductiveDefinition (tl,_,paramsno,_) ->
754 (fun (n,_,ty,_) -> Some (Cic.Name n,(Cic.Decl ty))) tl
756 let (_,isinductive,_,cl) = List.nth tl i in
760 (id, snd (split_prods ~subst tys paramsno ty))) cl in
765 fst (split_prods ~subst [] paramsno ty)
767 (tys@lefts,List.length tl,isinductive,paramsno,cl')
769 raise (TypeCheckerFailure
770 (lazy ("Unknown mutual inductive definition:" ^
771 UriManager.string_of_uri uri)))
773 if not isinductive then
776 i && check_is_really_smaller_arg ~subst context n nn kl x safes p)
783 Invalid_argument _ ->
784 raise (TypeCheckerFailure (lazy "not enough patterns"))
789 let debrujinedte = debrujin_constructor uri len c in
790 recursive_args lefts_and_tys 0 len debrujinedte
792 let (e,safes',n',nn',x',context') =
793 get_new_safes ~subst context p c rl' safes n nn x
796 check_is_really_smaller_arg ~subst context' n' nn' kl x' safes' e
798 | C.Appl ((C.Rel m)::tl) when List.mem m safes || m = x ->
799 let (lefts_and_tys,len,isinductive,paramsno,cl) =
800 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
802 C.InductiveDefinition (tl,_,paramsno,_) ->
803 let (_,isinductive,_,cl) = List.nth tl i in
805 List.map (fun (n,_,ty,_) ->
806 Some(Cic.Name n,(Cic.Decl ty))) tl
811 (id, snd (split_prods ~subst tys paramsno ty))) cl in
816 fst (split_prods ~subst [] paramsno ty)
818 (tys@lefts,List.length tl,isinductive,paramsno,cl')
820 raise (TypeCheckerFailure
821 (lazy ("Unknown mutual inductive definition:" ^
822 UriManager.string_of_uri uri)))
824 if not isinductive then
827 i && check_is_really_smaller_arg ~subst context n nn kl x safes p)
834 Invalid_argument _ ->
835 raise (TypeCheckerFailure (lazy "not enough patterns"))
837 (*CSC: supponiamo come prima che nessun controllo sia necessario*)
838 (*CSC: sugli argomenti di una applicazione *)
842 let debrujinedte = debrujin_constructor uri len c in
843 recursive_args lefts_and_tys 0 len debrujinedte
845 let (e, safes',n',nn',x',context') =
846 get_new_safes ~subst context p c rl' safes n nn x
849 check_is_really_smaller_arg ~subst context' n' nn' kl x' safes' e
854 i && check_is_really_smaller_arg ~subst context n nn kl x safes p
858 let len = List.length fl in
859 let n_plus_len = n + len
860 and nn_plus_len = nn + len
861 and x_plus_len = x + len
864 (fun (types,len) (n,_,ty,_) ->
865 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
868 and safes' = List.map (fun x -> x + len) safes in
870 (fun (_,_,ty,bo) i ->
872 check_is_really_smaller_arg ~subst (tys@context) n_plus_len nn_plus_len kl
876 let len = List.length fl in
877 let n_plus_len = n + len
878 and nn_plus_len = nn + len
879 and x_plus_len = x + len
882 (fun (types,len) (n,ty,_) ->
883 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
886 and safes' = List.map (fun x -> x + len) safes in
890 check_is_really_smaller_arg ~subst (tys@context) n_plus_len nn_plus_len kl
894 and guarded_by_destructors ~subst context n nn kl x safes =
895 let module C = Cic in
896 let module U = UriManager in
898 C.Rel m when m > n && m <= nn -> false
900 (match List.nth context (n-1) with
901 Some (_,C.Decl _) -> true
902 | Some (_,C.Def (bo,_)) ->
903 guarded_by_destructors ~subst context m nn kl x safes
904 (CicSubstitution.lift m bo)
905 | None -> raise (TypeCheckerFailure (lazy "Reference to deleted hypothesis"))
909 | C.Implicit _ -> true
911 guarded_by_destructors ~subst context n nn kl x safes te &&
912 guarded_by_destructors ~subst context n nn kl x safes ty
913 | C.Prod (name,so,ta) ->
914 guarded_by_destructors ~subst context n nn kl x safes so &&
915 guarded_by_destructors ~subst ((Some (name,(C.Decl so)))::context)
916 (n+1) (nn+1) kl (x+1) (List.map (fun x -> x + 1) safes) ta
917 | C.Lambda (name,so,ta) ->
918 guarded_by_destructors ~subst context n nn kl x safes so &&
919 guarded_by_destructors ~subst ((Some (name,(C.Decl so)))::context)
920 (n+1) (nn+1) kl (x+1) (List.map (fun x -> x + 1) safes) ta
921 | C.LetIn (name,so,ty,ta) ->
922 guarded_by_destructors ~subst context n nn kl x safes so &&
923 guarded_by_destructors ~subst context n nn kl x safes ty &&
924 guarded_by_destructors ~subst ((Some (name,(C.Def (so,ty))))::context)
925 (n+1) (nn+1) kl (x+1) (List.map (fun x -> x + 1) safes) ta
926 | C.Appl ((C.Rel m)::tl) when m > n && m <= nn ->
927 let k = List.nth kl (m - n - 1) in
928 if not (List.length tl > k) then false
932 i && guarded_by_destructors ~subst context n nn kl x safes param
934 check_is_really_smaller_arg ~subst context n nn kl x safes (List.nth tl k)
937 (fun t i -> i && guarded_by_destructors ~subst context n nn kl x safes t)
939 | C.Var (_,exp_named_subst)
940 | C.Const (_,exp_named_subst)
941 | C.MutInd (_,_,exp_named_subst)
942 | C.MutConstruct (_,_,_,exp_named_subst) ->
944 (fun (_,t) i -> i && guarded_by_destructors ~subst context n nn kl x safes t)
946 | C.MutCase (uri,i,outtype,term,pl) ->
947 (match CicReduction.whd ~subst context term with
948 C.Rel m when List.mem m safes || m = x ->
949 let (lefts_and_tys,len,isinductive,paramsno,cl) =
950 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
952 C.InductiveDefinition (tl,_,paramsno,_) ->
953 let len = List.length tl in
954 let (_,isinductive,_,cl) = List.nth tl i in
956 List.map (fun (n,_,ty,_) ->
957 Some(Cic.Name n,(Cic.Decl ty))) tl
962 let debrujinedty = debrujin_constructor uri len ty in
963 (id, snd (split_prods ~subst tys paramsno ty),
964 snd (split_prods ~subst tys paramsno debrujinedty)
970 fst (split_prods ~subst [] paramsno ty)
972 (tys@lefts,len,isinductive,paramsno,cl')
974 raise (TypeCheckerFailure
975 (lazy ("Unknown mutual inductive definition:" ^
976 UriManager.string_of_uri uri)))
978 if not isinductive then
979 guarded_by_destructors ~subst context n nn kl x safes outtype &&
980 guarded_by_destructors ~subst context n nn kl x safes term &&
981 (*CSC: manca ??? il controllo sul tipo di term? *)
984 i && guarded_by_destructors ~subst context n nn kl x safes p)
991 Invalid_argument _ ->
992 raise (TypeCheckerFailure (lazy "not enough patterns"))
994 guarded_by_destructors ~subst context n nn kl x safes outtype &&
995 (*CSC: manca ??? il controllo sul tipo di term? *)
997 (fun (p,(_,c,brujinedc)) i ->
998 let rl' = recursive_args lefts_and_tys 0 len brujinedc in
999 let (e,safes',n',nn',x',context') =
1000 get_new_safes ~subst context p c rl' safes n nn x
1003 guarded_by_destructors ~subst context' n' nn' kl x' safes' e
1005 | C.Appl ((C.Rel m)::tl) when List.mem m safes || m = x ->
1006 let (lefts_and_tys,len,isinductive,paramsno,cl) =
1007 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
1009 C.InductiveDefinition (tl,_,paramsno,_) ->
1010 let (_,isinductive,_,cl) = List.nth tl i in
1013 (fun (n,_,ty,_) -> Some(Cic.Name n,(Cic.Decl ty))) tl
1018 (id, snd (split_prods ~subst tys paramsno ty))) cl in
1023 fst (split_prods ~subst [] paramsno ty)
1025 (tys@lefts,List.length tl,isinductive,paramsno,cl')
1027 raise (TypeCheckerFailure
1028 (lazy ("Unknown mutual inductive definition:" ^
1029 UriManager.string_of_uri uri)))
1031 if not isinductive then
1032 guarded_by_destructors ~subst context n nn kl x safes outtype &&
1033 guarded_by_destructors ~subst context n nn kl x safes term &&
1034 (*CSC: manca ??? il controllo sul tipo di term? *)
1037 i && guarded_by_destructors ~subst context n nn kl x safes p)
1044 Invalid_argument _ ->
1045 raise (TypeCheckerFailure (lazy "not enough patterns"))
1047 guarded_by_destructors ~subst context n nn kl x safes outtype &&
1048 (*CSC: manca ??? il controllo sul tipo di term? *)
1051 i && guarded_by_destructors ~subst context n nn kl x safes t)
1056 let debrujinedte = debrujin_constructor uri len c in
1057 recursive_args lefts_and_tys 0 len debrujinedte
1059 let (e, safes',n',nn',x',context') =
1060 get_new_safes ~subst context p c rl' safes n nn x
1063 guarded_by_destructors ~subst context' n' nn' kl x' safes' e
1066 guarded_by_destructors ~subst context n nn kl x safes outtype &&
1067 guarded_by_destructors ~subst context n nn kl x safes term &&
1068 (*CSC: manca ??? il controllo sul tipo di term? *)
1070 (fun p i -> i && guarded_by_destructors ~subst context n nn kl x safes p)
1074 let len = List.length fl in
1075 let n_plus_len = n + len
1076 and nn_plus_len = nn + len
1077 and x_plus_len = x + len
1080 (fun (types,len) (n,_,ty,_) ->
1081 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
1084 and safes' = List.map (fun x -> x + len) safes in
1086 (fun (_,_,ty,bo) i ->
1087 i && guarded_by_destructors ~subst context n nn kl x_plus_len safes' ty &&
1088 guarded_by_destructors ~subst (tys@context) n_plus_len nn_plus_len kl
1089 x_plus_len safes' bo
1091 | C.CoFix (_, fl) ->
1092 let len = List.length fl in
1093 let n_plus_len = n + len
1094 and nn_plus_len = nn + len
1095 and x_plus_len = x + len
1098 (fun (types,len) (n,ty,_) ->
1099 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
1102 and safes' = List.map (fun x -> x + len) safes in
1106 guarded_by_destructors ~subst context n nn kl x_plus_len safes' ty &&
1107 guarded_by_destructors ~subst (tys@context) n_plus_len nn_plus_len kl
1108 x_plus_len safes' bo
1111 (* the boolean h means already protected *)
1112 (* args is the list of arguments the type of the constructor that may be *)
1113 (* found in head position must be applied to. *)
1114 and guarded_by_constructors ~subst context n nn h te args coInductiveTypeURI =
1115 let module C = Cic in
1116 (*CSC: There is a lot of code replication between the cases X and *)
1117 (*CSC: (C.Appl X tl). Maybe it will be better to define a function *)
1118 (*CSC: that maps X into (C.Appl X []) when X is not already a C.Appl *)
1119 match CicReduction.whd ~subst context te with
1120 C.Rel m when m > n && m <= nn -> h
1128 (* the term has just been type-checked *)
1129 raise (AssertFailure (lazy "17"))
1130 | C.Lambda (name,so,de) ->
1131 does_not_occur ~subst context n nn so &&
1132 guarded_by_constructors ~subst ((Some (name,(C.Decl so)))::context)
1133 (n + 1) (nn + 1) h de args coInductiveTypeURI
1134 | C.Appl ((C.Rel m)::tl) when m > n && m <= nn ->
1136 List.fold_right (fun x i -> i && does_not_occur ~subst context n nn x) tl true
1137 | C.Appl ((C.MutConstruct (uri,i,j,exp_named_subst))::tl) ->
1141 CicEnvironment.get_cooked_obj ~trust:false CicUniv.empty_ugraph uri
1142 with Not_found -> assert false
1145 C.InductiveDefinition (itl,_,_,_) ->
1146 let (_,_,_,cl) = List.nth itl i in
1147 let (_,cons) = List.nth cl (j - 1) in
1148 CicSubstitution.subst_vars exp_named_subst cons
1150 raise (TypeCheckerFailure
1151 (lazy ("Unknown mutual inductive definition:" ^ UriManager.string_of_uri uri)))
1153 let rec analyse_branch context ty te =
1154 match CicReduction.whd ~subst context ty with
1155 C.Meta _ -> raise (AssertFailure (lazy "34"))
1159 does_not_occur ~subst context n nn te
1162 raise (AssertFailure (lazy "24"))(* due to type-checking *)
1163 | C.Prod (name,so,de) ->
1164 analyse_branch ((Some (name,(C.Decl so)))::context) de te
1167 raise (AssertFailure (lazy "25"))(* due to type-checking *)
1168 | C.Appl ((C.MutInd (uri,_,_))::_) when uri == coInductiveTypeURI ->
1169 guarded_by_constructors ~subst context n nn true te []
1171 | C.Appl ((C.MutInd (uri,_,_))::_) ->
1172 guarded_by_constructors ~subst context n nn true te tl
1175 does_not_occur ~subst context n nn te
1176 | C.Const _ -> raise (AssertFailure (lazy "26"))
1177 | C.MutInd (uri,_,_) when uri == coInductiveTypeURI ->
1178 guarded_by_constructors ~subst context n nn true te []
1181 does_not_occur ~subst context n nn te
1182 | C.MutConstruct _ -> raise (AssertFailure (lazy "27"))
1183 (*CSC: we do not consider backbones with a MutCase, Fix, Cofix *)
1184 (*CSC: in head position. *)
1188 raise (AssertFailure (lazy "28"))(* due to type-checking *)
1190 let rec analyse_instantiated_type context ty l =
1191 match CicReduction.whd ~subst context ty with
1197 | C.Cast _ -> raise (AssertFailure (lazy "29"))(* due to type-checking *)
1198 | C.Prod (name,so,de) ->
1203 analyse_branch context so he &&
1204 analyse_instantiated_type
1205 ((Some (name,(C.Decl so)))::context) de tl
1209 raise (AssertFailure (lazy "30"))(* due to type-checking *)
1212 (fun i x -> i && does_not_occur ~subst context n nn x) true l
1213 | C.Const _ -> raise (AssertFailure (lazy "31"))
1216 (fun i x -> i && does_not_occur ~subst context n nn x) true l
1217 | C.MutConstruct _ -> raise (AssertFailure (lazy "32"))
1218 (*CSC: we do not consider backbones with a MutCase, Fix, Cofix *)
1219 (*CSC: in head position. *)
1223 raise (AssertFailure (lazy "33"))(* due to type-checking *)
1225 let rec instantiate_type args consty =
1228 | tlhe::tltl as l ->
1229 let consty' = CicReduction.whd ~subst context consty in
1235 let instantiated_de = CicSubstitution.subst he de in
1236 (*CSC: siamo sicuri che non sia troppo forte? *)
1237 does_not_occur ~subst context n nn tlhe &
1238 instantiate_type tl instantiated_de tltl
1240 (*CSC:We do not consider backbones with a MutCase, a *)
1241 (*CSC:FixPoint, a CoFixPoint and so on in head position.*)
1242 raise (AssertFailure (lazy "23"))
1244 | [] -> analyse_instantiated_type context consty' l
1245 (* These are all the other cases *)
1247 instantiate_type args consty tl
1248 | C.Appl ((C.CoFix (_,fl))::tl) ->
1249 List.fold_left (fun i x -> i && does_not_occur ~subst context n nn x) true tl &&
1250 let len = List.length fl in
1251 let n_plus_len = n + len
1252 and nn_plus_len = nn + len
1253 (*CSC: Is a Decl of the ty ok or should I use Def of a Fix? *)
1256 (fun (types,len) (n,ty,_) ->
1257 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
1263 i && does_not_occur ~subst context n nn ty &&
1264 guarded_by_constructors ~subst (tys@context) n_plus_len nn_plus_len
1265 h bo args coInductiveTypeURI
1267 | C.Appl ((C.MutCase (_,_,out,te,pl))::tl) ->
1268 List.fold_left (fun i x -> i && does_not_occur ~subst context n nn x) true tl &&
1269 does_not_occur ~subst context n nn out &&
1270 does_not_occur ~subst context n nn te &&
1274 guarded_by_constructors ~subst context n nn h x args
1278 List.fold_right (fun x i -> i && does_not_occur ~subst context n nn x) l true
1279 | C.Var (_,exp_named_subst)
1280 | C.Const (_,exp_named_subst) ->
1282 (fun (_,x) i -> i && does_not_occur ~subst context n nn x) exp_named_subst true
1283 | C.MutInd _ -> assert false
1284 | C.MutConstruct (_,_,_,exp_named_subst) ->
1286 (fun (_,x) i -> i && does_not_occur ~subst context n nn x) exp_named_subst true
1287 | C.MutCase (_,_,out,te,pl) ->
1288 does_not_occur ~subst context n nn out &&
1289 does_not_occur ~subst context n nn te &&
1293 guarded_by_constructors ~subst context n nn h x args
1297 let len = List.length fl in
1298 let n_plus_len = n + len
1299 and nn_plus_len = nn + len
1300 (*CSC: Is a Decl of the ty ok or should I use Def of a Fix? *)
1303 (fun (types,len) (n,_,ty,_) ->
1304 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
1309 (fun (_,_,ty,bo) i ->
1310 i && does_not_occur ~subst context n nn ty &&
1311 does_not_occur ~subst (tys@context) n_plus_len nn_plus_len bo
1314 let len = List.length fl in
1315 let n_plus_len = n + len
1316 and nn_plus_len = nn + len
1317 (*CSC: Is a Decl of the ty ok or should I use Def of a Fix? *)
1320 (fun (types,len) (n,ty,_) ->
1321 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
1327 i && does_not_occur ~subst context n nn ty &&
1328 guarded_by_constructors ~subst (tys@context) n_plus_len nn_plus_len
1330 args coInductiveTypeURI
1333 and check_allowed_sort_elimination ~subst ~metasenv ~logger context uri i
1334 need_dummy ind arity1 arity2 ugraph =
1335 let module C = Cic in
1336 let module U = UriManager in
1337 let arity1 = CicReduction.whd ~subst context arity1 in
1338 let rec check_allowed_sort_elimination_aux ugraph context arity2 need_dummy =
1339 match arity1, CicReduction.whd ~subst context arity2 with
1340 (C.Prod (_,so1,de1), C.Prod (_,so2,de2)) ->
1342 CicReduction.are_convertible ~subst ~metasenv context so1 so2 ugraph in
1344 check_allowed_sort_elimination ~subst ~metasenv ~logger context uri i
1345 need_dummy (C.Appl [CicSubstitution.lift 1 ind ; C.Rel 1]) de1 de2
1349 | (C.Sort _, C.Prod (name,so,ta)) when not need_dummy ->
1351 CicReduction.are_convertible ~subst ~metasenv context so ind ugraph in
1355 check_allowed_sort_elimination_aux ugraph1
1356 ((Some (name,C.Decl so))::context) ta true
1357 | (C.Sort C.Prop, C.Sort C.Prop) when need_dummy -> true,ugraph
1358 | (C.Sort C.Prop, C.Sort C.Set)
1359 | (C.Sort C.Prop, C.Sort C.CProp)
1360 | (C.Sort C.Prop, C.Sort (C.Type _) ) when need_dummy ->
1361 (let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
1363 C.InductiveDefinition (itl,_,paramsno,_) ->
1364 let itl_len = List.length itl in
1365 let (name,_,ty,cl) = List.nth itl i in
1366 let cl_len = List.length cl in
1367 if (cl_len = 0 || (itl_len = 1 && cl_len = 1)) then
1368 let non_informative,ugraph =
1369 if cl_len = 0 then true,ugraph
1371 is_non_informative ~logger [Some (C.Name name,C.Decl ty)]
1372 paramsno (snd (List.nth cl 0)) ugraph
1374 (* is it a singleton or empty non recursive and non informative
1376 non_informative, ugraph
1380 raise (TypeCheckerFailure
1381 (lazy ("Unknown mutual inductive definition:" ^
1382 UriManager.string_of_uri uri)))
1384 | (C.Sort C.Set, C.Sort C.Prop) when need_dummy -> true , ugraph
1385 | (C.Sort C.CProp, C.Sort C.Prop) when need_dummy -> true , ugraph
1386 | (C.Sort C.Set, C.Sort C.Set) when need_dummy -> true , ugraph
1387 | (C.Sort C.Set, C.Sort C.CProp) when need_dummy -> true , ugraph
1388 | (C.Sort C.CProp, C.Sort C.Set) when need_dummy -> true , ugraph
1389 | (C.Sort C.CProp, C.Sort C.CProp) when need_dummy -> true , ugraph
1390 | ((C.Sort C.Set, C.Sort (C.Type _)) | (C.Sort C.CProp, C.Sort (C.Type _)))
1392 (let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
1394 C.InductiveDefinition (itl,_,paramsno,_) ->
1396 List.map (fun (n,_,ty,_) -> Some (Cic.Name n,(Cic.Decl ty))) itl
1398 let (_,_,_,cl) = List.nth itl i in
1400 (fun (_,x) (i,ugraph) ->
1402 is_small ~logger tys paramsno x ugraph
1407 raise (TypeCheckerFailure
1408 (lazy ("Unknown mutual inductive definition:" ^
1409 UriManager.string_of_uri uri)))
1411 | (C.Sort (C.Type _), C.Sort _) when need_dummy -> true , ugraph
1412 | (_,_) -> false,ugraph
1414 check_allowed_sort_elimination_aux ugraph context arity2 need_dummy
1416 and type_of_branch ~subst context argsno need_dummy outtype term constype =
1417 let module C = Cic in
1418 let module R = CicReduction in
1419 match R.whd ~subst context constype with
1424 C.Appl [outtype ; term]
1425 | C.Appl (C.MutInd (_,_,_)::tl) ->
1426 let (_,arguments) = split tl argsno
1428 if need_dummy && arguments = [] then
1431 C.Appl (outtype::arguments@(if need_dummy then [] else [term]))
1432 | C.Prod (name,so,de) ->
1434 match CicSubstitution.lift 1 term with
1435 C.Appl l -> C.Appl (l@[C.Rel 1])
1436 | t -> C.Appl [t ; C.Rel 1]
1438 C.Prod (name,so,type_of_branch ~subst
1439 ((Some (name,(C.Decl so)))::context) argsno need_dummy
1440 (CicSubstitution.lift 1 outtype) term' de)
1441 | _ -> raise (AssertFailure (lazy "20"))
1443 (* check_metasenv_consistency checks that the "canonical" context of a
1444 metavariable is consitent - up to relocation via the relocation list l -
1445 with the actual context *)
1448 and check_metasenv_consistency ~logger ~subst metasenv context
1449 canonical_context l ugraph
1451 let module C = Cic in
1452 let module R = CicReduction in
1453 let module S = CicSubstitution in
1454 let lifted_canonical_context =
1458 | (Some (n,C.Decl t))::tl ->
1459 (Some (n,C.Decl (S.subst_meta l (S.lift i t))))::(aux (i+1) tl)
1460 | None::tl -> None::(aux (i+1) tl)
1461 | (Some (n,C.Def (t,ty)))::tl ->
1462 (Some (n,C.Def ((S.subst_meta l (S.lift i t)),S.subst_meta l (S.lift i ty))))::(aux (i+1) tl)
1464 aux 1 canonical_context
1470 | Some t,Some (_,C.Def (ct,_)) ->
1471 (*CSC: the following optimization is to avoid a possibly expensive
1472 reduction that can be easily avoided and that is quite
1473 frequent. However, this is better handled using levels to
1474 control reduction *)
1479 match List.nth context (n - 1) with
1480 Some (_,C.Def (te,_)) -> S.lift n te
1486 (*if t <> optimized_t && optimized_t = ct then prerr_endline "!!!!!!!!!!!!!!!"
1487 else if t <> optimized_t then prerr_endline ("@@ " ^ CicPp.ppterm t ^ " ==> " ^ CicPp.ppterm optimized_t ^ " <==> " ^ CicPp.ppterm ct);*)
1489 R.are_convertible ~subst ~metasenv context optimized_t ct ugraph
1494 (lazy (sprintf "Not well typed metavariable local context: expected a term convertible with %s, found %s" (CicPp.ppterm ct) (CicPp.ppterm t))))
1497 | Some t,Some (_,C.Decl ct) ->
1498 let type_t,ugraph1 =
1499 type_of_aux' ~logger ~subst metasenv context t ugraph
1502 R.are_convertible ~subst ~metasenv context type_t ct ugraph1
1505 raise (TypeCheckerFailure
1506 (lazy (sprintf "Not well typed metavariable local context: expected a term of type %s, found %s of type %s"
1507 (CicPp.ppterm ct) (CicPp.ppterm t)
1508 (CicPp.ppterm type_t))))
1512 raise (TypeCheckerFailure
1513 (lazy ("Not well typed metavariable local context: "^
1514 "an hypothesis, that is not hidden, is not instantiated")))
1515 ) ugraph l lifted_canonical_context
1519 type_of_aux' is just another name (with a different scope)
1523 and type_of_aux' ~logger ?(subst = []) metasenv context t ugraph =
1524 let rec type_of_aux ~logger context t ugraph =
1525 let module C = Cic in
1526 let module R = CicReduction in
1527 let module S = CicSubstitution in
1528 let module U = UriManager in
1532 match List.nth context (n - 1) with
1533 Some (_,C.Decl t) -> S.lift n t,ugraph
1534 | Some (_,C.Def (_,ty)) -> S.lift n ty,ugraph
1536 (TypeCheckerFailure (lazy "Reference to deleted hypothesis"))
1539 raise (TypeCheckerFailure (lazy "unbound variable"))
1541 | C.Var (uri,exp_named_subst) ->
1544 check_exp_named_subst ~logger ~subst context exp_named_subst ugraph
1546 let ty,ugraph2 = type_of_variable ~logger uri ugraph1 in
1547 let ty1 = CicSubstitution.subst_vars exp_named_subst ty in
1552 let (canonical_context,term,ty) = CicUtil.lookup_subst n subst in
1554 check_metasenv_consistency ~logger
1555 ~subst metasenv context canonical_context l ugraph
1557 (* assuming subst is well typed !!!!! *)
1558 ((CicSubstitution.subst_meta l ty), ugraph1)
1559 (* type_of_aux context (CicSubstitution.subst_meta l term) *)
1560 with CicUtil.Subst_not_found _ ->
1561 let (_,canonical_context,ty) = CicUtil.lookup_meta n metasenv in
1563 check_metasenv_consistency ~logger
1564 ~subst metasenv context canonical_context l ugraph
1566 ((CicSubstitution.subst_meta l ty),ugraph1))
1567 (* TASSI: CONSTRAINTS *)
1568 | C.Sort (C.Type t) ->
1569 let t' = CicUniv.fresh() in
1571 let ugraph1 = CicUniv.add_gt t' t ugraph in
1572 (C.Sort (C.Type t')),ugraph1
1574 CicUniv.UniverseInconsistency msg -> raise (TypeCheckerFailure msg))
1575 | C.Sort s -> (C.Sort (C.Type (CicUniv.fresh ()))),ugraph
1576 | C.Implicit _ -> raise (AssertFailure (lazy "Implicit found"))
1577 | C.Cast (te,ty) as t ->
1578 let _,ugraph1 = type_of_aux ~logger context ty ugraph in
1579 let ty_te,ugraph2 = type_of_aux ~logger context te ugraph1 in
1581 R.are_convertible ~subst ~metasenv context ty_te ty ugraph2
1586 raise (TypeCheckerFailure
1587 (lazy (sprintf "Invalid cast %s" (CicPp.ppterm t))))
1588 | C.Prod (name,s,t) ->
1589 let sort1,ugraph1 = type_of_aux ~logger context s ugraph in
1591 type_of_aux ~logger ((Some (name,(C.Decl s)))::context) t ugraph1
1593 sort_of_prod ~subst context (name,s) (sort1,sort2) ugraph2
1594 | C.Lambda (n,s,t) ->
1595 let sort1,ugraph1 = type_of_aux ~logger context s ugraph in
1596 (match R.whd ~subst context sort1 with
1601 (TypeCheckerFailure (lazy (sprintf
1602 "Not well-typed lambda-abstraction: the source %s should be a type; instead it is a term of type %s" (CicPp.ppterm s)
1603 (CicPp.ppterm sort1))))
1606 type_of_aux ~logger ((Some (n,(C.Decl s)))::context) t ugraph1
1608 (C.Prod (n,s,type2)),ugraph2
1609 | C.LetIn (n,s,ty,t) ->
1610 (* only to check if s is well-typed *)
1611 let ty',ugraph1 = type_of_aux ~logger context s ugraph in
1613 R.are_convertible ~subst ~metasenv context ty ty' ugraph1
1619 "The type of %s is %s but it is expected to be %s"
1620 (CicPp.ppterm s) (CicPp.ppterm ty') (CicPp.ppterm ty))))
1622 (* The type of a LetIn is a LetIn. Extremely slow since the computed
1623 LetIn is later reduced and maybe also re-checked.
1624 (C.LetIn (n,s, type_of_aux ((Some (n,(C.Def s)))::context) t))
1626 (* The type of the LetIn is reduced. Much faster than the previous
1627 solution. Moreover the inferred type is probably very different
1628 from the expected one.
1629 (CicReduction.whd ~subst context
1630 (C.LetIn (n,s, type_of_aux ((Some (n,(C.Def s)))::context) t)))
1632 (* One-step LetIn reduction. Even faster than the previous solution.
1633 Moreover the inferred type is closer to the expected one. *)
1636 ((Some (n,(C.Def (s,ty))))::context) t ugraph1
1638 (CicSubstitution.subst ~avoid_beta_redexes:true s ty1),ugraph2
1639 | C.Appl (he::tl) when List.length tl > 0 ->
1640 let hetype,ugraph1 = type_of_aux ~logger context he ugraph in
1641 let tlbody_and_type,ugraph2 =
1644 let ty,ugraph1 = type_of_aux ~logger context x ugraph in
1645 (*let _,ugraph1 = type_of_aux ~logger context ty ugraph1 in*)
1646 ((x,ty)::l,ugraph1))
1649 (* TASSI: questa c'era nel mio... ma non nel CVS... *)
1650 (* let _,ugraph2 = type_of_aux context hetype ugraph2 in *)
1651 eat_prods ~subst context hetype tlbody_and_type ugraph2
1652 | C.Appl _ -> raise (AssertFailure (lazy "Appl: no arguments"))
1653 | C.Const (uri,exp_named_subst) ->
1656 check_exp_named_subst ~logger ~subst context exp_named_subst ugraph
1658 let cty,ugraph2 = type_of_constant ~logger uri ugraph1 in
1660 CicSubstitution.subst_vars exp_named_subst cty
1664 | C.MutInd (uri,i,exp_named_subst) ->
1667 check_exp_named_subst ~logger ~subst context exp_named_subst ugraph
1669 (* TASSI: da me c'era anche questa, ma in CVS no *)
1670 let mty,ugraph2 = type_of_mutual_inductive_defs ~logger uri i ugraph1 in
1671 (* fine parte dubbia *)
1673 CicSubstitution.subst_vars exp_named_subst mty
1677 | C.MutConstruct (uri,i,j,exp_named_subst) ->
1679 check_exp_named_subst ~logger ~subst context exp_named_subst ugraph
1681 (* TASSI: idem come sopra *)
1683 type_of_mutual_inductive_constr ~logger uri i j ugraph1
1686 CicSubstitution.subst_vars exp_named_subst mty
1689 | C.MutCase (uri,i,outtype,term,pl) ->
1690 let outsort,ugraph1 = type_of_aux ~logger context outtype ugraph in
1691 let (need_dummy, k) =
1692 let rec guess_args context t =
1693 let outtype = CicReduction.whd ~subst context t in
1695 C.Sort _ -> (true, 0)
1696 | C.Prod (name, s, t) ->
1698 guess_args ((Some (name,(C.Decl s)))::context) t in
1700 (* last prod before sort *)
1701 match CicReduction.whd ~subst context s with
1702 (*CSC: for _ see comment below about the missing named_exp_subst ?????????? *)
1703 C.MutInd (uri',i',_) when U.eq uri' uri && i' = i ->
1705 (*CSC: for _ see comment below about the missing named_exp_subst ?????????? *)
1706 | C.Appl ((C.MutInd (uri',i',_)) :: _)
1707 when U.eq uri' uri && i' = i -> (false, 1)
1715 "Malformed case analasys' output type %s"
1716 (CicPp.ppterm outtype))))
1719 let (parameters, arguments, exp_named_subst),ugraph2 =
1720 let ty,ugraph2 = type_of_aux context term ugraph1 in
1721 match R.whd ~subst context ty with
1722 (*CSC manca il caso dei CAST *)
1723 (*CSC: ma servono i parametri (uri,i)? Se si', perche' non serve anche il *)
1724 (*CSC: parametro exp_named_subst? Se no, perche' non li togliamo? *)
1725 (*CSC: Hint: nella DTD servono per gli stylesheet. *)
1726 C.MutInd (uri',i',exp_named_subst) as typ ->
1727 if U.eq uri uri' && i = i' then
1728 ([],[],exp_named_subst),ugraph2
1733 ("Case analysys: analysed term type is %s, but is expected to be (an application of) %s#1/%d{_}")
1734 (CicPp.ppterm typ) (U.string_of_uri uri) i)))
1736 ((C.MutInd (uri',i',exp_named_subst) as typ):: tl) as typ' ->
1737 if U.eq uri uri' && i = i' then
1739 split tl (List.length tl - k)
1740 in (params,args,exp_named_subst),ugraph2
1745 ("Case analysys: analysed term type is %s, "^
1746 "but is expected to be (an application of) "^
1748 (CicPp.ppterm typ') (U.string_of_uri uri) i)))
1754 "analysed term %s is not an inductive one")
1755 (CicPp.ppterm term))))
1757 let (b, k) = guess_args context outsort in
1758 if not b then (b, k - 1) else (b, k) in
1759 let (parameters, arguments, exp_named_subst),ugraph2 =
1760 let ty,ugraph2 = type_of_aux ~logger context term ugraph1 in
1761 match R.whd ~subst context ty with
1762 C.MutInd (uri',i',exp_named_subst) as typ ->
1763 if U.eq uri uri' && i = i' then
1764 ([],[],exp_named_subst),ugraph2
1768 ("Case analysys: analysed term type is %s (%s#1/%d{_}), but is expected to be (an application of) %s#1/%d{_}")
1769 (CicPp.ppterm typ) (U.string_of_uri uri') i' (U.string_of_uri uri) i)))
1770 | C.Appl ((C.MutInd (uri',i',exp_named_subst) as typ):: tl) ->
1771 if U.eq uri uri' && i = i' then
1773 split tl (List.length tl - k)
1774 in (params,args,exp_named_subst),ugraph2
1778 ("Case analysys: analysed term type is %s (%s#1/%d{_}), but is expected to be (an application of) %s#1/%d{_}")
1779 (CicPp.ppterm typ) (U.string_of_uri uri') i' (U.string_of_uri uri) i)))
1784 "Case analysis: analysed term %s is not an inductive one"
1785 (CicPp.ppterm term))))
1788 let's control if the sort elimination is allowed:
1791 let sort_of_ind_type =
1792 if parameters = [] then
1793 C.MutInd (uri,i,exp_named_subst)
1795 C.Appl ((C.MutInd (uri,i,exp_named_subst))::parameters)
1797 let type_of_sort_of_ind_ty,ugraph3 =
1798 type_of_aux ~logger context sort_of_ind_type ugraph2 in
1800 check_allowed_sort_elimination ~subst ~metasenv ~logger context uri i
1801 need_dummy sort_of_ind_type type_of_sort_of_ind_ty outsort ugraph3
1805 (TypeCheckerFailure (lazy ("Case analysis: sort elimination not allowed")));
1806 (* let's check if the type of branches are right *)
1807 let parsno,constructorsno =
1810 CicEnvironment.get_cooked_obj ~trust:false CicUniv.empty_ugraph uri
1811 with Not_found -> assert false
1814 C.InductiveDefinition (il,_,parsno,_) ->
1816 try List.nth il i with Failure _ -> assert false
1818 parsno, List.length cl
1820 raise (TypeCheckerFailure
1821 (lazy ("Unknown mutual inductive definition:" ^
1822 UriManager.string_of_uri uri)))
1824 if List.length pl <> constructorsno then
1825 raise (TypeCheckerFailure
1826 (lazy ("Wrong number of cases in case analysis"))) ;
1827 let (_,branches_ok,ugraph5) =
1829 (fun (j,b,ugraph) p ->
1832 if parameters = [] then
1833 (C.MutConstruct (uri,i,j,exp_named_subst))
1836 (C.MutConstruct (uri,i,j,exp_named_subst)::parameters))
1838 let ty_p,ugraph1 = type_of_aux ~logger context p ugraph in
1839 let ty_cons,ugraph3 = type_of_aux ~logger context cons ugraph1 in
1842 type_of_branch ~subst context parsno need_dummy outtype cons
1846 ~subst ~metasenv context ty_p ty_branch ugraph3
1851 prerr_endline ("\n!OUTTYPE= " ^ CicPp.ppterm outtype);
1852 prerr_endline ("!CONS= " ^ CicPp.ppterm cons);
1853 prerr_endline ("!TY_CONS= " ^ CicPp.ppterm ty_cons);
1854 prerr_endline ("#### " ^ CicPp.ppterm ty_p ^ "\n<==>\n" ^ CicPp.ppterm ty_branch);
1859 ("#### " ^ CicPp.ppterm ty_p ^
1860 " <==> " ^ CicPp.ppterm ty_branch));
1864 ) (1,true,ugraph4) pl
1866 if not branches_ok then
1868 (TypeCheckerFailure (lazy "Case analysys: wrong branch type"));
1870 if not need_dummy then outtype::arguments@[term]
1871 else outtype::arguments in
1873 if need_dummy && arguments = [] then outtype
1874 else CicReduction.head_beta_reduce (C.Appl arguments')
1878 let types,kl,ugraph1,len =
1880 (fun (types,kl,ugraph,len) (n,k,ty,_) ->
1881 let _,ugraph1 = type_of_aux ~logger context ty ugraph in
1882 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
1883 k::kl,ugraph1,len+1)
1884 ) ([],[],ugraph,0) fl
1888 (fun ugraph (name,x,ty,bo) ->
1890 type_of_aux ~logger (types@context) bo ugraph
1893 R.are_convertible ~subst ~metasenv (types@context)
1894 ty_bo (CicSubstitution.lift len ty) ugraph1 in
1897 let (m, eaten, context') =
1898 eat_lambdas ~subst (types @ context) (x + 1) bo
1901 let's control the guarded by
1902 destructors conditions D{f,k,x,M}
1904 if not (guarded_by_destructors ~subst context' eaten
1905 (len + eaten) kl 1 [] m) then
1908 (lazy ("Fix: not guarded by destructors")))
1913 raise (TypeCheckerFailure (lazy ("Fix: ill-typed bodies")))
1915 (*CSC: controlli mancanti solo su D{f,k,x,M} *)
1916 let (_,_,ty,_) = List.nth fl i in
1919 let types,ugraph1,len =
1921 (fun (l,ugraph,len) (n,ty,_) ->
1923 type_of_aux ~logger context ty ugraph in
1924 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::l,
1930 (fun ugraph (_,ty,bo) ->
1932 type_of_aux ~logger (types @ context) bo ugraph
1935 R.are_convertible ~subst ~metasenv (types @ context) ty_bo
1936 (CicSubstitution.lift len ty) ugraph1
1940 (* let's control that the returned type is coinductive *)
1941 match returns_a_coinductive ~subst context ty with
1945 (lazy "CoFix: does not return a coinductive type"))
1948 let's control the guarded by constructors
1951 if not (guarded_by_constructors ~subst
1952 (types @ context) 0 len false bo [] uri) then
1955 (lazy "CoFix: not guarded by constructors"))
1961 (TypeCheckerFailure (lazy "CoFix: ill-typed bodies"))
1964 let (_,ty,_) = List.nth fl i in
1967 and check_exp_named_subst ~logger ~subst context ugraph =
1968 let rec check_exp_named_subst_aux ~logger esubsts l ugraph =
1971 | ((uri,t) as item)::tl ->
1972 let ty_uri,ugraph1 = type_of_variable ~logger uri ugraph in
1974 CicSubstitution.subst_vars esubsts ty_uri in
1975 let typeoft,ugraph2 = type_of_aux ~logger context t ugraph1 in
1977 CicReduction.are_convertible ~subst ~metasenv
1978 context typeoft typeofvar ugraph2
1981 check_exp_named_subst_aux ~logger (esubsts@[item]) tl ugraph3
1984 CicReduction.fdebug := 0 ;
1986 (CicReduction.are_convertible
1987 ~subst ~metasenv context typeoft typeofvar ugraph2) ;
1989 debug typeoft [typeofvar] ;
1990 raise (TypeCheckerFailure (lazy "Wrong Explicit Named Substitution"))
1993 check_exp_named_subst_aux ~logger [] ugraph
1995 and sort_of_prod ~subst context (name,s) (t1, t2) ugraph =
1996 let module C = Cic in
1997 let t1' = CicReduction.whd ~subst context t1 in
1998 let t2' = CicReduction.whd ~subst ((Some (name,C.Decl s))::context) t2 in
1999 match (t1', t2') with
2000 (C.Sort s1, C.Sort s2)
2001 when (s2 = C.Prop or s2 = C.Set or s2 = C.CProp) ->
2002 (* different from Coq manual!!! *)
2004 | (C.Sort (C.Type t1), C.Sort (C.Type t2)) ->
2005 (* TASSI: CONSRTAINTS: the same in doubletypeinference, cicrefine *)
2006 let t' = CicUniv.fresh() in
2008 let ugraph1 = CicUniv.add_ge t' t1 ugraph in
2009 let ugraph2 = CicUniv.add_ge t' t2 ugraph1 in
2010 C.Sort (C.Type t'),ugraph2
2012 CicUniv.UniverseInconsistency msg -> raise (TypeCheckerFailure msg))
2013 | (C.Sort _,C.Sort (C.Type t1)) ->
2014 (* TASSI: CONSRTAINTS: the same in doubletypeinference, cicrefine *)
2015 C.Sort (C.Type t1),ugraph (* c'e' bisogno di un fresh? *)
2016 | (C.Meta _, C.Sort _) -> t2',ugraph
2017 | (C.Meta _, (C.Meta (_,_) as t))
2018 | (C.Sort _, (C.Meta (_,_) as t)) when CicUtil.is_closed t ->
2020 | (_,_) -> raise (TypeCheckerFailure (lazy (sprintf
2021 "Prod: expected two sorts, found = %s, %s" (CicPp.ppterm t1')
2022 (CicPp.ppterm t2'))))
2024 and eat_prods ~subst context hetype l ugraph =
2025 (*CSC: siamo sicuri che le are_convertible non lavorino con termini non *)
2029 | (hete, hety)::tl ->
2030 (match (CicReduction.whd ~subst context hetype) with
2033 (*if (match hety,s with Cic.Sort _,Cic.Sort _ -> false | _,_ -> true) && hety <> s then(
2034 prerr_endline ("AAA22: " ^ CicPp.ppterm hete ^ ": " ^ CicPp.ppterm hety ^ " <==> " ^ CicPp.ppterm s); let res = CicReduction.are_convertible ~subst ~metasenv context hety s ugraph in prerr_endline "#"; res) else*)
2035 CicReduction.are_convertible
2036 ~subst ~metasenv context hety s ugraph
2040 CicReduction.fdebug := -1 ;
2041 eat_prods ~subst context
2042 (CicSubstitution.subst ~avoid_beta_redexes:true hete t)
2044 (*TASSI: not sure *)
2048 CicReduction.fdebug := 0 ;
2049 ignore (CicReduction.are_convertible
2050 ~subst ~metasenv context s hety ugraph) ;
2056 ("Appl: wrong parameter-type, expected %s, found %s")
2057 (CicPp.ppterm hetype) (CicPp.ppterm s))))
2060 raise (TypeCheckerFailure
2061 (lazy "Appl: this is not a function, it cannot be applied"))
2064 and returns_a_coinductive ~subst context ty =
2065 let module C = Cic in
2066 match CicReduction.whd ~subst context ty with
2067 C.MutInd (uri,i,_) ->
2068 (*CSC: definire una funzioncina per questo codice sempre replicato *)
2071 CicEnvironment.get_cooked_obj ~trust:false CicUniv.empty_ugraph uri
2072 with Not_found -> assert false
2075 C.InductiveDefinition (itl,_,_,_) ->
2076 let (_,is_inductive,_,_) = List.nth itl i in
2077 if is_inductive then None else (Some uri)
2079 raise (TypeCheckerFailure
2080 (lazy ("Unknown mutual inductive definition:" ^
2081 UriManager.string_of_uri uri)))
2083 | C.Appl ((C.MutInd (uri,i,_))::_) ->
2084 (let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
2086 C.InductiveDefinition (itl,_,_,_) ->
2087 let (_,is_inductive,_,_) = List.nth itl i in
2088 if is_inductive then None else (Some uri)
2090 raise (TypeCheckerFailure
2091 (lazy ("Unknown mutual inductive definition:" ^
2092 UriManager.string_of_uri uri)))
2094 | C.Prod (n,so,de) ->
2095 returns_a_coinductive ~subst ((Some (n,C.Decl so))::context) de
2100 debug_print (lazy ("INIZIO TYPE_OF_AUX " ^ CicPp.ppterm t)) ; flush stderr ;
2103 type_of_aux ~logger context t ugraph
2105 in debug_print (lazy "FINE TYPE_OF_AUX") ; flush stderr ; res
2108 (* is a small constructor? *)
2109 (*CSC: ottimizzare calcolando staticamente *)
2110 and is_small_or_non_informative ~condition ~logger context paramsno c ugraph =
2111 let rec is_small_or_non_informative_aux ~logger context c ugraph =
2112 let module C = Cic in
2113 match CicReduction.whd context c with
2115 let s,ugraph1 = type_of_aux' ~logger [] context so ugraph in
2116 let b = condition s in
2118 is_small_or_non_informative_aux
2119 ~logger ((Some (n,(C.Decl so)))::context) de ugraph1
2122 | _ -> true,ugraph (*CSC: we trust the type-checker *)
2124 let (context',dx) = split_prods ~subst:[] context paramsno c in
2125 is_small_or_non_informative_aux ~logger context' dx ugraph
2127 and is_small ~logger =
2128 is_small_or_non_informative
2129 ~condition:(fun s -> s=Cic.Sort Cic.Prop || s=Cic.Sort Cic.Set)
2132 and is_non_informative ~logger =
2133 is_small_or_non_informative
2134 ~condition:(fun s -> s=Cic.Sort Cic.Prop)
2137 and type_of ~logger t ugraph =
2139 debug_print (lazy ("INIZIO TYPE_OF_AUX' " ^ CicPp.ppterm t)) ; flush stderr ;
2142 type_of_aux' ~logger [] [] t ugraph
2144 in debug_print (lazy "FINE TYPE_OF_AUX'") ; flush stderr ; res
2148 let typecheck_obj0 ~logger uri ugraph =
2149 let module C = Cic in
2151 C.Constant (_,Some te,ty,_,_) ->
2152 let _,ugraph = type_of ~logger ty ugraph in
2153 let ty_te,ugraph = type_of ~logger te ugraph in
2154 let b,ugraph = (CicReduction.are_convertible [] ty_te ty ugraph) in
2156 raise (TypeCheckerFailure
2158 ("the type of the body is not the one expected:\n" ^
2159 CicPp.ppterm ty_te ^ "\nvs\n" ^
2163 | C.Constant (_,None,ty,_,_) ->
2164 (* only to check that ty is well-typed *)
2165 let _,ugraph = type_of ~logger ty ugraph in
2167 | C.CurrentProof (_,conjs,te,ty,_,_) ->
2170 (fun (metasenv,ugraph) ((_,context,ty) as conj) ->
2172 type_of_aux' ~logger metasenv context ty ugraph
2174 metasenv @ [conj],ugraph
2177 let _,ugraph = type_of_aux' ~logger conjs [] ty ugraph in
2178 let type_of_te,ugraph =
2179 type_of_aux' ~logger conjs [] te ugraph
2181 let b,ugraph = CicReduction.are_convertible [] type_of_te ty ugraph in
2183 raise (TypeCheckerFailure (lazy (sprintf
2184 "the current proof is not well typed because the type %s of the body is not convertible to the declared type %s"
2185 (CicPp.ppterm type_of_te) (CicPp.ppterm ty))))
2188 | C.Variable (_,bo,ty,_,_) ->
2189 (* only to check that ty is well-typed *)
2190 let _,ugraph = type_of ~logger ty ugraph in
2194 let ty_bo,ugraph = type_of ~logger bo ugraph in
2195 let b,ugraph = CicReduction.are_convertible [] ty_bo ty ugraph in
2197 raise (TypeCheckerFailure
2198 (lazy "the body is not the one expected"))
2202 | (C.InductiveDefinition _ as obj) ->
2203 check_mutual_inductive_defs ~logger uri obj ugraph
2206 let module C = Cic in
2207 let module R = CicReduction in
2208 let module U = UriManager in
2209 let logger = new CicLogger.logger in
2210 (* ??? match CicEnvironment.is_type_checked ~trust:true uri with ???? *)
2211 match CicEnvironment.is_type_checked ~trust:false CicUniv.empty_ugraph uri with
2212 CicEnvironment.CheckedObj (cobj,ugraph') ->
2213 (* debug_print (lazy ("NON-INIZIO A TYPECHECKARE " ^ U.string_of_uri uri));*)
2215 | CicEnvironment.UncheckedObj uobj ->
2216 (* let's typecheck the uncooked object *)
2217 logger#log (`Start_type_checking uri) ;
2218 (* debug_print (lazy ("INIZIO A TYPECHECKARE " ^ U.string_of_uri uri)); *)
2219 let ugraph = typecheck_obj0 ~logger uri CicUniv.empty_ugraph uobj in
2221 CicEnvironment.set_type_checking_info uri;
2222 logger#log (`Type_checking_completed uri);
2223 match CicEnvironment.is_type_checked ~trust:false ugraph uri with
2224 CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
2225 | _ -> raise CicEnvironmentError
2228 this is raised if set_type_checking_info is called on an object
2229 that has no associated universe file. If we are in univ_maker
2230 phase this is OK since univ_maker will properly commit the
2233 Invalid_argument s ->
2234 (*debug_print (lazy s);*)
2238 let typecheck_obj ~logger uri obj =
2239 let ugraph = typecheck_obj0 ~logger uri CicUniv.empty_ugraph obj in
2240 let ugraph, univlist, obj = CicUnivUtils.clean_and_fill uri obj ugraph in
2241 CicEnvironment.add_type_checked_obj uri (obj,ugraph,univlist)
2243 (** wrappers which instantiate fresh loggers *)
2245 let profiler = HExtlib.profile "K/CicTypeChecker.type_of_aux'"
2247 let type_of_aux' ?(subst = []) metasenv context t ugraph =
2248 let logger = new CicLogger.logger in
2249 profiler.HExtlib.profile
2250 (type_of_aux' ~logger ~subst metasenv context t) ugraph
2252 let typecheck_obj uri obj =
2253 let logger = new CicLogger.logger in
2254 typecheck_obj ~logger uri obj
2256 (* check_allowed_sort_elimination uri i s1 s2
2257 This function is used outside the kernel to determine in advance whether
2258 a MutCase will be allowed or not.
2259 [uri,i] is the type of the term to match
2260 [s1] is the sort of the term to eliminate (i.e. the head of the arity
2261 of the inductive type [uri,i])
2262 [s2] is the sort of the goal (i.e. the head of the type of the outtype
2264 let check_allowed_sort_elimination uri i s1 s2 =
2265 fst (check_allowed_sort_elimination ~subst:[] ~metasenv:[]
2266 ~logger:(new CicLogger.logger) [] uri i true
2267 (Cic.Implicit None) (* never used *) (Cic.Sort s1) (Cic.Sort s2)
2268 CicUniv.empty_ugraph)
2271 Deannotate.type_of_aux' := fun context t -> fst (type_of_aux' [] context t CicUniv.oblivion_ugraph);;
2275 (* typechecks the object, raising an exception if illtyped *)
2276 let typecheck_obj obj = match obj with _ -> ()