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 (* TODO factorize functions to frequent errors (e.g. "Unknwon mutual inductive
33 exception AssertFailure of string Lazy.t;;
34 exception TypeCheckerFailure of string Lazy.t;;
38 let rec debug_aux t i =
40 let module U = UriManager in
41 CicPp.ppobj (C.Variable ("DEBUG", None, t, [], [])) ^ "\n" ^ i
44 raise (TypeCheckerFailure (lazy (List.fold_right debug_aux (t::context) "")))
47 let debug_print = fun _ -> ();;
52 | (he::tl, n) -> let (l1,l2) = split tl (n-1) in (he::l1,l2)
54 raise (TypeCheckerFailure (lazy "Parameters number < left parameters number"))
57 let debrujin_constructor ?(cb=fun _ _ -> ()) uri number_of_types =
62 C.Rel n as t when n <= k -> t
64 raise (TypeCheckerFailure (lazy "unbound variable found in constructor type"))
65 | C.Var (uri,exp_named_subst) ->
66 let exp_named_subst' =
67 List.map (function (uri,t) -> (uri,aux k t)) exp_named_subst
69 C.Var (uri,exp_named_subst')
71 let l' = List.map (function None -> None | Some t -> Some (aux k t)) l in
74 | C.Implicit _ as t -> t
75 | C.Cast (te,ty) -> C.Cast (aux k te, aux k ty)
76 | C.Prod (n,s,t) -> C.Prod (n, aux k s, aux (k+1) t)
77 | C.Lambda (n,s,t) -> C.Lambda (n, aux k s, aux (k+1) t)
78 | C.LetIn (n,s,ty,t) -> C.LetIn (n, aux k s, aux k ty, aux (k+1) t)
79 | C.Appl l -> C.Appl (List.map (aux k) l)
80 | C.Const (uri,exp_named_subst) ->
81 let exp_named_subst' =
82 List.map (function (uri,t) -> (uri,aux k t)) exp_named_subst
84 C.Const (uri,exp_named_subst')
85 | C.MutInd (uri',tyno,exp_named_subst) when UriManager.eq uri uri' ->
86 if exp_named_subst != [] then
87 raise (TypeCheckerFailure
88 (lazy ("non-empty explicit named substitution is applied to "^
89 "a mutual inductive type which is being defined"))) ;
90 C.Rel (k + number_of_types - tyno) ;
91 | C.MutInd (uri',tyno,exp_named_subst) ->
92 let exp_named_subst' =
93 List.map (function (uri,t) -> (uri,aux k t)) exp_named_subst
95 C.MutInd (uri',tyno,exp_named_subst')
96 | C.MutConstruct (uri,tyno,consno,exp_named_subst) ->
97 let exp_named_subst' =
98 List.map (function (uri,t) -> (uri,aux k t)) exp_named_subst
100 C.MutConstruct (uri,tyno,consno,exp_named_subst')
101 | C.MutCase (sp,i,outty,t,pl) ->
102 C.MutCase (sp, i, aux k outty, aux k t,
105 let len = List.length fl in
108 (fun (name, i, ty, bo) -> (name, i, aux k ty, aux (k+len) bo))
113 let len = List.length fl in
116 (fun (name, ty, bo) -> (name, aux k ty, aux (k+len) bo))
119 C.CoFix (i, liftedfl)
127 exception CicEnvironmentError;;
129 let rec type_of_constant ~logger uri ugraph =
130 let module C = Cic in
131 let module R = CicReduction in
132 let module U = UriManager in
134 match CicEnvironment.is_type_checked ~trust:true ugraph uri with
135 CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
136 | CicEnvironment.UncheckedObj uobj ->
137 logger#log (`Start_type_checking uri) ;
138 (* let's typecheck the uncooked obj *)
140 (****************************************************************
141 TASSI: FIXME qui e' inutile ricordarselo,
142 tanto poi lo richiediamo alla cache che da quello su disco
143 *****************************************************************)
147 C.Constant (_,Some te,ty,_,_) ->
148 let _,ugraph = type_of ~logger ty ugraph in
149 let type_of_te,ugraph' = type_of ~logger te ugraph in
150 let b',ugraph'' = (R.are_convertible [] type_of_te ty ugraph') in
152 raise (TypeCheckerFailure (lazy (sprintf
153 "the constant %s is not well typed because the type %s of the body is not convertible to the declared type %s"
154 (U.string_of_uri uri) (CicPp.ppterm type_of_te)
158 | C.Constant (_,None,ty,_,_) ->
159 (* only to check that ty is well-typed *)
160 let _,ugraph' = type_of ~logger ty ugraph in
162 | C.CurrentProof (_,conjs,te,ty,_,_) ->
165 (fun (metasenv,ugraph) ((_,context,ty) as conj) ->
167 type_of_aux' ~logger metasenv context ty ugraph
169 (metasenv @ [conj],ugraph')
172 let _,ugraph2 = type_of_aux' ~logger conjs [] ty ugraph1 in
173 let type_of_te,ugraph3 =
174 type_of_aux' ~logger conjs [] te ugraph2
176 let b,ugraph4 = (R.are_convertible [] type_of_te ty ugraph3) in
178 raise (TypeCheckerFailure (lazy (sprintf
179 "the current proof %s is not well typed because the type %s of the body is not convertible to the declared type %s"
180 (U.string_of_uri uri) (CicPp.ppterm type_of_te)
186 (TypeCheckerFailure (lazy ("Unknown constant:" ^ U.string_of_uri uri))))
189 CicEnvironment.set_type_checking_info uri;
190 logger#log (`Type_checking_completed uri) ;
191 match CicEnvironment.is_type_checked ~trust:false ugraph uri with
192 CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
193 | CicEnvironment.UncheckedObj _ -> raise CicEnvironmentError
194 with Invalid_argument s ->
195 (*debug_print (lazy s);*)
198 match cobj,ugraph with
199 (C.Constant (_,_,ty,_,_)),g -> ty,g
200 | (C.CurrentProof (_,_,_,ty,_,_)),g -> ty,g
202 raise (TypeCheckerFailure (lazy ("Unknown constant:" ^ U.string_of_uri uri)))
204 and type_of_variable ~logger uri ugraph =
205 let module C = Cic in
206 let module R = CicReduction in
207 let module U = UriManager in
208 (* 0 because a variable is never cooked => no partial cooking at one level *)
209 match CicEnvironment.is_type_checked ~trust:true ugraph uri with
210 CicEnvironment.CheckedObj ((C.Variable (_,_,ty,_,_)),ugraph') -> ty,ugraph'
211 | CicEnvironment.UncheckedObj (C.Variable (_,bo,ty,_,_)) ->
212 logger#log (`Start_type_checking uri) ;
213 (* only to check that ty is well-typed *)
214 let _,ugraph1 = type_of ~logger ty ugraph in
219 let ty_bo,ugraph' = type_of ~logger bo ugraph1 in
220 let b,ugraph'' = (R.are_convertible [] ty_bo ty ugraph') in
222 raise (TypeCheckerFailure
223 (lazy ("Unknown variable:" ^ U.string_of_uri uri)))
228 CicEnvironment.set_type_checking_info uri ;
229 logger#log (`Type_checking_completed uri) ;
230 match CicEnvironment.is_type_checked ~trust:false ugraph uri with
231 CicEnvironment.CheckedObj ((C.Variable (_,_,ty,_,_)),ugraph') ->
233 | CicEnvironment.CheckedObj _
234 | CicEnvironment.UncheckedObj _ -> raise CicEnvironmentError
235 with Invalid_argument s ->
236 (*debug_print (lazy s);*)
239 raise (TypeCheckerFailure (lazy ("Unknown variable:" ^ U.string_of_uri uri)))
241 and does_not_occur ?(subst=[]) context n nn te =
242 let module C = Cic in
244 C.Rel m when m > n && m <= nn -> false
247 (match List.nth context (m-1) with
248 Some (_,C.Def (bo,_)) ->
249 does_not_occur ~subst context n nn (CicSubstitution.lift m bo)
252 Failure _ -> assert false)
254 | C.Implicit _ -> true
260 | Some x -> i && does_not_occur ~subst context n nn x) l true &&
262 let (canonical_context,term,ty) = CicUtil.lookup_subst mno subst in
263 does_not_occur ~subst context n nn (CicSubstitution.subst_meta l term)
265 CicUtil.Subst_not_found _ -> true)
267 does_not_occur ~subst context n nn te && does_not_occur ~subst context n nn ty
268 | C.Prod (name,so,dest) ->
269 does_not_occur ~subst context n nn so &&
270 does_not_occur ~subst ((Some (name,(C.Decl so)))::context) (n + 1)
272 | C.Lambda (name,so,dest) ->
273 does_not_occur ~subst context n nn so &&
274 does_not_occur ~subst ((Some (name,(C.Decl so)))::context) (n + 1) (nn + 1)
276 | C.LetIn (name,so,ty,dest) ->
277 does_not_occur ~subst context n nn so &&
278 does_not_occur ~subst context n nn ty &&
279 does_not_occur ~subst ((Some (name,(C.Def (so,ty))))::context)
280 (n + 1) (nn + 1) dest
282 List.fold_right (fun x i -> i && does_not_occur ~subst context n nn x) l true
283 | C.Var (_,exp_named_subst)
284 | C.Const (_,exp_named_subst)
285 | C.MutInd (_,_,exp_named_subst)
286 | C.MutConstruct (_,_,_,exp_named_subst) ->
287 List.fold_right (fun (_,x) i -> i && does_not_occur ~subst context n nn x)
289 | C.MutCase (_,_,out,te,pl) ->
290 does_not_occur ~subst context n nn out && does_not_occur ~subst context n nn te &&
291 List.fold_right (fun x i -> i && does_not_occur ~subst context n nn x) pl true
293 let len = List.length fl in
294 let n_plus_len = n + len in
295 let nn_plus_len = nn + len in
298 (fun (types,len) (n,_,ty,_) ->
299 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
304 (fun (_,_,ty,bo) i ->
305 i && does_not_occur ~subst context n nn ty &&
306 does_not_occur ~subst (tys @ context) n_plus_len nn_plus_len bo
309 let len = List.length fl in
310 let n_plus_len = n + len in
311 let nn_plus_len = nn + len in
314 (fun (types,len) (n,ty,_) ->
315 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
321 i && does_not_occur ~subst context n nn ty &&
322 does_not_occur ~subst (tys @ context) n_plus_len nn_plus_len bo
325 (*CSC l'indice x dei tipi induttivi e' t.c. n < x <= nn *)
326 (*CSC questa funzione e' simile alla are_all_occurrences_positive, ma fa *)
327 (*CSC dei controlli leggermente diversi. Viene invocata solamente dalla *)
328 (*CSC strictly_positive *)
329 (*CSC definizione (giusta???) tratta dalla mail di Hugo ;-) *)
330 and weakly_positive context n nn uri te =
331 let module C = Cic in
332 (*CSC: Che schifo! Bisogna capire meglio e trovare una soluzione ragionevole!*)
334 C.MutInd (HelmLibraryObjects.Datatypes.nat_URI,0,[])
336 (*CSC: mettere in cicSubstitution *)
337 let rec subst_inductive_type_with_dummy_mutind =
339 C.MutInd (uri',0,_) when UriManager.eq uri' uri ->
341 | C.Appl ((C.MutInd (uri',0,_))::tl) when UriManager.eq uri' uri ->
343 | C.Cast (te,ty) -> subst_inductive_type_with_dummy_mutind te
344 | C.Prod (name,so,ta) ->
345 C.Prod (name, subst_inductive_type_with_dummy_mutind so,
346 subst_inductive_type_with_dummy_mutind ta)
347 | C.Lambda (name,so,ta) ->
348 C.Lambda (name, subst_inductive_type_with_dummy_mutind so,
349 subst_inductive_type_with_dummy_mutind ta)
350 | C.LetIn (name,so,ty,ta) ->
351 C.LetIn (name, subst_inductive_type_with_dummy_mutind so,
352 subst_inductive_type_with_dummy_mutind ty,
353 subst_inductive_type_with_dummy_mutind ta)
355 C.Appl (List.map subst_inductive_type_with_dummy_mutind tl)
356 | C.MutCase (uri,i,outtype,term,pl) ->
358 subst_inductive_type_with_dummy_mutind outtype,
359 subst_inductive_type_with_dummy_mutind term,
360 List.map subst_inductive_type_with_dummy_mutind pl)
362 C.Fix (i,List.map (fun (name,i,ty,bo) -> (name,i,
363 subst_inductive_type_with_dummy_mutind ty,
364 subst_inductive_type_with_dummy_mutind bo)) fl)
366 C.CoFix (i,List.map (fun (name,ty,bo) -> (name,
367 subst_inductive_type_with_dummy_mutind ty,
368 subst_inductive_type_with_dummy_mutind bo)) fl)
369 | C.Const (uri,exp_named_subst) ->
370 let exp_named_subst' =
372 (function (uri,t) -> (uri,subst_inductive_type_with_dummy_mutind t))
375 C.Const (uri,exp_named_subst')
376 | C.Var (uri,exp_named_subst) ->
377 let exp_named_subst' =
379 (function (uri,t) -> (uri,subst_inductive_type_with_dummy_mutind t))
382 C.Var (uri,exp_named_subst')
383 | C.MutInd (uri,typeno,exp_named_subst) ->
384 let exp_named_subst' =
386 (function (uri,t) -> (uri,subst_inductive_type_with_dummy_mutind t))
389 C.MutInd (uri,typeno,exp_named_subst')
390 | C.MutConstruct (uri,typeno,consno,exp_named_subst) ->
391 let exp_named_subst' =
393 (function (uri,t) -> (uri,subst_inductive_type_with_dummy_mutind t))
396 C.MutConstruct (uri,typeno,consno,exp_named_subst')
399 match CicReduction.whd context te with
401 C.Appl ((C.MutInd (uri',0,_))::tl) when UriManager.eq uri' uri -> true
403 C.Appl ((C.MutInd (uri',_,_))::tl) when UriManager.eq uri' uri -> true
404 | C.MutInd (uri',0,_) when UriManager.eq uri' uri -> true
405 | C.Prod (name,source,dest) when
406 does_not_occur ((Some (name,(C.Decl source)))::context) 0 1 dest ->
407 (* dummy abstraction, so we behave as in the anonimous case *)
408 strictly_positive context n nn
409 (subst_inductive_type_with_dummy_mutind source) &&
410 weakly_positive ((Some (name,(C.Decl source)))::context)
411 (n + 1) (nn + 1) uri dest
412 | C.Prod (name,source,dest) ->
413 does_not_occur context n nn
414 (subst_inductive_type_with_dummy_mutind source)&&
415 weakly_positive ((Some (name,(C.Decl source)))::context)
416 (n + 1) (nn + 1) uri dest
418 raise (TypeCheckerFailure (lazy "Malformed inductive constructor type"))
420 (* instantiate_parameters ps (x1:T1)...(xn:Tn)C *)
421 (* returns ((x_|ps|:T_|ps|)...(xn:Tn)C){ps_1 / x1 ; ... ; ps_|ps| / x_|ps|} *)
422 and instantiate_parameters params c =
423 let module C = Cic in
424 match (c,params) with
426 | (C.Prod (_,_,ta), he::tl) ->
427 instantiate_parameters tl
428 (CicSubstitution.subst he ta)
429 | (C.Cast (te,_), _) -> instantiate_parameters params te
430 | (t,l) -> raise (AssertFailure (lazy "1"))
432 and strictly_positive context n nn te =
433 let module C = Cic in
434 let module U = UriManager in
435 match CicReduction.whd context te with
436 | t when does_not_occur context n nn t -> true
439 (*CSC: bisogna controllare ty????*)
440 strictly_positive context n nn te
441 | C.Prod (name,so,ta) ->
442 does_not_occur context n nn so &&
443 strictly_positive ((Some (name,(C.Decl so)))::context) (n+1) (nn+1) ta
444 | C.Appl ((C.Rel m)::tl) when m > n && m <= nn ->
445 List.fold_right (fun x i -> i && does_not_occur context n nn x) tl true
446 | C.Appl ((C.MutInd (uri,i,exp_named_subst))::_)
447 | (C.MutInd (uri,i,exp_named_subst)) as t ->
448 let tl = match t with C.Appl (_::tl) -> tl | _ -> [] in
449 let (ok,paramsno,ity,cl,name) =
450 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
452 C.InductiveDefinition (tl,_,paramsno,_) ->
453 let (name,_,ity,cl) = List.nth tl i in
454 (List.length tl = 1, paramsno, ity, cl, name)
455 (* (true, paramsno, ity, cl, name) *)
459 (lazy ("Unknown inductive type:" ^ U.string_of_uri uri)))
461 let (params,arguments) = split tl paramsno in
462 let lifted_params = List.map (CicSubstitution.lift 1) params in
466 instantiate_parameters lifted_params
467 (CicSubstitution.subst_vars exp_named_subst te)
472 (fun x i -> i && does_not_occur context n nn x)
478 ((Some (C.Name name,(Cic.Decl ity)))::context) (n+1) (nn+1) uri
483 (* the inductive type indexes are s.t. n < x <= nn *)
484 and are_all_occurrences_positive context uri indparamsno i n nn te =
485 let module C = Cic in
486 match CicReduction.whd context te with
487 C.Appl ((C.Rel m)::tl) when m = i ->
488 (*CSC: riscrivere fermandosi a 0 *)
489 (* let's check if the inductive type is applied at least to *)
490 (* indparamsno parameters *)
496 match CicReduction.whd context x with
497 C.Rel m when m = n - (indparamsno - k) -> k - 1
499 raise (TypeCheckerFailure
501 ("Non-positive occurence in mutual inductive definition(s) [1]" ^
502 UriManager.string_of_uri uri)))
506 List.fold_right (fun x i -> i && does_not_occur context n nn x) tl true
508 raise (TypeCheckerFailure
509 (lazy ("Non-positive occurence in mutual inductive definition(s) [2]"^
510 UriManager.string_of_uri uri)))
511 | C.Rel m when m = i ->
512 if indparamsno = 0 then
515 raise (TypeCheckerFailure
516 (lazy ("Non-positive occurence in mutual inductive definition(s) [3]"^
517 UriManager.string_of_uri uri)))
518 | C.Prod (name,source,dest) when
519 does_not_occur ((Some (name,(C.Decl source)))::context) 0 1 dest ->
520 (* dummy abstraction, so we behave as in the anonimous case *)
521 strictly_positive context n nn source &&
522 are_all_occurrences_positive
523 ((Some (name,(C.Decl source)))::context) uri indparamsno
524 (i+1) (n + 1) (nn + 1) dest
525 | C.Prod (name,source,dest) ->
526 does_not_occur context n nn source &&
527 are_all_occurrences_positive ((Some (name,(C.Decl source)))::context)
528 uri indparamsno (i+1) (n + 1) (nn + 1) dest
531 (TypeCheckerFailure (lazy ("Malformed inductive constructor type " ^
532 (UriManager.string_of_uri uri))))
534 (* Main function to checks the correctness of a mutual *)
535 (* inductive block definition. This is the function *)
536 (* exported to the proof-engine. *)
537 and typecheck_mutual_inductive_defs ~logger uri (itl,_,indparamsno) ugraph =
538 let module U = UriManager in
539 (* let's check if the arity of the inductive types are well *)
541 let ugrap1 = List.fold_left
542 (fun ugraph (_,_,x,_) -> let _,ugraph' =
543 type_of ~logger x ugraph in ugraph')
546 (* let's check if the types of the inductive constructors *)
547 (* are well formed. *)
548 (* In order not to use type_of_aux we put the types of the *)
549 (* mutual inductive types at the head of the types of the *)
550 (* constructors using Prods *)
551 let len = List.length itl in
553 List.map (fun (n,_,ty,_) -> Some (Cic.Name n,(Cic.Decl ty))) itl in
556 (fun (_,_,_,cl) (i,ugraph) ->
559 (fun ugraph (name,te) ->
560 let debrujinedte = debrujin_constructor uri len te in
563 (fun (name,_,ty,_) i -> Cic.Prod (Cic.Name name, ty, i))
566 let _,ugraph' = type_of ~logger augmented_term ugraph in
567 (* let's check also the positivity conditions *)
570 (are_all_occurrences_positive tys uri indparamsno i 0 len
574 prerr_endline (UriManager.string_of_uri uri);
575 prerr_endline (string_of_int (List.length tys));
578 (lazy ("Non positive occurence in " ^ U.string_of_uri uri))) end
587 (* Main function to checks the correctness of a mutual *)
588 (* inductive block definition. *)
589 and check_mutual_inductive_defs uri obj ugraph =
591 Cic.InductiveDefinition (itl, params, indparamsno, _) ->
592 typecheck_mutual_inductive_defs uri (itl,params,indparamsno) ugraph
594 raise (TypeCheckerFailure (
595 lazy ("Unknown mutual inductive definition:" ^
596 UriManager.string_of_uri uri)))
598 and type_of_mutual_inductive_defs ~logger uri i ugraph =
599 let module C = Cic in
600 let module R = CicReduction in
601 let module U = UriManager in
603 match CicEnvironment.is_type_checked ~trust:true ugraph uri with
604 CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
605 | CicEnvironment.UncheckedObj uobj ->
606 logger#log (`Start_type_checking uri) ;
608 check_mutual_inductive_defs ~logger uri uobj ugraph
610 (* TASSI: FIXME: check ugraph1 == ugraph ritornato da env *)
612 CicEnvironment.set_type_checking_info uri ;
613 logger#log (`Type_checking_completed uri) ;
614 (match CicEnvironment.is_type_checked ~trust:false ugraph uri with
615 CicEnvironment.CheckedObj (cobj,ugraph') -> (cobj,ugraph')
616 | CicEnvironment.UncheckedObj _ -> raise CicEnvironmentError
619 Invalid_argument s ->
620 (*debug_print (lazy s);*)
624 C.InductiveDefinition (dl,_,_,_) ->
625 let (_,_,arity,_) = List.nth dl i in
628 raise (TypeCheckerFailure
629 (lazy ("Unknown mutual inductive definition:" ^ U.string_of_uri uri)))
631 and type_of_mutual_inductive_constr ~logger uri i j ugraph =
632 let module C = Cic in
633 let module R = CicReduction in
634 let module U = UriManager in
636 match CicEnvironment.is_type_checked ~trust:true ugraph uri with
637 CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
638 | CicEnvironment.UncheckedObj uobj ->
639 logger#log (`Start_type_checking uri) ;
641 check_mutual_inductive_defs ~logger uri uobj ugraph
643 (* check ugraph1 validity ??? == ugraph' *)
645 CicEnvironment.set_type_checking_info uri ;
646 logger#log (`Type_checking_completed uri) ;
648 CicEnvironment.is_type_checked ~trust:false ugraph uri
650 CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
651 | CicEnvironment.UncheckedObj _ ->
652 raise CicEnvironmentError)
654 Invalid_argument s ->
655 (*debug_print (lazy s);*)
659 C.InductiveDefinition (dl,_,_,_) ->
660 let (_,_,_,cl) = List.nth dl i in
661 let (_,ty) = List.nth cl (j-1) in
664 raise (TypeCheckerFailure
665 (lazy ("Unknown mutual inductive definition:" ^ UriManager.string_of_uri uri)))
667 and recursive_args context n nn te =
668 let module C = Cic in
669 match CicReduction.whd context te with
675 | C.Cast _ (*CSC ??? *) ->
676 raise (AssertFailure (lazy "3")) (* due to type-checking *)
677 | C.Prod (name,so,de) ->
678 (not (does_not_occur context n nn so)) ::
679 (recursive_args ((Some (name,(C.Decl so)))::context) (n+1) (nn + 1) de)
682 raise (AssertFailure (lazy "4")) (* due to type-checking *)
684 | C.Const _ -> raise (AssertFailure (lazy "5"))
689 | C.CoFix _ -> raise (AssertFailure (lazy "6")) (* due to type-checking *)
691 and get_new_safes ~subst context p c rl safes n nn x =
692 let module C = Cic in
693 let module U = UriManager in
694 let module R = CicReduction in
695 match (R.whd ~subst context c, R.whd ~subst context p, rl) with
696 (C.Prod (_,so,ta1), C.Lambda (name,_,ta2), b::tl) ->
697 (* we are sure that the two sources are convertible because we *)
698 (* have just checked this. So let's go along ... *)
700 List.map (fun x -> x + 1) safes
703 if b then 1::safes' else safes'
705 get_new_safes ~subst ((Some (name,(C.Decl so)))::context)
706 ta2 ta1 tl safes'' (n+1) (nn+1) (x+1)
707 | (C.Prod _, (C.MutConstruct _ as e), _)
708 | (C.Prod _, (C.Rel _ as e), _)
709 | (C.MutInd _, e, [])
710 | (C.Appl _, e, []) -> (e,safes,n,nn,x,context)
712 (* CSC: If the next exception is raised, it just means that *)
713 (* CSC: the proof-assistant allows to use very strange things *)
714 (* CSC: as a branch of a case whose type is a Prod. In *)
715 (* CSC: particular, this means that a new (C.Prod, x,_) case *)
716 (* CSC: must be considered in this match. (e.g. x = MutCase) *)
719 (Printf.sprintf "Get New Safes: c=%s ; p=%s"
720 (CicPp.ppterm c) (CicPp.ppterm p))))
722 and split_prods ~subst context n te =
723 let module C = Cic in
724 let module R = CicReduction in
725 match (n, R.whd ~subst context te) with
727 | (n, C.Prod (name,so,ta)) when n > 0 ->
728 split_prods ~subst ((Some (name,(C.Decl so)))::context) (n - 1) ta
729 | (_, _) -> raise (AssertFailure (lazy "8"))
731 and eat_lambdas ~subst context n te =
732 let module C = Cic in
733 let module R = CicReduction in
734 match (n, R.whd ~subst context te) with
735 (0, _) -> (te, 0, context)
736 | (n, C.Lambda (name,so,ta)) when n > 0 ->
737 let (te, k, context') =
738 eat_lambdas ~subst ((Some (name,(C.Decl so)))::context) (n - 1) ta
740 (te, k + 1, context')
742 raise (AssertFailure (lazy (sprintf "9 (%d, %s)" n (CicPp.ppterm te))))
744 and check_is_really_smaller_arg ~subst context n nn kl x safes te =
745 let module C = Cic in
746 let module U = UriManager in
747 (*CSC: we could perform beta-iota(-zeta?) immediately, and
748 delta only on-demand when it fails without *)
749 match CicReduction.whd ~subst context te with
750 C.Rel m when List.mem m safes -> true
756 | C.Lambda (name,ty,ta) ->
757 check_is_really_smaller_arg ~subst (Some (name,Cic.Decl ty)::context)
758 (n+1) (nn+1) kl (x+1) (List.map (fun n -> n+1) safes) ta
759 | C.MutCase (uri,i,outtype,term,pl) ->
761 C.Rel m | C.Appl ((C.Rel m)::_) when List.mem m safes || m = x ->
762 let (lefts_and_tys,len,isinductive,paramsno,cl) =
763 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
765 C.InductiveDefinition (tl,_,paramsno,_) ->
766 let (_,isinductive,_,cl) = List.nth tl i in
768 List.map (fun (n,_,ty,_) ->
769 Some(Cic.Name n,(Cic.Decl ty))) tl
774 (id, snd (split_prods ~subst tys paramsno ty))) cl in
779 fst (split_prods ~subst [] paramsno ty)
781 (lefts@tys,List.length tl,isinductive,paramsno,cl')
783 raise (TypeCheckerFailure
784 (lazy ("Unknown mutual inductive definition:" ^
785 UriManager.string_of_uri uri)))
787 if not isinductive then
790 i && check_is_really_smaller_arg ~subst context n nn kl x safes p)
796 let debrujinedte = debrujin_constructor uri len c in
797 recursive_args lefts_and_tys paramsno
798 (len+paramsno) debrujinedte
800 let (e, safes',n',nn',x',context') =
801 get_new_safes ~subst context p c rl' safes n nn x
803 check_is_really_smaller_arg
804 ~subst context' n' nn' kl x' safes' e
809 i && check_is_really_smaller_arg ~subst context n nn kl x safes p
813 let len = List.length fl in
814 let n_plus_len = n + len
815 and nn_plus_len = nn + len
816 and x_plus_len = x + len
819 (fun (types,len) (n,_,ty,_) ->
820 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
823 and safes' = List.map (fun x -> x + len) safes in
827 check_is_really_smaller_arg ~subst (tys@context) n_plus_len nn_plus_len kl
831 raise (AssertFailure (lazy ("An inhabitant of an inductive type in normal form cannot have this shape: " ^ CicPp.ppterm t)))
833 and guarded_by_destructors ~subst context n nn kl x safes t =
834 let module C = Cic in
835 let module U = UriManager in
836 match CicReduction.whd ~subst context t with
837 C.Rel m when m > n && m <= nn -> false
839 (match List.nth context (m-1) with
840 Some (_,C.Decl _) -> true
841 | Some (_,C.Def (bo,_)) ->
842 guarded_by_destructors ~subst context n nn kl x safes
843 (CicSubstitution.lift m bo)
844 | None -> raise (TypeCheckerFailure (lazy "Reference to deleted hypothesis"))
848 | C.Implicit _ -> true
850 guarded_by_destructors ~subst context n nn kl x safes te &&
851 guarded_by_destructors ~subst context n nn kl x safes ty
852 | C.Prod (name,so,ta) ->
853 guarded_by_destructors ~subst context n nn kl x safes so &&
854 guarded_by_destructors ~subst ((Some (name,(C.Decl so)))::context)
855 (n+1) (nn+1) kl (x+1) (List.map (fun x -> x + 1) safes) ta
856 | C.Lambda (name,so,ta) ->
857 guarded_by_destructors ~subst context n nn kl x safes so &&
858 guarded_by_destructors ~subst ((Some (name,(C.Decl so)))::context)
859 (n+1) (nn+1) kl (x+1) (List.map (fun x -> x + 1) safes) ta
860 | C.LetIn (name,so,ty,ta) ->
861 guarded_by_destructors ~subst context n nn kl x safes so &&
862 guarded_by_destructors ~subst context n nn kl x safes ty &&
863 guarded_by_destructors ~subst ((Some (name,(C.Def (so,ty))))::context)
864 (n+1) (nn+1) kl (x+1) (List.map (fun x -> x + 1) safes) ta
865 | C.Appl ((C.Rel m)::tl) when m > n && m <= nn ->
866 let k = List.nth kl (m - n - 1) in
867 if not (List.length tl > k) then false
871 i && guarded_by_destructors ~subst context n nn kl x safes param
873 check_is_really_smaller_arg ~subst context n nn kl x safes (List.nth tl k)
874 | C.Var (_,exp_named_subst)
875 | C.Const (_,exp_named_subst)
876 | C.MutInd (_,_,exp_named_subst)
877 | C.MutConstruct (_,_,_,exp_named_subst) ->
879 (fun (_,t) -> guarded_by_destructors ~subst context n nn kl x safes t)
881 | C.MutCase (uri,i,outtype,term,pl) ->
882 (match CicReduction.whd ~subst context term with
884 | C.Appl ((C.Rel m)::_) as t when List.mem m safes || m = x ->
885 let tl = match t with C.Appl (_::tl) -> tl | _ -> [] in
887 (guarded_by_destructors ~subst context n nn kl x safes)
889 let (lefts_and_tys,len,isinductive,paramsno,cl) =
890 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
892 C.InductiveDefinition (tl,_,paramsno,_) ->
893 let (_,isinductive,_,cl) = List.nth tl i in
896 (fun (n,_,ty,_) -> Some(Cic.Name n,(Cic.Decl ty))) tl
901 (id, snd (split_prods ~subst tys paramsno ty))) cl in
906 fst (split_prods ~subst [] paramsno ty)
908 (lefts@tys,List.length tl,isinductive,paramsno,cl')
910 raise (TypeCheckerFailure
911 (lazy ("Unknown mutual inductive definition:" ^
912 UriManager.string_of_uri uri)))
914 if not isinductive then
915 guarded_by_destructors ~subst context n nn kl x safes outtype &&
916 guarded_by_destructors ~subst context n nn kl x safes term &&
918 (guarded_by_destructors ~subst context n nn kl x safes)
921 guarded_by_destructors ~subst context n nn kl x safes outtype &&
925 let debrujinedte = debrujin_constructor uri len c in
926 recursive_args lefts_and_tys paramsno
927 (len+paramsno) debrujinedte
929 let (e, safes',n',nn',x',context') =
930 get_new_safes ~subst context p c rl' safes n nn x
932 guarded_by_destructors ~subst context' n' nn' kl x' safes' e
935 guarded_by_destructors ~subst context n nn kl x safes outtype &&
936 guarded_by_destructors ~subst context n nn kl x safes term &&
937 (*CSC: manca ??? il controllo sul tipo di term? *)
939 (fun p i -> i && guarded_by_destructors ~subst context n nn kl x safes p)
942 | C.Appl (C.Fix (fixno, fl)::_) | C.Fix (fixno,fl) as t->
943 let l = match t with C.Appl (_::tl) -> tl | _ -> [] in
944 let len = List.length fl in
945 let n_plus_len = n + len in
946 let nn_plus_len = nn + len in
947 let x_plus_len = x + len in
950 (fun (types,len) (n,_,ty,_) ->
951 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
954 let safes' = List.map (fun x -> x + len) safes in
956 (guarded_by_destructors ~subst context n nn kl x safes) l &&
958 (fun (fixno',i) (_,recno,ty,bo) ->
961 guarded_by_destructors ~subst context n nn kl x_plus_len safes' ty &&
964 List.length l > recno &&
965 (*case where the recursive argument is already really_smaller *)
966 check_is_really_smaller_arg ~subst context n nn kl x safes
969 let bo_without_lambdas,_,context =
970 eat_lambdas ~subst (tys@context) (recno+1) bo
972 (* we assume the formal argument to be safe *)
973 guarded_by_destructors ~subst context (n_plus_len+recno+1)
974 (nn_plus_len+recno+1) kl (x_plus_len+recno+1)
975 (1::List.map (fun x -> x+recno+1) safes')
978 guarded_by_destructors ~subst (tys@context) n_plus_len nn_plus_len
979 kl x_plus_len safes' bo
982 let len = List.length fl in
983 let n_plus_len = n + len
984 and nn_plus_len = nn + len
985 and x_plus_len = x + len
988 (fun (types,len) (n,ty,_) ->
989 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
992 and safes' = List.map (fun x -> x + len) safes in
996 guarded_by_destructors ~subst context n nn kl x_plus_len safes' ty &&
997 guarded_by_destructors ~subst (tys@context) n_plus_len nn_plus_len kl
1002 (fun t i -> i && guarded_by_destructors ~subst context n nn kl x safes t)
1005 (* the boolean h means already protected *)
1006 (* args is the list of arguments the type of the constructor that may be *)
1007 (* found in head position must be applied to. *)
1008 and guarded_by_constructors ~subst context n nn h te args coInductiveTypeURI =
1009 let module C = Cic in
1010 (*CSC: There is a lot of code replication between the cases X and *)
1011 (*CSC: (C.Appl X tl). Maybe it will be better to define a function *)
1012 (*CSC: that maps X into (C.Appl X []) when X is not already a C.Appl *)
1013 match CicReduction.whd ~subst context te with
1014 C.Rel m when m > n && m <= nn -> h
1022 (* the term has just been type-checked *)
1023 raise (AssertFailure (lazy "17"))
1024 | C.Lambda (name,so,de) ->
1025 does_not_occur ~subst context n nn so &&
1026 guarded_by_constructors ~subst ((Some (name,(C.Decl so)))::context)
1027 (n + 1) (nn + 1) h de args coInductiveTypeURI
1028 | C.Appl ((C.Rel m)::tl) when m > n && m <= nn ->
1030 List.fold_right (fun x i -> i && does_not_occur ~subst context n nn x) tl true
1031 | C.Appl ((C.MutConstruct (uri,i,j,exp_named_subst))::tl) ->
1035 CicEnvironment.get_cooked_obj ~trust:false CicUniv.empty_ugraph uri
1036 with Not_found -> assert false
1039 C.InductiveDefinition (itl,_,_,_) ->
1040 let (_,_,_,cl) = List.nth itl i in
1041 let (_,cons) = List.nth cl (j - 1) in
1042 CicSubstitution.subst_vars exp_named_subst cons
1044 raise (TypeCheckerFailure
1045 (lazy ("Unknown mutual inductive definition:" ^ UriManager.string_of_uri uri)))
1047 let rec analyse_branch context ty te =
1048 match CicReduction.whd ~subst context ty with
1049 C.Meta _ -> raise (AssertFailure (lazy "34"))
1053 does_not_occur ~subst context n nn te
1056 raise (AssertFailure (lazy "24"))(* due to type-checking *)
1057 | C.Prod (name,so,de) ->
1058 analyse_branch ((Some (name,(C.Decl so)))::context) de te
1061 raise (AssertFailure (lazy "25"))(* due to type-checking *)
1062 | C.Appl ((C.MutInd (uri,_,_))::_) when uri == coInductiveTypeURI ->
1063 guarded_by_constructors ~subst context n nn true te []
1065 | C.Appl ((C.MutInd (uri,_,_))::_) ->
1066 guarded_by_constructors ~subst context n nn true te tl
1069 does_not_occur ~subst context n nn te
1070 | C.Const _ -> raise (AssertFailure (lazy "26"))
1071 | C.MutInd (uri,_,_) when uri == coInductiveTypeURI ->
1072 guarded_by_constructors ~subst context n nn true te []
1075 does_not_occur ~subst context n nn te
1076 | C.MutConstruct _ -> raise (AssertFailure (lazy "27"))
1077 (*CSC: we do not consider backbones with a MutCase, Fix, Cofix *)
1078 (*CSC: in head position. *)
1082 raise (AssertFailure (lazy "28"))(* due to type-checking *)
1084 let rec analyse_instantiated_type context ty l =
1085 match CicReduction.whd ~subst context ty with
1091 | C.Cast _ -> raise (AssertFailure (lazy "29"))(* due to type-checking *)
1092 | C.Prod (name,so,de) ->
1097 analyse_branch context so he &&
1098 analyse_instantiated_type
1099 ((Some (name,(C.Decl so)))::context) de tl
1103 raise (AssertFailure (lazy "30"))(* due to type-checking *)
1106 (fun i x -> i && does_not_occur ~subst context n nn x) true l
1107 | C.Const _ -> raise (AssertFailure (lazy "31"))
1110 (fun i x -> i && does_not_occur ~subst context n nn x) true l
1111 | C.MutConstruct _ -> raise (AssertFailure (lazy "32"))
1112 (*CSC: we do not consider backbones with a MutCase, Fix, Cofix *)
1113 (*CSC: in head position. *)
1117 raise (AssertFailure (lazy "33"))(* due to type-checking *)
1119 let rec instantiate_type args consty =
1122 | tlhe::tltl as l ->
1123 let consty' = CicReduction.whd ~subst context consty in
1129 let instantiated_de = CicSubstitution.subst he de in
1130 (*CSC: siamo sicuri che non sia troppo forte? *)
1131 does_not_occur ~subst context n nn tlhe &
1132 instantiate_type tl instantiated_de tltl
1134 (*CSC:We do not consider backbones with a MutCase, a *)
1135 (*CSC:FixPoint, a CoFixPoint and so on in head position.*)
1136 raise (AssertFailure (lazy "23"))
1138 | [] -> analyse_instantiated_type context consty' l
1139 (* These are all the other cases *)
1141 instantiate_type args consty tl
1142 | C.Appl ((C.CoFix (_,fl))::tl) ->
1143 List.fold_left (fun i x -> i && does_not_occur ~subst context n nn x) true tl &&
1144 let len = List.length fl in
1145 let n_plus_len = n + len
1146 and nn_plus_len = nn + len
1147 (*CSC: Is a Decl of the ty ok or should I use Def of a Fix? *)
1150 (fun (types,len) (n,ty,_) ->
1151 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
1157 i && does_not_occur ~subst context n nn ty &&
1158 guarded_by_constructors ~subst (tys@context) n_plus_len nn_plus_len
1159 h bo args coInductiveTypeURI
1161 | C.Appl ((C.MutCase (_,_,out,te,pl))::tl) ->
1162 List.fold_left (fun i x -> i && does_not_occur ~subst context n nn x) true tl &&
1163 does_not_occur ~subst context n nn out &&
1164 does_not_occur ~subst context n nn te &&
1168 guarded_by_constructors ~subst context n nn h x args
1172 List.fold_right (fun x i -> i && does_not_occur ~subst context n nn x) l true
1173 | C.Var (_,exp_named_subst)
1174 | C.Const (_,exp_named_subst) ->
1176 (fun (_,x) i -> i && does_not_occur ~subst context n nn x) exp_named_subst true
1177 | C.MutInd _ -> assert false
1178 | C.MutConstruct (_,_,_,exp_named_subst) ->
1180 (fun (_,x) i -> i && does_not_occur ~subst context n nn x) exp_named_subst true
1181 | C.MutCase (_,_,out,te,pl) ->
1182 does_not_occur ~subst context n nn out &&
1183 does_not_occur ~subst context n nn te &&
1187 guarded_by_constructors ~subst context n nn h x args
1191 let len = List.length fl in
1192 let n_plus_len = n + len
1193 and nn_plus_len = nn + len
1194 (*CSC: Is a Decl of the ty ok or should I use Def of a Fix? *)
1197 (fun (types,len) (n,_,ty,_) ->
1198 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
1203 (fun (_,_,ty,bo) i ->
1204 i && does_not_occur ~subst context n nn ty &&
1205 does_not_occur ~subst (tys@context) n_plus_len nn_plus_len bo
1208 let len = List.length fl in
1209 let n_plus_len = n + len
1210 and nn_plus_len = nn + len
1211 (*CSC: Is a Decl of the ty ok or should I use Def of a Fix? *)
1214 (fun (types,len) (n,ty,_) ->
1215 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
1221 i && does_not_occur ~subst context n nn ty &&
1222 guarded_by_constructors ~subst (tys@context) n_plus_len nn_plus_len
1224 args coInductiveTypeURI
1227 and check_allowed_sort_elimination ~subst ~metasenv ~logger context uri i
1228 need_dummy ind arity1 arity2 ugraph =
1229 let module C = Cic in
1230 let module U = UriManager in
1231 let arity1 = CicReduction.whd ~subst context arity1 in
1232 let rec check_allowed_sort_elimination_aux ugraph context arity2 need_dummy =
1233 match arity1, CicReduction.whd ~subst context arity2 with
1234 (C.Prod (name,so1,de1), C.Prod (_,so2,de2)) ->
1236 CicReduction.are_convertible ~subst ~metasenv context so1 so2 ugraph in
1238 check_allowed_sort_elimination ~subst ~metasenv ~logger
1239 ((Some (name,C.Decl so1))::context) uri i
1240 need_dummy (C.Appl [CicSubstitution.lift 1 ind ; C.Rel 1]) de1 de2
1244 | (C.Sort _, C.Prod (name,so,ta)) when not need_dummy ->
1246 CicReduction.are_convertible ~subst ~metasenv context so ind ugraph in
1250 check_allowed_sort_elimination_aux ugraph1
1251 ((Some (name,C.Decl so))::context) ta true
1252 | (C.Sort C.Prop, C.Sort C.Prop) when need_dummy -> true,ugraph
1253 | (C.Sort C.Prop, C.Sort C.Set)
1254 | (C.Sort C.Prop, C.Sort C.CProp)
1255 | (C.Sort C.Prop, C.Sort (C.Type _) ) when need_dummy ->
1256 (let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
1258 C.InductiveDefinition (itl,_,paramsno,_) ->
1259 let itl_len = List.length itl in
1260 let (name,_,ty,cl) = List.nth itl i in
1261 let cl_len = List.length cl in
1262 if (cl_len = 0 || (itl_len = 1 && cl_len = 1)) then
1263 let non_informative,ugraph =
1264 if cl_len = 0 then true,ugraph
1266 is_non_informative ~logger [Some (C.Name name,C.Decl ty)]
1267 paramsno (snd (List.nth cl 0)) ugraph
1269 (* is it a singleton or empty non recursive and non informative
1271 non_informative, ugraph
1275 raise (TypeCheckerFailure
1276 (lazy ("Unknown mutual inductive definition:" ^
1277 UriManager.string_of_uri uri)))
1279 | (C.Sort C.Set, C.Sort C.Prop) when need_dummy -> true , ugraph
1280 | (C.Sort C.CProp, C.Sort C.Prop) when need_dummy -> true , ugraph
1281 | (C.Sort C.Set, C.Sort C.Set) when need_dummy -> true , ugraph
1282 | (C.Sort C.Set, C.Sort C.CProp) when need_dummy -> true , ugraph
1283 | (C.Sort C.CProp, C.Sort C.Set) when need_dummy -> true , ugraph
1284 | (C.Sort C.CProp, C.Sort C.CProp) when need_dummy -> true , ugraph
1285 | ((C.Sort C.Set, C.Sort (C.Type _)) | (C.Sort C.CProp, C.Sort (C.Type _)))
1287 (let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
1289 C.InductiveDefinition (itl,_,paramsno,_) ->
1291 List.map (fun (n,_,ty,_) -> Some (Cic.Name n,(Cic.Decl ty))) itl
1293 let (_,_,_,cl) = List.nth itl i in
1295 (fun (_,x) (i,ugraph) ->
1297 is_small ~logger tys paramsno x ugraph
1302 raise (TypeCheckerFailure
1303 (lazy ("Unknown mutual inductive definition:" ^
1304 UriManager.string_of_uri uri)))
1306 | (C.Sort (C.Type _), C.Sort _) when need_dummy -> true , ugraph
1307 | (_,_) -> false,ugraph
1309 check_allowed_sort_elimination_aux ugraph context arity2 need_dummy
1311 and type_of_branch ~subst context argsno need_dummy outtype term constype =
1312 let module C = Cic in
1313 let module R = CicReduction in
1314 match R.whd ~subst context constype with
1319 C.Appl [outtype ; term]
1320 | C.Appl (C.MutInd (_,_,_)::tl) ->
1321 let (_,arguments) = split tl argsno
1323 if need_dummy && arguments = [] then
1326 C.Appl (outtype::arguments@(if need_dummy then [] else [term]))
1327 | C.Prod (name,so,de) ->
1329 match CicSubstitution.lift 1 term with
1330 C.Appl l -> C.Appl (l@[C.Rel 1])
1331 | t -> C.Appl [t ; C.Rel 1]
1333 C.Prod (name,so,type_of_branch ~subst
1334 ((Some (name,(C.Decl so)))::context) argsno need_dummy
1335 (CicSubstitution.lift 1 outtype) term' de)
1336 | _ -> raise (AssertFailure (lazy "20"))
1338 (* check_metasenv_consistency checks that the "canonical" context of a
1339 metavariable is consitent - up to relocation via the relocation list l -
1340 with the actual context *)
1343 and check_metasenv_consistency ~logger ~subst metasenv context
1344 canonical_context l ugraph
1346 let module C = Cic in
1347 let module R = CicReduction in
1348 let module S = CicSubstitution in
1349 let lifted_canonical_context =
1353 | (Some (n,C.Decl t))::tl ->
1354 (Some (n,C.Decl (S.subst_meta l (S.lift i t))))::(aux (i+1) tl)
1355 | None::tl -> None::(aux (i+1) tl)
1356 | (Some (n,C.Def (t,ty)))::tl ->
1357 (Some (n,C.Def ((S.subst_meta l (S.lift i t)),S.subst_meta l (S.lift i ty))))::(aux (i+1) tl)
1359 aux 1 canonical_context
1365 | Some t,Some (_,C.Def (ct,_)) ->
1366 (*CSC: the following optimization is to avoid a possibly expensive
1367 reduction that can be easily avoided and that is quite
1368 frequent. However, this is better handled using levels to
1369 control reduction *)
1374 match List.nth context (n - 1) with
1375 Some (_,C.Def (te,_)) -> S.lift n te
1381 (*if t <> optimized_t && optimized_t = ct then prerr_endline "!!!!!!!!!!!!!!!"
1382 else if t <> optimized_t then prerr_endline ("@@ " ^ CicPp.ppterm t ^ " ==> " ^ CicPp.ppterm optimized_t ^ " <==> " ^ CicPp.ppterm ct);*)
1384 R.are_convertible ~subst ~metasenv context optimized_t ct ugraph
1389 (lazy (sprintf "Not well typed metavariable local context: expected a term convertible with %s, found %s" (CicPp.ppterm ct) (CicPp.ppterm t))))
1392 | Some t,Some (_,C.Decl ct) ->
1393 let type_t,ugraph1 =
1394 type_of_aux' ~logger ~subst metasenv context t ugraph
1397 R.are_convertible ~subst ~metasenv context type_t ct ugraph1
1400 raise (TypeCheckerFailure
1401 (lazy (sprintf "Not well typed metavariable local context: expected a term of type %s, found %s of type %s"
1402 (CicPp.ppterm ct) (CicPp.ppterm t)
1403 (CicPp.ppterm type_t))))
1407 raise (TypeCheckerFailure
1408 (lazy ("Not well typed metavariable local context: "^
1409 "an hypothesis, that is not hidden, is not instantiated")))
1410 ) ugraph l lifted_canonical_context
1414 type_of_aux' is just another name (with a different scope)
1418 and type_of_aux' ~logger ?(subst = []) metasenv context t ugraph =
1419 let rec type_of_aux ~logger context t ugraph =
1420 let module C = Cic in
1421 let module R = CicReduction in
1422 let module S = CicSubstitution in
1423 let module U = UriManager in
1427 match List.nth context (n - 1) with
1428 Some (_,C.Decl t) -> S.lift n t,ugraph
1429 | Some (_,C.Def (_,ty)) -> S.lift n ty,ugraph
1431 (TypeCheckerFailure (lazy "Reference to deleted hypothesis"))
1434 raise (TypeCheckerFailure (lazy "unbound variable"))
1436 | C.Var (uri,exp_named_subst) ->
1439 check_exp_named_subst ~logger ~subst context exp_named_subst ugraph
1441 let ty,ugraph2 = type_of_variable ~logger uri ugraph1 in
1442 let ty1 = CicSubstitution.subst_vars exp_named_subst ty in
1447 let (canonical_context,term,ty) = CicUtil.lookup_subst n subst in
1449 check_metasenv_consistency ~logger
1450 ~subst metasenv context canonical_context l ugraph
1452 (* assuming subst is well typed !!!!! *)
1453 ((CicSubstitution.subst_meta l ty), ugraph1)
1454 (* type_of_aux context (CicSubstitution.subst_meta l term) *)
1455 with CicUtil.Subst_not_found _ ->
1456 let (_,canonical_context,ty) = CicUtil.lookup_meta n metasenv in
1458 check_metasenv_consistency ~logger
1459 ~subst metasenv context canonical_context l ugraph
1461 ((CicSubstitution.subst_meta l ty),ugraph1))
1462 (* TASSI: CONSTRAINTS *)
1463 | C.Sort (C.Type t) ->
1464 let t' = CicUniv.fresh() in
1466 let ugraph1 = CicUniv.add_gt t' t ugraph in
1467 (C.Sort (C.Type t')),ugraph1
1469 CicUniv.UniverseInconsistency msg -> raise (TypeCheckerFailure msg))
1470 | C.Sort s -> (C.Sort (C.Type (CicUniv.fresh ()))),ugraph
1471 | C.Implicit _ -> raise (AssertFailure (lazy "Implicit found"))
1472 | C.Cast (te,ty) as t ->
1473 let _,ugraph1 = type_of_aux ~logger context ty ugraph in
1474 let ty_te,ugraph2 = type_of_aux ~logger context te ugraph1 in
1476 R.are_convertible ~subst ~metasenv context ty_te ty ugraph2
1481 raise (TypeCheckerFailure
1482 (lazy (sprintf "Invalid cast %s" (CicPp.ppterm t))))
1483 | C.Prod (name,s,t) ->
1484 let sort1,ugraph1 = type_of_aux ~logger context s ugraph in
1486 type_of_aux ~logger ((Some (name,(C.Decl s)))::context) t ugraph1
1488 sort_of_prod ~subst context (name,s) (sort1,sort2) ugraph2
1489 | C.Lambda (n,s,t) ->
1490 let sort1,ugraph1 = type_of_aux ~logger context s ugraph in
1491 (match R.whd ~subst context sort1 with
1496 (TypeCheckerFailure (lazy (sprintf
1497 "Not well-typed lambda-abstraction: the source %s should be a type; instead it is a term of type %s" (CicPp.ppterm s)
1498 (CicPp.ppterm sort1))))
1501 type_of_aux ~logger ((Some (n,(C.Decl s)))::context) t ugraph1
1503 (C.Prod (n,s,type2)),ugraph2
1504 | C.LetIn (n,s,ty,t) ->
1505 (* only to check if s is well-typed *)
1506 let ty',ugraph1 = type_of_aux ~logger context s ugraph in
1507 let _,ugraph1 = type_of_aux ~logger context ty ugraph1 in
1509 R.are_convertible ~subst ~metasenv context ty ty' ugraph1
1515 "The type of %s is %s but it is expected to be %s"
1516 (CicPp.ppterm s) (CicPp.ppterm ty') (CicPp.ppterm ty))))
1518 (* The type of a LetIn is a LetIn. Extremely slow since the computed
1519 LetIn is later reduced and maybe also re-checked.
1520 (C.LetIn (n,s, type_of_aux ((Some (n,(C.Def s)))::context) t))
1522 (* The type of the LetIn is reduced. Much faster than the previous
1523 solution. Moreover the inferred type is probably very different
1524 from the expected one.
1525 (CicReduction.whd ~subst context
1526 (C.LetIn (n,s, type_of_aux ((Some (n,(C.Def s)))::context) t)))
1528 (* One-step LetIn reduction. Even faster than the previous solution.
1529 Moreover the inferred type is closer to the expected one. *)
1532 ((Some (n,(C.Def (s,ty))))::context) t ugraph1
1534 (CicSubstitution.subst ~avoid_beta_redexes:true s ty1),ugraph2
1535 | C.Appl (he::tl) when List.length tl > 0 ->
1536 let hetype,ugraph1 = type_of_aux ~logger context he ugraph in
1537 let tlbody_and_type,ugraph2 =
1540 let ty,ugraph1 = type_of_aux ~logger context x ugraph in
1541 (*let _,ugraph1 = type_of_aux ~logger context ty ugraph1 in*)
1542 ((x,ty)::l,ugraph1))
1545 (* TASSI: questa c'era nel mio... ma non nel CVS... *)
1546 (* let _,ugraph2 = type_of_aux context hetype ugraph2 in *)
1547 eat_prods ~subst context hetype tlbody_and_type ugraph2
1548 | C.Appl _ -> raise (AssertFailure (lazy "Appl: no arguments"))
1549 | C.Const (uri,exp_named_subst) ->
1552 check_exp_named_subst ~logger ~subst context exp_named_subst ugraph
1554 let cty,ugraph2 = type_of_constant ~logger uri ugraph1 in
1556 CicSubstitution.subst_vars exp_named_subst cty
1560 | C.MutInd (uri,i,exp_named_subst) ->
1563 check_exp_named_subst ~logger ~subst context exp_named_subst ugraph
1565 (* TASSI: da me c'era anche questa, ma in CVS no *)
1566 let mty,ugraph2 = type_of_mutual_inductive_defs ~logger uri i ugraph1 in
1567 (* fine parte dubbia *)
1569 CicSubstitution.subst_vars exp_named_subst mty
1573 | C.MutConstruct (uri,i,j,exp_named_subst) ->
1575 check_exp_named_subst ~logger ~subst context exp_named_subst ugraph
1577 (* TASSI: idem come sopra *)
1579 type_of_mutual_inductive_constr ~logger uri i j ugraph1
1582 CicSubstitution.subst_vars exp_named_subst mty
1585 | C.MutCase (uri,i,outtype,term,pl) ->
1586 let outsort,ugraph1 = type_of_aux ~logger context outtype ugraph in
1587 let (need_dummy, k) =
1588 let rec guess_args context t =
1589 let outtype = CicReduction.whd ~subst context t in
1591 C.Sort _ -> (true, 0)
1592 | C.Prod (name, s, t) ->
1594 guess_args ((Some (name,(C.Decl s)))::context) t in
1596 (* last prod before sort *)
1597 match CicReduction.whd ~subst context s with
1598 (*CSC: for _ see comment below about the missing named_exp_subst ?????????? *)
1599 C.MutInd (uri',i',_) when U.eq uri' uri && i' = i ->
1601 (*CSC: for _ see comment below about the missing named_exp_subst ?????????? *)
1602 | C.Appl ((C.MutInd (uri',i',_)) :: _)
1603 when U.eq uri' uri && i' = i -> (false, 1)
1611 "Malformed case analasys' output type %s"
1612 (CicPp.ppterm outtype))))
1615 let (parameters, arguments, exp_named_subst),ugraph2 =
1616 let ty,ugraph2 = type_of_aux context term ugraph1 in
1617 match R.whd ~subst context ty with
1618 (*CSC manca il caso dei CAST *)
1619 (*CSC: ma servono i parametri (uri,i)? Se si', perche' non serve anche il *)
1620 (*CSC: parametro exp_named_subst? Se no, perche' non li togliamo? *)
1621 (*CSC: Hint: nella DTD servono per gli stylesheet. *)
1622 C.MutInd (uri',i',exp_named_subst) as typ ->
1623 if U.eq uri uri' && i = i' then
1624 ([],[],exp_named_subst),ugraph2
1629 ("Case analysys: analysed term type is %s, but is expected to be (an application of) %s#1/%d{_}")
1630 (CicPp.ppterm typ) (U.string_of_uri uri) i)))
1632 ((C.MutInd (uri',i',exp_named_subst) as typ):: tl) as typ' ->
1633 if U.eq uri uri' && i = i' then
1635 split tl (List.length tl - k)
1636 in (params,args,exp_named_subst),ugraph2
1641 ("Case analysys: analysed term type is %s, "^
1642 "but is expected to be (an application of) "^
1644 (CicPp.ppterm typ') (U.string_of_uri uri) i)))
1650 "analysed term %s is not an inductive one")
1651 (CicPp.ppterm term))))
1653 let (b, k) = guess_args context outsort in
1654 if not b then (b, k - 1) else (b, k) in
1655 let (parameters, arguments, exp_named_subst),ugraph2 =
1656 let ty,ugraph2 = type_of_aux ~logger context term ugraph1 in
1657 match R.whd ~subst context ty with
1658 C.MutInd (uri',i',exp_named_subst) as typ ->
1659 if U.eq uri uri' && i = i' then
1660 ([],[],exp_named_subst),ugraph2
1664 ("Case analysys: analysed term type is %s (%s#1/%d{_}), but is expected to be (an application of) %s#1/%d{_}")
1665 (CicPp.ppterm typ) (U.string_of_uri uri') i' (U.string_of_uri uri) i)))
1666 | C.Appl ((C.MutInd (uri',i',exp_named_subst) as typ):: tl) ->
1667 if U.eq uri uri' && i = i' then
1669 split tl (List.length tl - k)
1670 in (params,args,exp_named_subst),ugraph2
1674 ("Case analysys: analysed term type is %s (%s#1/%d{_}), but is expected to be (an application of) %s#1/%d{_}")
1675 (CicPp.ppterm typ) (U.string_of_uri uri') i' (U.string_of_uri uri) i)))
1680 "Case analysis: analysed term %s is not an inductive one"
1681 (CicPp.ppterm term))))
1684 let's control if the sort elimination is allowed:
1687 let sort_of_ind_type =
1688 if parameters = [] then
1689 C.MutInd (uri,i,exp_named_subst)
1691 C.Appl ((C.MutInd (uri,i,exp_named_subst))::parameters)
1693 let type_of_sort_of_ind_ty,ugraph3 =
1694 type_of_aux ~logger context sort_of_ind_type ugraph2 in
1696 check_allowed_sort_elimination ~subst ~metasenv ~logger context uri i
1697 need_dummy sort_of_ind_type type_of_sort_of_ind_ty outsort ugraph3
1701 (TypeCheckerFailure (lazy ("Case analysis: sort elimination not allowed")));
1702 (* let's check if the type of branches are right *)
1703 let parsno,constructorsno =
1706 CicEnvironment.get_cooked_obj ~trust:false CicUniv.empty_ugraph uri
1707 with Not_found -> assert false
1710 C.InductiveDefinition (il,_,parsno,_) ->
1712 try List.nth il i with Failure _ -> assert false
1714 parsno, List.length cl
1716 raise (TypeCheckerFailure
1717 (lazy ("Unknown mutual inductive definition:" ^
1718 UriManager.string_of_uri uri)))
1720 if List.length pl <> constructorsno then
1721 raise (TypeCheckerFailure
1722 (lazy ("Wrong number of cases in case analysis"))) ;
1723 let (_,branches_ok,ugraph5) =
1725 (fun (j,b,ugraph) p ->
1728 if parameters = [] then
1729 (C.MutConstruct (uri,i,j,exp_named_subst))
1732 (C.MutConstruct (uri,i,j,exp_named_subst)::parameters))
1734 let ty_p,ugraph1 = type_of_aux ~logger context p ugraph in
1735 let ty_cons,ugraph3 = type_of_aux ~logger context cons ugraph1 in
1738 type_of_branch ~subst context parsno need_dummy outtype cons
1742 ~subst ~metasenv context ty_p ty_branch ugraph3
1747 prerr_endline ("\n!OUTTYPE= " ^ CicPp.ppterm outtype);
1748 prerr_endline ("!CONS= " ^ CicPp.ppterm cons);
1749 prerr_endline ("!TY_CONS= " ^ CicPp.ppterm ty_cons);
1750 prerr_endline ("#### " ^ CicPp.ppterm ty_p ^ "\n<==>\n" ^ CicPp.ppterm ty_branch);
1755 ("#### " ^ CicPp.ppterm ty_p ^
1756 " <==> " ^ CicPp.ppterm ty_branch));
1760 ) (1,true,ugraph4) pl
1762 if not branches_ok then
1764 (TypeCheckerFailure (lazy "Case analysys: wrong branch type"));
1766 if not need_dummy then outtype::arguments@[term]
1767 else outtype::arguments in
1769 if need_dummy && arguments = [] then outtype
1770 else CicReduction.head_beta_reduce (C.Appl arguments')
1774 let types,kl,ugraph1,len =
1776 (fun (types,kl,ugraph,len) (n,k,ty,_) ->
1777 let _,ugraph1 = type_of_aux ~logger context ty ugraph in
1778 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
1779 k::kl,ugraph1,len+1)
1780 ) ([],[],ugraph,0) fl
1784 (fun ugraph (name,x,ty,bo) ->
1786 type_of_aux ~logger (types@context) bo ugraph
1789 R.are_convertible ~subst ~metasenv (types@context)
1790 ty_bo (CicSubstitution.lift len ty) ugraph1 in
1793 let (m, eaten, context') =
1794 eat_lambdas ~subst (types @ context) (x + 1) bo
1797 let's control the guarded by
1798 destructors conditions D{f,k,x,M}
1800 if not (guarded_by_destructors ~subst context' eaten
1801 (len + eaten) kl 1 [] m) then
1804 (lazy ("Fix: not guarded by destructors:"^CicPp.ppterm t)))
1809 raise (TypeCheckerFailure (lazy ("Fix: ill-typed bodies")))
1811 (*CSC: controlli mancanti solo su D{f,k,x,M} *)
1812 let (_,_,ty,_) = List.nth fl i in
1815 let types,ugraph1,len =
1817 (fun (l,ugraph,len) (n,ty,_) ->
1819 type_of_aux ~logger context ty ugraph in
1820 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::l,
1826 (fun ugraph (_,ty,bo) ->
1828 type_of_aux ~logger (types @ context) bo ugraph
1831 R.are_convertible ~subst ~metasenv (types @ context) ty_bo
1832 (CicSubstitution.lift len ty) ugraph1
1836 (* let's control that the returned type is coinductive *)
1837 match returns_a_coinductive ~subst context ty with
1841 (lazy "CoFix: does not return a coinductive type"))
1844 let's control the guarded by constructors
1847 if not (guarded_by_constructors ~subst
1848 (types @ context) 0 len false bo [] uri) then
1851 (lazy "CoFix: not guarded by constructors"))
1857 (TypeCheckerFailure (lazy "CoFix: ill-typed bodies"))
1860 let (_,ty,_) = List.nth fl i in
1863 and check_exp_named_subst ~logger ~subst context =
1864 let rec check_exp_named_subst_aux ~logger esubsts l ugraph =
1867 | ((uri,t) as item)::tl ->
1868 let ty_uri,ugraph1 = type_of_variable ~logger uri ugraph in
1870 CicSubstitution.subst_vars esubsts ty_uri in
1871 let typeoft,ugraph2 = type_of_aux ~logger context t ugraph1 in
1873 CicReduction.are_convertible ~subst ~metasenv
1874 context typeoft typeofvar ugraph2
1877 check_exp_named_subst_aux ~logger (esubsts@[item]) tl ugraph3
1880 CicReduction.fdebug := 0 ;
1882 (CicReduction.are_convertible
1883 ~subst ~metasenv context typeoft typeofvar ugraph2) ;
1885 debug typeoft [typeofvar] ;
1886 raise (TypeCheckerFailure (lazy "Wrong Explicit Named Substitution"))
1889 check_exp_named_subst_aux ~logger []
1891 and sort_of_prod ~subst context (name,s) (t1, t2) ugraph =
1892 let module C = Cic in
1893 let t1' = CicReduction.whd ~subst context t1 in
1894 let t2' = CicReduction.whd ~subst ((Some (name,C.Decl s))::context) t2 in
1895 match (t1', t2') with
1896 (C.Sort s1, C.Sort s2)
1897 when (s2 = C.Prop or s2 = C.Set or s2 = C.CProp) ->
1898 (* different from Coq manual!!! *)
1900 | (C.Sort (C.Type t1), C.Sort (C.Type t2)) ->
1901 (* TASSI: CONSRTAINTS: the same in doubletypeinference, cicrefine *)
1902 let t' = CicUniv.fresh() in
1904 let ugraph1 = CicUniv.add_ge t' t1 ugraph in
1905 let ugraph2 = CicUniv.add_ge t' t2 ugraph1 in
1906 C.Sort (C.Type t'),ugraph2
1908 CicUniv.UniverseInconsistency msg -> raise (TypeCheckerFailure msg))
1909 | (C.Sort _,C.Sort (C.Type t1)) ->
1910 (* TASSI: CONSRTAINTS: the same in doubletypeinference, cicrefine *)
1911 C.Sort (C.Type t1),ugraph (* c'e' bisogno di un fresh? *)
1912 | (C.Meta _, C.Sort _) -> t2',ugraph
1913 | (C.Meta _, (C.Meta (_,_) as t))
1914 | (C.Sort _, (C.Meta (_,_) as t)) when CicUtil.is_closed t ->
1916 | (_,_) -> raise (TypeCheckerFailure (lazy (sprintf
1917 "Prod: expected two sorts, found = %s, %s" (CicPp.ppterm t1')
1918 (CicPp.ppterm t2'))))
1920 and eat_prods ~subst context hetype l ugraph =
1921 (*CSC: siamo sicuri che le are_convertible non lavorino con termini non *)
1925 | (hete, hety)::tl ->
1926 (match (CicReduction.whd ~subst context hetype) with
1929 (*if (match hety,s with Cic.Sort _,Cic.Sort _ -> false | _,_ -> true) && hety <> s then(
1930 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*)
1931 CicReduction.are_convertible
1932 ~subst ~metasenv context hety s ugraph
1936 CicReduction.fdebug := -1 ;
1937 eat_prods ~subst context
1938 (CicSubstitution.subst ~avoid_beta_redexes:true hete t)
1940 (*TASSI: not sure *)
1944 CicReduction.fdebug := 0 ;
1945 ignore (CicReduction.are_convertible
1946 ~subst ~metasenv context s hety ugraph) ;
1952 ("Appl: wrong parameter-type, expected %s, found %s")
1953 (CicPp.ppterm hetype) (CicPp.ppterm s))))
1956 raise (TypeCheckerFailure
1957 (lazy "Appl: this is not a function, it cannot be applied"))
1960 and returns_a_coinductive ~subst context ty =
1961 let module C = Cic in
1962 match CicReduction.whd ~subst context ty with
1963 C.MutInd (uri,i,_) ->
1964 (*CSC: definire una funzioncina per questo codice sempre replicato *)
1967 CicEnvironment.get_cooked_obj ~trust:false CicUniv.empty_ugraph uri
1968 with Not_found -> assert false
1971 C.InductiveDefinition (itl,_,_,_) ->
1972 let (_,is_inductive,_,_) = List.nth itl i in
1973 if is_inductive then None else (Some uri)
1975 raise (TypeCheckerFailure
1976 (lazy ("Unknown mutual inductive definition:" ^
1977 UriManager.string_of_uri uri)))
1979 | C.Appl ((C.MutInd (uri,i,_))::_) ->
1980 (let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
1982 C.InductiveDefinition (itl,_,_,_) ->
1983 let (_,is_inductive,_,_) = List.nth itl i in
1984 if is_inductive then None else (Some uri)
1986 raise (TypeCheckerFailure
1987 (lazy ("Unknown mutual inductive definition:" ^
1988 UriManager.string_of_uri uri)))
1990 | C.Prod (n,so,de) ->
1991 returns_a_coinductive ~subst ((Some (n,C.Decl so))::context) de
1996 debug_print (lazy ("INIZIO TYPE_OF_AUX " ^ CicPp.ppterm t)) ; flush stderr ;
1999 type_of_aux ~logger context t ugraph
2001 in debug_print (lazy "FINE TYPE_OF_AUX") ; flush stderr ; res
2004 (* is a small constructor? *)
2005 (*CSC: ottimizzare calcolando staticamente *)
2006 and is_small_or_non_informative ~condition ~logger context paramsno c ugraph =
2007 let rec is_small_or_non_informative_aux ~logger context c ugraph =
2008 let module C = Cic in
2009 match CicReduction.whd context c with
2011 let s,ugraph1 = type_of_aux' ~logger [] context so ugraph in
2012 let b = condition s in
2014 is_small_or_non_informative_aux
2015 ~logger ((Some (n,(C.Decl so)))::context) de ugraph1
2018 | _ -> true,ugraph (*CSC: we trust the type-checker *)
2020 let (context',dx) = split_prods ~subst:[] context paramsno c in
2021 is_small_or_non_informative_aux ~logger context' dx ugraph
2023 and is_small ~logger =
2024 is_small_or_non_informative
2025 ~condition:(fun s -> s=Cic.Sort Cic.Prop || s=Cic.Sort Cic.Set)
2028 and is_non_informative ~logger =
2029 is_small_or_non_informative
2030 ~condition:(fun s -> s=Cic.Sort Cic.Prop)
2033 and type_of ~logger t ugraph =
2035 debug_print (lazy ("INIZIO TYPE_OF_AUX' " ^ CicPp.ppterm t)) ; flush stderr ;
2038 type_of_aux' ~logger [] [] t ugraph
2040 in debug_print (lazy "FINE TYPE_OF_AUX'") ; flush stderr ; res
2044 let typecheck_obj0 ~logger uri ugraph =
2045 let module C = Cic in
2047 C.Constant (_,Some te,ty,_,_) ->
2048 let _,ugraph = type_of ~logger ty ugraph in
2049 let ty_te,ugraph = type_of ~logger te ugraph in
2050 let b,ugraph = (CicReduction.are_convertible [] ty_te ty ugraph) in
2052 raise (TypeCheckerFailure
2054 ("the type of the body is not the one expected:\n" ^
2055 CicPp.ppterm ty_te ^ "\nvs\n" ^
2059 | C.Constant (_,None,ty,_,_) ->
2060 (* only to check that ty is well-typed *)
2061 let _,ugraph = type_of ~logger ty ugraph in
2063 | C.CurrentProof (_,conjs,te,ty,_,_) ->
2064 (* this block is broken since the metasenv should
2065 * be topologically sorted before typing metas *)
2066 ignore(assert false);
2069 (fun (metasenv,ugraph) ((_,context,ty) as conj) ->
2071 type_of_aux' ~logger metasenv context ty ugraph
2073 metasenv @ [conj],ugraph
2076 let _,ugraph = type_of_aux' ~logger conjs [] ty ugraph in
2077 let type_of_te,ugraph =
2078 type_of_aux' ~logger conjs [] te ugraph
2080 let b,ugraph = CicReduction.are_convertible [] type_of_te ty ugraph in
2082 raise (TypeCheckerFailure (lazy (sprintf
2083 "the current proof is not well typed because the type %s of the body is not convertible to the declared type %s"
2084 (CicPp.ppterm type_of_te) (CicPp.ppterm ty))))
2087 | C.Variable (_,bo,ty,_,_) ->
2088 (* only to check that ty is well-typed *)
2089 let _,ugraph = type_of ~logger ty ugraph in
2093 let ty_bo,ugraph = type_of ~logger bo ugraph in
2094 let b,ugraph = CicReduction.are_convertible [] ty_bo ty ugraph in
2096 raise (TypeCheckerFailure
2097 (lazy "the body is not the one expected"))
2101 | (C.InductiveDefinition _ as obj) ->
2102 check_mutual_inductive_defs ~logger uri obj ugraph
2105 let module C = Cic in
2106 let module R = CicReduction in
2107 let module U = UriManager in
2108 let logger = new CicLogger.logger in
2109 (* ??? match CicEnvironment.is_type_checked ~trust:true uri with ???? *)
2110 match CicEnvironment.is_type_checked ~trust:false CicUniv.empty_ugraph uri with
2111 CicEnvironment.CheckedObj (cobj,ugraph') ->
2112 (* debug_print (lazy ("NON-INIZIO A TYPECHECKARE " ^ U.string_of_uri uri));*)
2114 | CicEnvironment.UncheckedObj uobj ->
2115 (* let's typecheck the uncooked object *)
2116 logger#log (`Start_type_checking uri) ;
2117 (* debug_print (lazy ("INIZIO A TYPECHECKARE " ^ U.string_of_uri uri)); *)
2118 let ugraph = typecheck_obj0 ~logger uri CicUniv.empty_ugraph uobj in
2120 CicEnvironment.set_type_checking_info uri;
2121 logger#log (`Type_checking_completed uri);
2122 match CicEnvironment.is_type_checked ~trust:false ugraph uri with
2123 CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
2124 | _ -> raise CicEnvironmentError
2127 this is raised if set_type_checking_info is called on an object
2128 that has no associated universe file. If we are in univ_maker
2129 phase this is OK since univ_maker will properly commit the
2132 Invalid_argument s ->
2133 (*debug_print (lazy s);*)
2137 let typecheck_obj ~logger uri obj =
2138 let ugraph = typecheck_obj0 ~logger uri CicUniv.empty_ugraph obj in
2139 let ugraph, univlist, obj = CicUnivUtils.clean_and_fill uri obj ugraph in
2140 CicEnvironment.add_type_checked_obj uri (obj,ugraph,univlist)
2142 (** wrappers which instantiate fresh loggers *)
2144 let profiler = HExtlib.profile "K/CicTypeChecker.type_of_aux'"
2146 let type_of_aux' ?(subst = []) metasenv context t ugraph =
2147 let logger = new CicLogger.logger in
2148 profiler.HExtlib.profile
2149 (type_of_aux' ~logger ~subst metasenv context t) ugraph
2151 let typecheck_obj uri obj =
2152 let logger = new CicLogger.logger in
2153 typecheck_obj ~logger uri obj
2155 (* check_allowed_sort_elimination uri i s1 s2
2156 This function is used outside the kernel to determine in advance whether
2157 a MutCase will be allowed or not.
2158 [uri,i] is the type of the term to match
2159 [s1] is the sort of the term to eliminate (i.e. the head of the arity
2160 of the inductive type [uri,i])
2161 [s2] is the sort of the goal (i.e. the head of the type of the outtype
2163 let check_allowed_sort_elimination uri i s1 s2 =
2164 fst (check_allowed_sort_elimination ~subst:[] ~metasenv:[]
2165 ~logger:(new CicLogger.logger) [] uri i true
2166 (Cic.Implicit None) (* never used *) (Cic.Sort s1) (Cic.Sort s2)
2167 CicUniv.empty_ugraph)
2170 Deannotate.type_of_aux' :=
2177 | Some (_,Cic.Decl ty) ->
2178 ignore (type_of_aux' [] context ty CicUniv.oblivion_ugraph)
2179 | Some (_,Cic.Def (bo,ty)) ->
2180 ignore (type_of_aux' [] context ty CicUniv.oblivion_ugraph);
2181 ignore (type_of_aux' [] context bo CicUniv.oblivion_ugraph));
2184 fst (type_of_aux' [] context t CicUniv.oblivion_ugraph);;