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,t) -> C.LetIn (n, aux k s, 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 n 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,dest) ->
277 does_not_occur ~subst context n nn so &&
278 does_not_occur ~subst ((Some (name,(C.Def (so,None))))::context)
279 (n + 1) (nn + 1) dest
281 List.fold_right (fun x i -> i && does_not_occur ~subst context n nn x) l true
282 | C.Var (_,exp_named_subst)
283 | C.Const (_,exp_named_subst)
284 | C.MutInd (_,_,exp_named_subst)
285 | C.MutConstruct (_,_,_,exp_named_subst) ->
286 List.fold_right (fun (_,x) i -> i && does_not_occur ~subst context n nn x)
288 | C.MutCase (_,_,out,te,pl) ->
289 does_not_occur ~subst context n nn out && does_not_occur ~subst context n nn te &&
290 List.fold_right (fun x i -> i && does_not_occur ~subst context n nn x) pl true
292 let len = List.length fl in
293 let n_plus_len = n + len in
294 let nn_plus_len = nn + len in
296 List.map (fun (n,_,ty,_) -> Some (C.Name n,(Cic.Decl ty))) fl
299 (fun (_,_,ty,bo) i ->
300 i && does_not_occur ~subst context n nn ty &&
301 does_not_occur ~subst (tys @ context) n_plus_len nn_plus_len bo
304 let len = List.length fl in
305 let n_plus_len = n + len in
306 let nn_plus_len = nn + len in
308 List.map (fun (n,ty,_) -> Some (C.Name n,(Cic.Decl ty))) fl
312 i && does_not_occur ~subst context n nn ty &&
313 does_not_occur ~subst (tys @ context) n_plus_len nn_plus_len bo
316 (*CSC l'indice x dei tipi induttivi e' t.c. n < x <= nn *)
317 (*CSC questa funzione e' simile alla are_all_occurrences_positive, ma fa *)
318 (*CSC dei controlli leggermente diversi. Viene invocata solamente dalla *)
319 (*CSC strictly_positive *)
320 (*CSC definizione (giusta???) tratta dalla mail di Hugo ;-) *)
321 and weakly_positive context n nn uri te =
322 let module C = Cic in
323 (*CSC: Che schifo! Bisogna capire meglio e trovare una soluzione ragionevole!*)
325 C.MutInd (HelmLibraryObjects.Datatypes.nat_URI,0,[])
327 (*CSC: mettere in cicSubstitution *)
328 let rec subst_inductive_type_with_dummy_mutind =
330 C.MutInd (uri',0,_) when UriManager.eq uri' uri ->
332 | C.Appl ((C.MutInd (uri',0,_))::tl) when UriManager.eq uri' uri ->
334 | C.Cast (te,ty) -> subst_inductive_type_with_dummy_mutind te
335 | C.Prod (name,so,ta) ->
336 C.Prod (name, subst_inductive_type_with_dummy_mutind so,
337 subst_inductive_type_with_dummy_mutind ta)
338 | C.Lambda (name,so,ta) ->
339 C.Lambda (name, subst_inductive_type_with_dummy_mutind so,
340 subst_inductive_type_with_dummy_mutind ta)
342 C.Appl (List.map subst_inductive_type_with_dummy_mutind tl)
343 | C.MutCase (uri,i,outtype,term,pl) ->
345 subst_inductive_type_with_dummy_mutind outtype,
346 subst_inductive_type_with_dummy_mutind term,
347 List.map subst_inductive_type_with_dummy_mutind pl)
349 C.Fix (i,List.map (fun (name,i,ty,bo) -> (name,i,
350 subst_inductive_type_with_dummy_mutind ty,
351 subst_inductive_type_with_dummy_mutind bo)) fl)
353 C.CoFix (i,List.map (fun (name,ty,bo) -> (name,
354 subst_inductive_type_with_dummy_mutind ty,
355 subst_inductive_type_with_dummy_mutind bo)) fl)
356 | C.Const (uri,exp_named_subst) ->
357 let exp_named_subst' =
359 (function (uri,t) -> (uri,subst_inductive_type_with_dummy_mutind t))
362 C.Const (uri,exp_named_subst')
363 | C.MutInd (uri,typeno,exp_named_subst) ->
364 let exp_named_subst' =
366 (function (uri,t) -> (uri,subst_inductive_type_with_dummy_mutind t))
369 C.MutInd (uri,typeno,exp_named_subst')
370 | C.MutConstruct (uri,typeno,consno,exp_named_subst) ->
371 let exp_named_subst' =
373 (function (uri,t) -> (uri,subst_inductive_type_with_dummy_mutind t))
376 C.MutConstruct (uri,typeno,consno,exp_named_subst')
379 match CicReduction.whd context te with
381 C.Appl ((C.MutInd (uri',0,_))::tl) when UriManager.eq uri' uri -> true
383 C.Appl ((C.MutInd (uri',_,_))::tl) when UriManager.eq uri' uri -> true
384 | C.MutInd (uri',0,_) when UriManager.eq uri' uri -> true
385 | C.Prod (C.Anonymous,source,dest) ->
386 strictly_positive context n nn
387 (subst_inductive_type_with_dummy_mutind source) &&
388 weakly_positive ((Some (C.Anonymous,(C.Decl source)))::context)
389 (n + 1) (nn + 1) uri dest
390 | C.Prod (name,source,dest) when
391 does_not_occur ((Some (name,(C.Decl source)))::context) 0 n dest ->
392 (* dummy abstraction, so we behave as in the anonimous case *)
393 strictly_positive context n nn
394 (subst_inductive_type_with_dummy_mutind source) &&
395 weakly_positive ((Some (name,(C.Decl source)))::context)
396 (n + 1) (nn + 1) uri dest
397 | C.Prod (name,source,dest) ->
398 does_not_occur context n nn
399 (subst_inductive_type_with_dummy_mutind source)&&
400 weakly_positive ((Some (name,(C.Decl source)))::context)
401 (n + 1) (nn + 1) uri dest
403 raise (TypeCheckerFailure (lazy "Malformed inductive constructor type"))
405 (* instantiate_parameters ps (x1:T1)...(xn:Tn)C *)
406 (* returns ((x_|ps|:T_|ps|)...(xn:Tn)C){ps_1 / x1 ; ... ; ps_|ps| / x_|ps|} *)
407 and instantiate_parameters params c =
408 let module C = Cic in
409 match (c,params) with
411 | (C.Prod (_,_,ta), he::tl) ->
412 instantiate_parameters tl
413 (CicSubstitution.subst he ta)
414 | (C.Cast (te,_), _) -> instantiate_parameters params te
415 | (t,l) -> raise (AssertFailure (lazy "1"))
417 and strictly_positive context n nn te =
418 let module C = Cic in
419 let module U = UriManager in
420 match CicReduction.whd context te with
421 | t when does_not_occur context n nn t -> true
424 (*CSC: bisogna controllare ty????*)
425 strictly_positive context n nn te
426 | C.Prod (name,so,ta) ->
427 does_not_occur context n nn so &&
428 strictly_positive ((Some (name,(C.Decl so)))::context) (n+1) (nn+1) ta
429 | C.Appl ((C.Rel m)::tl) when m > n && m <= nn ->
430 List.fold_right (fun x i -> i && does_not_occur context n nn x) tl true
431 | C.Appl ((C.MutInd (uri,i,exp_named_subst))::tl) ->
432 let (ok,paramsno,ity,cl,name) =
433 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
435 C.InductiveDefinition (tl,_,paramsno,_) ->
436 let (name,_,ity,cl) = List.nth tl i in
437 (List.length tl = 1, paramsno, ity, cl, name)
438 (* (true, paramsno, ity, cl, name) *)
442 (lazy ("Unknown inductive type:" ^ U.string_of_uri uri)))
444 let (params,arguments) = split tl paramsno in
445 let lifted_params = List.map (CicSubstitution.lift 1) params in
449 instantiate_parameters lifted_params
450 (CicSubstitution.subst_vars exp_named_subst te)
455 (fun x i -> i && does_not_occur context n nn x)
457 (*CSC: MEGAPATCH3 (sara' quella giusta?)*)
462 ((Some (C.Name name,(Cic.Decl ity)))::context) (n+1) (nn+1) uri
467 (* the inductive type indexes are s.t. n < x <= nn *)
468 and are_all_occurrences_positive context uri indparamsno i n nn te =
469 let module C = Cic in
470 match CicReduction.whd context te with
471 C.Appl ((C.Rel m)::tl) when m = i ->
472 (*CSC: riscrivere fermandosi a 0 *)
473 (* let's check if the inductive type is applied at least to *)
474 (* indparamsno parameters *)
480 match CicReduction.whd context x with
481 C.Rel m when m = n - (indparamsno - k) -> k - 1
483 raise (TypeCheckerFailure
485 ("Non-positive occurence in mutual inductive definition(s) [1]" ^
486 UriManager.string_of_uri uri)))
490 List.fold_right (fun x i -> i && does_not_occur context n nn x) tl true
492 raise (TypeCheckerFailure
493 (lazy ("Non-positive occurence in mutual inductive definition(s) [2]"^
494 UriManager.string_of_uri uri)))
495 | C.Rel m when m = i ->
496 if indparamsno = 0 then
499 raise (TypeCheckerFailure
500 (lazy ("Non-positive occurence in mutual inductive definition(s) [3]"^
501 UriManager.string_of_uri uri)))
502 | C.Prod (C.Anonymous,source,dest) ->
503 let b = strictly_positive context n nn source in
505 are_all_occurrences_positive
506 ((Some (C.Anonymous,(C.Decl source)))::context) uri indparamsno
507 (i+1) (n + 1) (nn + 1) dest
508 | C.Prod (name,source,dest) when
509 does_not_occur ((Some (name,(C.Decl source)))::context) 0 n dest ->
510 (* dummy abstraction, so we behave as in the anonimous case *)
511 strictly_positive context n nn source &&
512 are_all_occurrences_positive
513 ((Some (name,(C.Decl source)))::context) uri indparamsno
514 (i+1) (n + 1) (nn + 1) dest
515 | C.Prod (name,source,dest) ->
516 does_not_occur context n nn source &&
517 are_all_occurrences_positive ((Some (name,(C.Decl source)))::context)
518 uri indparamsno (i+1) (n + 1) (nn + 1) dest
521 (TypeCheckerFailure (lazy ("Malformed inductive constructor type " ^
522 (UriManager.string_of_uri uri))))
524 (* Main function to checks the correctness of a mutual *)
525 (* inductive block definition. This is the function *)
526 (* exported to the proof-engine. *)
527 and typecheck_mutual_inductive_defs ~logger uri (itl,_,indparamsno) ugraph =
528 let module U = UriManager in
529 (* let's check if the arity of the inductive types are well *)
531 let ugrap1 = List.fold_left
532 (fun ugraph (_,_,x,_) -> let _,ugraph' =
533 type_of ~logger x ugraph in ugraph')
536 (* let's check if the types of the inductive constructors *)
537 (* are well formed. *)
538 (* In order not to use type_of_aux we put the types of the *)
539 (* mutual inductive types at the head of the types of the *)
540 (* constructors using Prods *)
541 let len = List.length itl in
543 List.map (fun (n,_,ty,_) -> Some (Cic.Name n,(Cic.Decl ty))) itl in
546 (fun (_,_,_,cl) (i,ugraph) ->
549 (fun ugraph (name,te) ->
550 let debrujinedte = debrujin_constructor uri len te in
553 (fun (name,_,ty,_) i -> Cic.Prod (Cic.Name name, ty, i))
556 let _,ugraph' = type_of ~logger augmented_term ugraph in
557 (* let's check also the positivity conditions *)
560 (are_all_occurrences_positive tys uri indparamsno i 0 len
564 prerr_endline (UriManager.string_of_uri uri);
565 prerr_endline (string_of_int (List.length tys));
568 (lazy ("Non positive occurence in " ^ U.string_of_uri uri))) end
577 (* Main function to checks the correctness of a mutual *)
578 (* inductive block definition. *)
579 and check_mutual_inductive_defs uri obj ugraph =
581 Cic.InductiveDefinition (itl, params, indparamsno, _) ->
582 typecheck_mutual_inductive_defs uri (itl,params,indparamsno) ugraph
584 raise (TypeCheckerFailure (
585 lazy ("Unknown mutual inductive definition:" ^
586 UriManager.string_of_uri uri)))
588 and type_of_mutual_inductive_defs ~logger uri i ugraph =
589 let module C = Cic in
590 let module R = CicReduction in
591 let module U = UriManager in
593 match CicEnvironment.is_type_checked ~trust:true ugraph uri with
594 CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
595 | CicEnvironment.UncheckedObj uobj ->
596 logger#log (`Start_type_checking uri) ;
598 check_mutual_inductive_defs ~logger uri uobj ugraph
600 (* TASSI: FIXME: check ugraph1 == ugraph ritornato da env *)
602 CicEnvironment.set_type_checking_info uri ;
603 logger#log (`Type_checking_completed uri) ;
604 (match CicEnvironment.is_type_checked ~trust:false ugraph uri with
605 CicEnvironment.CheckedObj (cobj,ugraph') -> (cobj,ugraph')
606 | CicEnvironment.UncheckedObj _ -> raise CicEnvironmentError
609 Invalid_argument s ->
610 (*debug_print (lazy s);*)
614 C.InductiveDefinition (dl,_,_,_) ->
615 let (_,_,arity,_) = List.nth dl i in
618 raise (TypeCheckerFailure
619 (lazy ("Unknown mutual inductive definition:" ^ U.string_of_uri uri)))
621 and type_of_mutual_inductive_constr ~logger uri i j ugraph =
622 let module C = Cic in
623 let module R = CicReduction in
624 let module U = UriManager in
626 match CicEnvironment.is_type_checked ~trust:true ugraph uri with
627 CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
628 | CicEnvironment.UncheckedObj uobj ->
629 logger#log (`Start_type_checking uri) ;
631 check_mutual_inductive_defs ~logger uri uobj ugraph
633 (* check ugraph1 validity ??? == ugraph' *)
635 CicEnvironment.set_type_checking_info uri ;
636 logger#log (`Type_checking_completed uri) ;
638 CicEnvironment.is_type_checked ~trust:false ugraph uri
640 CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
641 | CicEnvironment.UncheckedObj _ ->
642 raise CicEnvironmentError)
644 Invalid_argument s ->
645 (*debug_print (lazy s);*)
649 C.InductiveDefinition (dl,_,_,_) ->
650 let (_,_,_,cl) = List.nth dl i in
651 let (_,ty) = List.nth cl (j-1) in
654 raise (TypeCheckerFailure
655 (lazy ("Unknown mutual inductive definition:" ^ UriManager.string_of_uri uri)))
657 and recursive_args context n nn te =
658 let module C = Cic in
659 match CicReduction.whd context te with
665 | C.Cast _ (*CSC ??? *) ->
666 raise (AssertFailure (lazy "3")) (* due to type-checking *)
667 | C.Prod (name,so,de) ->
668 (not (does_not_occur context n nn so)) ::
669 (recursive_args ((Some (name,(C.Decl so)))::context) (n+1) (nn + 1) de)
672 raise (AssertFailure (lazy "4")) (* due to type-checking *)
674 | C.Const _ -> raise (AssertFailure (lazy "5"))
679 | C.CoFix _ -> raise (AssertFailure (lazy "6")) (* due to type-checking *)
681 and get_new_safes ~subst context p c rl safes n nn x =
682 let module C = Cic in
683 let module U = UriManager in
684 let module R = CicReduction in
685 match (R.whd ~subst context c, R.whd ~subst context p, rl) with
686 (C.Prod (_,so,ta1), C.Lambda (name,_,ta2), b::tl) ->
687 (* we are sure that the two sources are convertible because we *)
688 (* have just checked this. So let's go along ... *)
690 List.map (fun x -> x + 1) safes
693 if b then 1::safes' else safes'
695 get_new_safes ~subst ((Some (name,(C.Decl so)))::context)
696 ta2 ta1 tl safes'' (n+1) (nn+1) (x+1)
697 | (C.Prod _, (C.MutConstruct _ as e), _)
698 | (C.Prod _, (C.Rel _ as e), _)
699 | (C.MutInd _, e, [])
700 | (C.Appl _, e, []) -> (e,safes,n,nn,x,context)
702 (* CSC: If the next exception is raised, it just means that *)
703 (* CSC: the proof-assistant allows to use very strange things *)
704 (* CSC: as a branch of a case whose type is a Prod. In *)
705 (* CSC: particular, this means that a new (C.Prod, x,_) case *)
706 (* CSC: must be considered in this match. (e.g. x = MutCase) *)
709 (Printf.sprintf "Get New Safes: c=%s ; p=%s"
710 (CicPp.ppterm c) (CicPp.ppterm p))))
712 and split_prods ~subst context n te =
713 let module C = Cic in
714 let module R = CicReduction in
715 match (n, R.whd ~subst context te) with
717 | (n, C.Prod (name,so,ta)) when n > 0 ->
718 split_prods ~subst ((Some (name,(C.Decl so)))::context) (n - 1) ta
719 | (_, _) -> raise (AssertFailure (lazy "8"))
721 and eat_lambdas ~subst context n te =
722 let module C = Cic in
723 let module R = CicReduction in
724 match (n, R.whd ~subst context te) with
725 (0, _) -> (te, 0, context)
726 | (n, C.Lambda (name,so,ta)) when n > 0 ->
727 let (te, k, context') =
728 eat_lambdas ~subst ((Some (name,(C.Decl so)))::context) (n - 1) ta
730 (te, k + 1, context')
732 raise (AssertFailure (lazy (sprintf "9 (%d, %s)" n (CicPp.ppterm te))))
734 (*CSC: Tutto quello che segue e' l'intuzione di luca ;-) *)
735 and check_is_really_smaller_arg ~subst context n nn kl x safes te =
736 (*CSC: forse la whd si puo' fare solo quando serve veramente. *)
737 (*CSC: cfr guarded_by_destructors *)
738 let module C = Cic in
739 let module U = UriManager in
740 match CicReduction.whd ~subst context te with
741 C.Rel m when List.mem m safes -> true
748 (* | C.Cast (te,ty) ->
749 check_is_really_smaller_arg ~subst n nn kl x safes te &&
750 check_is_really_smaller_arg ~subst n nn kl x safes ty*)
751 (* | C.Prod (_,so,ta) ->
752 check_is_really_smaller_arg ~subst n nn kl x safes so &&
753 check_is_really_smaller_arg ~subst (n+1) (nn+1) kl (x+1)
754 (List.map (fun x -> x + 1) safes) ta*)
755 | C.Prod _ -> raise (AssertFailure (lazy "10"))
756 | C.Lambda (name,so,ta) ->
757 check_is_really_smaller_arg ~subst context n nn kl x safes so &&
758 check_is_really_smaller_arg ~subst ((Some (name,(C.Decl so)))::context)
759 (n+1) (nn+1) kl (x+1) (List.map (fun x -> x + 1) safes) ta
760 | C.LetIn (name,so,ta) ->
761 check_is_really_smaller_arg ~subst context n nn kl x safes so &&
762 check_is_really_smaller_arg ~subst ((Some (name,(C.Def (so,None))))::context)
763 (n+1) (nn+1) kl (x+1) (List.map (fun x -> x + 1) safes) ta
765 (*CSC: sulla coda ci vogliono dei controlli? secondo noi no, ma *)
766 (*CSC: solo perche' non abbiamo trovato controesempi *)
767 check_is_really_smaller_arg ~subst context n nn kl x safes he
768 | C.Appl [] -> raise (AssertFailure (lazy "11"))
770 | C.MutInd _ -> raise (AssertFailure (lazy "12"))
771 | C.MutConstruct _ -> false
772 | C.MutCase (uri,i,outtype,term,pl) ->
774 C.Rel m when List.mem m safes || m = x ->
775 let (lefts_and_tys,len,isinductive,paramsno,cl) =
776 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
778 C.InductiveDefinition (tl,_,paramsno,_) ->
781 (fun (n,_,ty,_) -> Some (Cic.Name n,(Cic.Decl ty))) tl
783 let (_,isinductive,_,cl) = List.nth tl i in
787 (id, snd (split_prods ~subst tys paramsno ty))) cl in
792 fst (split_prods ~subst [] paramsno ty)
794 (tys@lefts,List.length tl,isinductive,paramsno,cl')
796 raise (TypeCheckerFailure
797 (lazy ("Unknown mutual inductive definition:" ^
798 UriManager.string_of_uri uri)))
800 if not isinductive then
803 i && check_is_really_smaller_arg ~subst context n nn kl x safes p)
810 Invalid_argument _ ->
811 raise (TypeCheckerFailure (lazy "not enough patterns"))
816 let debrujinedte = debrujin_constructor uri len c in
817 recursive_args lefts_and_tys 0 len debrujinedte
819 let (e,safes',n',nn',x',context') =
820 get_new_safes ~subst context p c rl' safes n nn x
823 check_is_really_smaller_arg ~subst context' n' nn' kl x' safes' e
825 | C.Appl ((C.Rel m)::tl) when List.mem m safes || m = x ->
826 let (lefts_and_tys,len,isinductive,paramsno,cl) =
827 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
829 C.InductiveDefinition (tl,_,paramsno,_) ->
830 let (_,isinductive,_,cl) = List.nth tl i in
832 List.map (fun (n,_,ty,_) ->
833 Some(Cic.Name n,(Cic.Decl ty))) tl
838 (id, snd (split_prods ~subst tys paramsno ty))) cl in
843 fst (split_prods ~subst [] paramsno ty)
845 (tys@lefts,List.length tl,isinductive,paramsno,cl')
847 raise (TypeCheckerFailure
848 (lazy ("Unknown mutual inductive definition:" ^
849 UriManager.string_of_uri uri)))
851 if not isinductive then
854 i && check_is_really_smaller_arg ~subst context n nn kl x safes p)
861 Invalid_argument _ ->
862 raise (TypeCheckerFailure (lazy "not enough patterns"))
864 (*CSC: supponiamo come prima che nessun controllo sia necessario*)
865 (*CSC: sugli argomenti di una applicazione *)
869 let debrujinedte = debrujin_constructor uri len c in
870 recursive_args lefts_and_tys 0 len debrujinedte
872 let (e, safes',n',nn',x',context') =
873 get_new_safes ~subst context p c rl' safes n nn x
876 check_is_really_smaller_arg ~subst context' n' nn' kl x' safes' e
881 i && check_is_really_smaller_arg ~subst context n nn kl x safes p
885 let len = List.length fl in
886 let n_plus_len = n + len
887 and nn_plus_len = nn + len
888 and x_plus_len = x + len
889 and tys = List.map (fun (n,_,ty,_) -> Some (C.Name n,(C.Decl ty))) fl
890 and safes' = List.map (fun x -> x + len) safes in
892 (fun (_,_,ty,bo) i ->
894 check_is_really_smaller_arg ~subst (tys@context) n_plus_len nn_plus_len kl
898 let len = List.length fl in
899 let n_plus_len = n + len
900 and nn_plus_len = nn + len
901 and x_plus_len = x + len
902 and tys = List.map (fun (n,ty,_) -> Some (C.Name n,(C.Decl ty))) fl
903 and safes' = List.map (fun x -> x + len) safes in
907 check_is_really_smaller_arg ~subst (tys@context) n_plus_len nn_plus_len kl
911 and guarded_by_destructors ~subst context n nn kl x safes =
912 let module C = Cic in
913 let module U = UriManager in
915 C.Rel m when m > n && m <= nn -> false
917 (match List.nth context (n-1) with
918 Some (_,C.Decl _) -> true
919 | Some (_,C.Def (bo,_)) ->
920 guarded_by_destructors ~subst context m nn kl x safes
921 (CicSubstitution.lift m bo)
922 | None -> raise (TypeCheckerFailure (lazy "Reference to deleted hypothesis"))
926 | C.Implicit _ -> true
928 guarded_by_destructors ~subst context n nn kl x safes te &&
929 guarded_by_destructors ~subst context n nn kl x safes ty
930 | C.Prod (name,so,ta) ->
931 guarded_by_destructors ~subst context n nn kl x safes so &&
932 guarded_by_destructors ~subst ((Some (name,(C.Decl so)))::context)
933 (n+1) (nn+1) kl (x+1) (List.map (fun x -> x + 1) safes) ta
934 | C.Lambda (name,so,ta) ->
935 guarded_by_destructors ~subst context n nn kl x safes so &&
936 guarded_by_destructors ~subst ((Some (name,(C.Decl so)))::context)
937 (n+1) (nn+1) kl (x+1) (List.map (fun x -> x + 1) safes) ta
938 | C.LetIn (name,so,ta) ->
939 guarded_by_destructors ~subst context n nn kl x safes so &&
940 guarded_by_destructors ~subst ((Some (name,(C.Def (so,None))))::context)
941 (n+1) (nn+1) kl (x+1) (List.map (fun x -> x + 1) safes) ta
942 | C.Appl ((C.Rel m)::tl) when m > n && m <= nn ->
943 let k = List.nth kl (m - n - 1) in
944 if not (List.length tl > k) then false
948 i && guarded_by_destructors ~subst context n nn kl x safes param
950 check_is_really_smaller_arg ~subst context n nn kl x safes (List.nth tl k)
953 (fun t i -> i && guarded_by_destructors ~subst context n nn kl x safes t)
955 | C.Var (_,exp_named_subst)
956 | C.Const (_,exp_named_subst)
957 | C.MutInd (_,_,exp_named_subst)
958 | C.MutConstruct (_,_,_,exp_named_subst) ->
960 (fun (_,t) i -> i && guarded_by_destructors ~subst context n nn kl x safes t)
962 | C.MutCase (uri,i,outtype,term,pl) ->
963 (match CicReduction.whd ~subst context term with
964 C.Rel m when List.mem m safes || m = x ->
965 let (lefts_and_tys,len,isinductive,paramsno,cl) =
966 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
968 C.InductiveDefinition (tl,_,paramsno,_) ->
969 let len = List.length tl in
970 let (_,isinductive,_,cl) = List.nth tl i in
972 List.map (fun (n,_,ty,_) ->
973 Some(Cic.Name n,(Cic.Decl ty))) tl
978 let debrujinedty = debrujin_constructor uri len ty in
979 (id, snd (split_prods ~subst tys paramsno ty),
980 snd (split_prods ~subst tys paramsno debrujinedty)
986 fst (split_prods ~subst [] paramsno ty)
988 (tys@lefts,len,isinductive,paramsno,cl')
990 raise (TypeCheckerFailure
991 (lazy ("Unknown mutual inductive definition:" ^
992 UriManager.string_of_uri uri)))
994 if not isinductive then
995 guarded_by_destructors ~subst context n nn kl x safes outtype &&
996 guarded_by_destructors ~subst context n nn kl x safes term &&
997 (*CSC: manca ??? il controllo sul tipo di term? *)
1000 i && guarded_by_destructors ~subst context n nn kl x safes p)
1007 Invalid_argument _ ->
1008 raise (TypeCheckerFailure (lazy "not enough patterns"))
1010 guarded_by_destructors ~subst context n nn kl x safes outtype &&
1011 (*CSC: manca ??? il controllo sul tipo di term? *)
1013 (fun (p,(_,c,brujinedc)) i ->
1014 let rl' = recursive_args lefts_and_tys 0 len brujinedc in
1015 let (e,safes',n',nn',x',context') =
1016 get_new_safes ~subst context p c rl' safes n nn x
1019 guarded_by_destructors ~subst context' n' nn' kl x' safes' e
1021 | C.Appl ((C.Rel m)::tl) when List.mem m safes || m = x ->
1022 let (lefts_and_tys,len,isinductive,paramsno,cl) =
1023 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
1025 C.InductiveDefinition (tl,_,paramsno,_) ->
1026 let (_,isinductive,_,cl) = List.nth tl i in
1029 (fun (n,_,ty,_) -> Some(Cic.Name n,(Cic.Decl ty))) tl
1034 (id, snd (split_prods ~subst tys paramsno ty))) cl in
1039 fst (split_prods ~subst [] paramsno ty)
1041 (tys@lefts,List.length tl,isinductive,paramsno,cl')
1043 raise (TypeCheckerFailure
1044 (lazy ("Unknown mutual inductive definition:" ^
1045 UriManager.string_of_uri uri)))
1047 if not isinductive then
1048 guarded_by_destructors ~subst context n nn kl x safes outtype &&
1049 guarded_by_destructors ~subst context n nn kl x safes term &&
1050 (*CSC: manca ??? il controllo sul tipo di term? *)
1053 i && guarded_by_destructors ~subst context n nn kl x safes p)
1060 Invalid_argument _ ->
1061 raise (TypeCheckerFailure (lazy "not enough patterns"))
1063 guarded_by_destructors ~subst context n nn kl x safes outtype &&
1064 (*CSC: manca ??? il controllo sul tipo di term? *)
1067 i && guarded_by_destructors ~subst context n nn kl x safes t)
1072 let debrujinedte = debrujin_constructor uri len c in
1073 recursive_args lefts_and_tys 0 len debrujinedte
1075 let (e, safes',n',nn',x',context') =
1076 get_new_safes ~subst context p c rl' safes n nn x
1079 guarded_by_destructors ~subst context' n' nn' kl x' safes' e
1082 guarded_by_destructors ~subst context n nn kl x safes outtype &&
1083 guarded_by_destructors ~subst context n nn kl x safes term &&
1084 (*CSC: manca ??? il controllo sul tipo di term? *)
1086 (fun p i -> i && guarded_by_destructors ~subst context n nn kl x safes p)
1090 let len = List.length fl in
1091 let n_plus_len = n + len
1092 and nn_plus_len = nn + len
1093 and x_plus_len = x + len
1094 and tys = List.map (fun (n,_,ty,_) -> Some (C.Name n,(C.Decl ty))) fl
1095 and safes' = List.map (fun x -> x + len) safes in
1097 (fun (_,_,ty,bo) i ->
1098 i && guarded_by_destructors ~subst context n nn kl x_plus_len safes' ty &&
1099 guarded_by_destructors ~subst (tys@context) n_plus_len nn_plus_len kl
1100 x_plus_len safes' bo
1102 | C.CoFix (_, fl) ->
1103 let len = List.length fl in
1104 let n_plus_len = n + len
1105 and nn_plus_len = nn + len
1106 and x_plus_len = x + len
1107 and tys = List.map (fun (n,ty,_) -> Some (C.Name n,(C.Decl ty))) fl
1108 and safes' = List.map (fun x -> x + len) safes in
1112 guarded_by_destructors ~subst context n nn kl x_plus_len safes' ty &&
1113 guarded_by_destructors ~subst (tys@context) n_plus_len nn_plus_len kl
1114 x_plus_len safes' bo
1117 (* the boolean h means already protected *)
1118 (* args is the list of arguments the type of the constructor that may be *)
1119 (* found in head position must be applied to. *)
1120 and guarded_by_constructors ~subst context n nn h te args coInductiveTypeURI =
1121 let module C = Cic in
1122 (*CSC: There is a lot of code replication between the cases X and *)
1123 (*CSC: (C.Appl X tl). Maybe it will be better to define a function *)
1124 (*CSC: that maps X into (C.Appl X []) when X is not already a C.Appl *)
1125 match CicReduction.whd ~subst context te with
1126 C.Rel m when m > n && m <= nn -> h
1134 (* the term has just been type-checked *)
1135 raise (AssertFailure (lazy "17"))
1136 | C.Lambda (name,so,de) ->
1137 does_not_occur ~subst context n nn so &&
1138 guarded_by_constructors ~subst ((Some (name,(C.Decl so)))::context)
1139 (n + 1) (nn + 1) h de args coInductiveTypeURI
1140 | C.Appl ((C.Rel m)::tl) when m > n && m <= nn ->
1142 List.fold_right (fun x i -> i && does_not_occur ~subst context n nn x) tl true
1143 | C.Appl ((C.MutConstruct (uri,i,j,exp_named_subst))::tl) ->
1147 CicEnvironment.get_cooked_obj ~trust:false CicUniv.empty_ugraph uri
1148 with Not_found -> assert false
1151 C.InductiveDefinition (itl,_,_,_) ->
1152 let (_,_,_,cl) = List.nth itl i in
1153 let (_,cons) = List.nth cl (j - 1) in
1154 CicSubstitution.subst_vars exp_named_subst cons
1156 raise (TypeCheckerFailure
1157 (lazy ("Unknown mutual inductive definition:" ^ UriManager.string_of_uri uri)))
1159 let rec analyse_branch context ty te =
1160 match CicReduction.whd ~subst context ty with
1161 C.Meta _ -> raise (AssertFailure (lazy "34"))
1165 does_not_occur ~subst context n nn te
1168 raise (AssertFailure (lazy "24"))(* due to type-checking *)
1169 | C.Prod (name,so,de) ->
1170 analyse_branch ((Some (name,(C.Decl so)))::context) de te
1173 raise (AssertFailure (lazy "25"))(* due to type-checking *)
1174 | C.Appl ((C.MutInd (uri,_,_))::_) when uri == coInductiveTypeURI ->
1175 guarded_by_constructors ~subst context n nn true te []
1177 | C.Appl ((C.MutInd (uri,_,_))::_) ->
1178 guarded_by_constructors ~subst context n nn true te tl
1181 does_not_occur ~subst context n nn te
1182 | C.Const _ -> raise (AssertFailure (lazy "26"))
1183 | C.MutInd (uri,_,_) when uri == coInductiveTypeURI ->
1184 guarded_by_constructors ~subst context n nn true te []
1187 does_not_occur ~subst context n nn te
1188 | C.MutConstruct _ -> raise (AssertFailure (lazy "27"))
1189 (*CSC: we do not consider backbones with a MutCase, Fix, Cofix *)
1190 (*CSC: in head position. *)
1194 raise (AssertFailure (lazy "28"))(* due to type-checking *)
1196 let rec analyse_instantiated_type context ty l =
1197 match CicReduction.whd ~subst context ty with
1203 | C.Cast _ -> raise (AssertFailure (lazy "29"))(* due to type-checking *)
1204 | C.Prod (name,so,de) ->
1209 analyse_branch context so he &&
1210 analyse_instantiated_type
1211 ((Some (name,(C.Decl so)))::context) de tl
1215 raise (AssertFailure (lazy "30"))(* due to type-checking *)
1218 (fun i x -> i && does_not_occur ~subst context n nn x) true l
1219 | C.Const _ -> raise (AssertFailure (lazy "31"))
1222 (fun i x -> i && does_not_occur ~subst context n nn x) true l
1223 | C.MutConstruct _ -> raise (AssertFailure (lazy "32"))
1224 (*CSC: we do not consider backbones with a MutCase, Fix, Cofix *)
1225 (*CSC: in head position. *)
1229 raise (AssertFailure (lazy "33"))(* due to type-checking *)
1231 let rec instantiate_type args consty =
1234 | tlhe::tltl as l ->
1235 let consty' = CicReduction.whd ~subst context consty in
1241 let instantiated_de = CicSubstitution.subst he de in
1242 (*CSC: siamo sicuri che non sia troppo forte? *)
1243 does_not_occur ~subst context n nn tlhe &
1244 instantiate_type tl instantiated_de tltl
1246 (*CSC:We do not consider backbones with a MutCase, a *)
1247 (*CSC:FixPoint, a CoFixPoint and so on in head position.*)
1248 raise (AssertFailure (lazy "23"))
1250 | [] -> analyse_instantiated_type context consty' l
1251 (* These are all the other cases *)
1253 instantiate_type args consty tl
1254 | C.Appl ((C.CoFix (_,fl))::tl) ->
1255 List.fold_left (fun i x -> i && does_not_occur ~subst context n nn x) true tl &&
1256 let len = List.length fl in
1257 let n_plus_len = n + len
1258 and nn_plus_len = nn + len
1259 (*CSC: Is a Decl of the ty ok or should I use Def of a Fix? *)
1260 and tys = List.map (fun (n,ty,_) -> Some (C.Name n,(C.Decl ty))) fl in
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? *)
1301 and tys = List.map (fun (n,_,ty,_)-> Some (C.Name n,(C.Decl ty))) fl in
1303 (fun (_,_,ty,bo) i ->
1304 i && does_not_occur ~subst context n nn ty &&
1305 does_not_occur ~subst (tys@context) n_plus_len nn_plus_len bo
1308 let len = List.length fl in
1309 let n_plus_len = n + len
1310 and nn_plus_len = nn + len
1311 (*CSC: Is a Decl of the ty ok or should I use Def of a Fix? *)
1312 and tys = List.map (fun (n,ty,_) -> Some (C.Name n,(C.Decl ty))) fl in
1315 i && does_not_occur ~subst context n nn ty &&
1316 guarded_by_constructors ~subst (tys@context) n_plus_len nn_plus_len
1318 args coInductiveTypeURI
1321 and check_allowed_sort_elimination ~subst ~metasenv ~logger context uri i
1322 need_dummy ind arity1 arity2 ugraph =
1323 let module C = Cic in
1324 let module U = UriManager in
1325 let arity1 = CicReduction.whd ~subst context arity1 in
1326 let rec check_allowed_sort_elimination_aux ugraph context arity2 need_dummy =
1327 match arity1, CicReduction.whd ~subst context arity2 with
1328 (C.Prod (_,so1,de1), C.Prod (_,so2,de2)) ->
1330 CicReduction.are_convertible ~subst ~metasenv context so1 so2 ugraph in
1332 check_allowed_sort_elimination ~subst ~metasenv ~logger context uri i
1333 need_dummy (C.Appl [CicSubstitution.lift 1 ind ; C.Rel 1]) de1 de2
1337 | (C.Sort _, C.Prod (name,so,ta)) when not need_dummy ->
1339 CicReduction.are_convertible ~subst ~metasenv context so ind ugraph in
1343 check_allowed_sort_elimination_aux ugraph1
1344 ((Some (name,C.Decl so))::context) ta true
1345 | (C.Sort C.Prop, C.Sort C.Prop) when need_dummy -> true,ugraph
1346 | (C.Sort C.Prop, C.Sort C.Set)
1347 | (C.Sort C.Prop, C.Sort C.CProp)
1348 | (C.Sort C.Prop, C.Sort (C.Type _) ) when need_dummy ->
1349 (let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
1351 C.InductiveDefinition (itl,_,paramsno,_) ->
1352 let itl_len = List.length itl in
1353 let (name,_,ty,cl) = List.nth itl i in
1354 let cl_len = List.length cl in
1355 if (cl_len = 0 || (itl_len = 1 && cl_len = 1)) then
1356 let non_informative,ugraph =
1357 if cl_len = 0 then true,ugraph
1359 is_non_informative ~logger [Some (C.Name name,C.Decl ty)]
1360 paramsno (snd (List.nth cl 0)) ugraph
1362 (* is it a singleton or empty non recursive and non informative
1364 non_informative, ugraph
1368 raise (TypeCheckerFailure
1369 (lazy ("Unknown mutual inductive definition:" ^
1370 UriManager.string_of_uri uri)))
1372 | (C.Sort C.Set, C.Sort C.Prop) when need_dummy -> true , ugraph
1373 | (C.Sort C.CProp, C.Sort C.Prop) when need_dummy -> true , ugraph
1374 | (C.Sort C.Set, C.Sort C.Set) when need_dummy -> true , ugraph
1375 | (C.Sort C.Set, C.Sort C.CProp) when need_dummy -> true , ugraph
1376 | (C.Sort C.CProp, C.Sort C.Set) when need_dummy -> true , ugraph
1377 | (C.Sort C.CProp, C.Sort C.CProp) when need_dummy -> true , ugraph
1378 | ((C.Sort C.Set, C.Sort (C.Type _)) | (C.Sort C.CProp, C.Sort (C.Type _)))
1380 (let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
1382 C.InductiveDefinition (itl,_,paramsno,_) ->
1384 List.map (fun (n,_,ty,_) -> Some (Cic.Name n,(Cic.Decl ty))) itl
1386 let (_,_,_,cl) = List.nth itl i in
1388 (fun (_,x) (i,ugraph) ->
1390 is_small ~logger tys paramsno x ugraph
1395 raise (TypeCheckerFailure
1396 (lazy ("Unknown mutual inductive definition:" ^
1397 UriManager.string_of_uri uri)))
1399 | (C.Sort (C.Type _), C.Sort _) when need_dummy -> true , ugraph
1400 | (_,_) -> false,ugraph
1402 check_allowed_sort_elimination_aux ugraph context arity2 need_dummy
1404 and type_of_branch ~subst context argsno need_dummy outtype term constype =
1405 let module C = Cic in
1406 let module R = CicReduction in
1407 match R.whd ~subst context constype with
1412 C.Appl [outtype ; term]
1413 | C.Appl (C.MutInd (_,_,_)::tl) ->
1414 let (_,arguments) = split tl argsno
1416 if need_dummy && arguments = [] then
1419 C.Appl (outtype::arguments@(if need_dummy then [] else [term]))
1420 | C.Prod (name,so,de) ->
1422 match CicSubstitution.lift 1 term with
1423 C.Appl l -> C.Appl (l@[C.Rel 1])
1424 | t -> C.Appl [t ; C.Rel 1]
1426 C.Prod (name,so,type_of_branch ~subst
1427 ((Some (name,(C.Decl so)))::context) argsno need_dummy
1428 (CicSubstitution.lift 1 outtype) term' de)
1429 | _ -> raise (AssertFailure (lazy "20"))
1431 (* check_metasenv_consistency checks that the "canonical" context of a
1432 metavariable is consitent - up to relocation via the relocation list l -
1433 with the actual context *)
1436 and check_metasenv_consistency ~logger ~subst metasenv context
1437 canonical_context l ugraph
1439 let module C = Cic in
1440 let module R = CicReduction in
1441 let module S = CicSubstitution in
1442 let lifted_canonical_context =
1446 | (Some (n,C.Decl t))::tl ->
1447 (Some (n,C.Decl (S.subst_meta l (S.lift i t))))::(aux (i+1) tl)
1448 | (Some (n,C.Def (t,None)))::tl ->
1449 (Some (n,C.Def ((S.subst_meta l (S.lift i t)),None)))::(aux (i+1) tl)
1450 | None::tl -> None::(aux (i+1) tl)
1451 | (Some (n,C.Def (t,Some ty)))::tl ->
1452 (Some (n,C.Def ((S.subst_meta l (S.lift i t)),Some (S.subst_meta l (S.lift i ty)))))::(aux (i+1) tl)
1454 aux 1 canonical_context
1460 | Some t,Some (_,C.Def (ct,_)) ->
1462 R.are_convertible ~subst ~metasenv context t ct ugraph
1467 (lazy (sprintf "Not well typed metavariable local context: expected a term convertible with %s, found %s" (CicPp.ppterm ct) (CicPp.ppterm t))))
1470 | Some t,Some (_,C.Decl ct) ->
1471 let type_t,ugraph1 =
1472 type_of_aux' ~logger ~subst metasenv context t ugraph
1475 R.are_convertible ~subst ~metasenv context type_t ct ugraph1
1478 raise (TypeCheckerFailure
1479 (lazy (sprintf "Not well typed metavariable local context: expected a term of type %s, found %s of type %s"
1480 (CicPp.ppterm ct) (CicPp.ppterm t)
1481 (CicPp.ppterm type_t))))
1485 raise (TypeCheckerFailure
1486 (lazy ("Not well typed metavariable local context: "^
1487 "an hypothesis, that is not hidden, is not instantiated")))
1488 ) ugraph l lifted_canonical_context
1492 type_of_aux' is just another name (with a different scope)
1496 and type_of_aux' ~logger ?(subst = []) metasenv context t ugraph =
1497 let rec type_of_aux ~logger context t ugraph =
1498 let module C = Cic in
1499 let module R = CicReduction in
1500 let module S = CicSubstitution in
1501 let module U = UriManager in
1505 match List.nth context (n - 1) with
1506 Some (_,C.Decl t) -> S.lift n t,ugraph
1507 | Some (_,C.Def (_,Some ty)) -> S.lift n ty,ugraph
1508 | Some (_,C.Def (bo,None)) ->
1509 debug_print (lazy "##### CASO DA INVESTIGARE E CAPIRE") ;
1510 type_of_aux ~logger context (S.lift n bo) ugraph
1512 (TypeCheckerFailure (lazy "Reference to deleted hypothesis"))
1515 raise (TypeCheckerFailure (lazy "unbound variable"))
1517 | C.Var (uri,exp_named_subst) ->
1520 check_exp_named_subst ~logger ~subst context exp_named_subst ugraph
1522 let ty,ugraph2 = type_of_variable ~logger uri ugraph1 in
1523 let ty1 = CicSubstitution.subst_vars exp_named_subst ty in
1528 let (canonical_context,term,ty) = CicUtil.lookup_subst n subst in
1530 check_metasenv_consistency ~logger
1531 ~subst metasenv context canonical_context l ugraph
1533 (* assuming subst is well typed !!!!! *)
1534 ((CicSubstitution.subst_meta l ty), ugraph1)
1535 (* type_of_aux context (CicSubstitution.subst_meta l term) *)
1536 with CicUtil.Subst_not_found _ ->
1537 let (_,canonical_context,ty) = CicUtil.lookup_meta n metasenv in
1539 check_metasenv_consistency ~logger
1540 ~subst metasenv context canonical_context l ugraph
1542 ((CicSubstitution.subst_meta l ty),ugraph1))
1543 (* TASSI: CONSTRAINTS *)
1544 | C.Sort (C.Type t) ->
1545 let t' = CicUniv.fresh() in
1546 let ugraph1 = CicUniv.add_gt t' t ugraph in
1547 (C.Sort (C.Type t')),ugraph1
1548 (* TASSI: CONSTRAINTS *)
1549 | C.Sort s -> (C.Sort (C.Type (CicUniv.fresh ()))),ugraph
1550 | C.Implicit _ -> raise (AssertFailure (lazy "21"))
1551 | C.Cast (te,ty) as t ->
1552 let _,ugraph1 = type_of_aux ~logger context ty ugraph in
1553 let ty_te,ugraph2 = type_of_aux ~logger context te ugraph1 in
1555 R.are_convertible ~subst ~metasenv context ty_te ty ugraph2
1560 raise (TypeCheckerFailure
1561 (lazy (sprintf "Invalid cast %s" (CicPp.ppterm t))))
1562 | C.Prod (name,s,t) ->
1563 let sort1,ugraph1 = type_of_aux ~logger context s ugraph in
1565 type_of_aux ~logger ((Some (name,(C.Decl s)))::context) t ugraph1
1567 sort_of_prod ~subst context (name,s) (sort1,sort2) ugraph2
1568 | C.Lambda (n,s,t) ->
1569 let sort1,ugraph1 = type_of_aux ~logger context s ugraph in
1570 (match R.whd ~subst context sort1 with
1575 (TypeCheckerFailure (lazy (sprintf
1576 "Not well-typed lambda-abstraction: the source %s should be a type; instead it is a term of type %s" (CicPp.ppterm s)
1577 (CicPp.ppterm sort1))))
1580 type_of_aux ~logger ((Some (n,(C.Decl s)))::context) t ugraph1
1582 (C.Prod (n,s,type2)),ugraph2
1583 | C.LetIn (n,s,t) ->
1584 (* only to check if s is well-typed *)
1585 let ty,ugraph1 = type_of_aux ~logger context s ugraph in
1586 (* The type of a LetIn is a LetIn. Extremely slow since the computed
1587 LetIn is later reduced and maybe also re-checked.
1588 (C.LetIn (n,s, type_of_aux ((Some (n,(C.Def s)))::context) t))
1590 (* The type of the LetIn is reduced. Much faster than the previous
1591 solution. Moreover the inferred type is probably very different
1592 from the expected one.
1593 (CicReduction.whd ~subst context
1594 (C.LetIn (n,s, type_of_aux ((Some (n,(C.Def s)))::context) t)))
1596 (* One-step LetIn reduction. Even faster than the previous solution.
1597 Moreover the inferred type is closer to the expected one. *)
1600 ((Some (n,(C.Def (s,Some ty))))::context) t ugraph1
1602 (CicSubstitution.subst ~avoid_beta_redexes:true s ty1),ugraph2
1603 | C.Appl (he::tl) when List.length tl > 0 ->
1604 let hetype,ugraph1 = type_of_aux ~logger context he ugraph in
1605 let tlbody_and_type,ugraph2 =
1608 let ty,ugraph1 = type_of_aux ~logger context x ugraph in
1609 let _,ugraph1 = type_of_aux ~logger context ty ugraph1 in
1610 ((x,ty)::l,ugraph1))
1613 (* TASSI: questa c'era nel mio... ma non nel CVS... *)
1614 (* let _,ugraph2 = type_of_aux context hetype ugraph2 in *)
1615 eat_prods ~subst context hetype tlbody_and_type ugraph2
1616 | C.Appl _ -> raise (AssertFailure (lazy "Appl: no arguments"))
1617 | C.Const (uri,exp_named_subst) ->
1620 check_exp_named_subst ~logger ~subst context exp_named_subst ugraph
1622 let cty,ugraph2 = type_of_constant ~logger uri ugraph1 in
1624 CicSubstitution.subst_vars exp_named_subst cty
1628 | C.MutInd (uri,i,exp_named_subst) ->
1631 check_exp_named_subst ~logger ~subst context exp_named_subst ugraph
1633 (* TASSI: da me c'era anche questa, ma in CVS no *)
1634 let mty,ugraph2 = type_of_mutual_inductive_defs ~logger uri i ugraph1 in
1635 (* fine parte dubbia *)
1637 CicSubstitution.subst_vars exp_named_subst mty
1641 | C.MutConstruct (uri,i,j,exp_named_subst) ->
1643 check_exp_named_subst ~logger ~subst context exp_named_subst ugraph
1645 (* TASSI: idem come sopra *)
1647 type_of_mutual_inductive_constr ~logger uri i j ugraph1
1650 CicSubstitution.subst_vars exp_named_subst mty
1653 | C.MutCase (uri,i,outtype,term,pl) ->
1654 let outsort,ugraph1 = type_of_aux ~logger context outtype ugraph in
1655 let (need_dummy, k) =
1656 let rec guess_args context t =
1657 let outtype = CicReduction.whd ~subst context t in
1659 C.Sort _ -> (true, 0)
1660 | C.Prod (name, s, t) ->
1662 guess_args ((Some (name,(C.Decl s)))::context) t in
1664 (* last prod before sort *)
1665 match CicReduction.whd ~subst context s with
1666 (*CSC: for _ see comment below about the missing named_exp_subst ?????????? *)
1667 C.MutInd (uri',i',_) when U.eq uri' uri && i' = i ->
1669 (*CSC: for _ see comment below about the missing named_exp_subst ?????????? *)
1670 | C.Appl ((C.MutInd (uri',i',_)) :: _)
1671 when U.eq uri' uri && i' = i -> (false, 1)
1679 "Malformed case analasys' output type %s"
1680 (CicPp.ppterm outtype))))
1683 let (parameters, arguments, exp_named_subst),ugraph2 =
1684 let ty,ugraph2 = type_of_aux context term ugraph1 in
1685 match R.whd ~subst context ty with
1686 (*CSC manca il caso dei CAST *)
1687 (*CSC: ma servono i parametri (uri,i)? Se si', perche' non serve anche il *)
1688 (*CSC: parametro exp_named_subst? Se no, perche' non li togliamo? *)
1689 (*CSC: Hint: nella DTD servono per gli stylesheet. *)
1690 C.MutInd (uri',i',exp_named_subst) as typ ->
1691 if U.eq uri uri' && i = i' then
1692 ([],[],exp_named_subst),ugraph2
1697 ("Case analysys: analysed term type is %s, but is expected to be (an application of) %s#1/%d{_}")
1698 (CicPp.ppterm typ) (U.string_of_uri uri) i)))
1700 ((C.MutInd (uri',i',exp_named_subst) as typ):: tl) as typ' ->
1701 if U.eq uri uri' && i = i' then
1703 split tl (List.length tl - k)
1704 in (params,args,exp_named_subst),ugraph2
1709 ("Case analysys: analysed term type is %s, "^
1710 "but is expected to be (an application of) "^
1712 (CicPp.ppterm typ') (U.string_of_uri uri) i)))
1718 "analysed term %s is not an inductive one")
1719 (CicPp.ppterm term))))
1721 let (b, k) = guess_args context outsort in
1722 if not b then (b, k - 1) else (b, k) in
1723 let (parameters, arguments, exp_named_subst),ugraph2 =
1724 let ty,ugraph2 = type_of_aux ~logger context term ugraph1 in
1725 match R.whd ~subst context ty with
1726 C.MutInd (uri',i',exp_named_subst) as typ ->
1727 if U.eq uri uri' && i = i' then
1728 ([],[],exp_named_subst),ugraph2
1732 ("Case analysys: analysed term type is %s (%s#1/%d{_}), but is expected to be (an application of) %s#1/%d{_}")
1733 (CicPp.ppterm typ) (U.string_of_uri uri') i' (U.string_of_uri uri) i)))
1734 | C.Appl ((C.MutInd (uri',i',exp_named_subst) as typ):: tl) ->
1735 if U.eq uri uri' && i = i' then
1737 split tl (List.length tl - k)
1738 in (params,args,exp_named_subst),ugraph2
1742 ("Case analysys: analysed term type is %s (%s#1/%d{_}), but is expected to be (an application of) %s#1/%d{_}")
1743 (CicPp.ppterm typ) (U.string_of_uri uri') i' (U.string_of_uri uri) i)))
1748 "Case analysis: analysed term %s is not an inductive one"
1749 (CicPp.ppterm term))))
1752 let's control if the sort elimination is allowed:
1755 let sort_of_ind_type =
1756 if parameters = [] then
1757 C.MutInd (uri,i,exp_named_subst)
1759 C.Appl ((C.MutInd (uri,i,exp_named_subst))::parameters)
1761 let type_of_sort_of_ind_ty,ugraph3 =
1762 type_of_aux ~logger context sort_of_ind_type ugraph2 in
1764 check_allowed_sort_elimination ~subst ~metasenv ~logger context uri i
1765 need_dummy sort_of_ind_type type_of_sort_of_ind_ty outsort ugraph3
1769 (TypeCheckerFailure (lazy ("Case analasys: sort elimination not allowed")));
1770 (* let's check if the type of branches are right *)
1774 CicEnvironment.get_cooked_obj ~trust:false CicUniv.empty_ugraph uri
1775 with Not_found -> assert false
1778 C.InductiveDefinition (_,_,parsno,_) -> parsno
1780 raise (TypeCheckerFailure
1781 (lazy ("Unknown mutual inductive definition:" ^
1782 UriManager.string_of_uri uri)))
1784 let (_,branches_ok,ugraph5) =
1786 (fun (j,b,ugraph) p ->
1789 if parameters = [] then
1790 (C.MutConstruct (uri,i,j,exp_named_subst))
1793 (C.MutConstruct (uri,i,j,exp_named_subst)::parameters))
1795 let ty_p,ugraph1 = type_of_aux ~logger context p ugraph in
1796 let ty_cons,ugraph3 = type_of_aux ~logger context cons ugraph1 in
1799 type_of_branch ~subst context parsno need_dummy outtype cons
1803 ~subst ~metasenv context ty_p ty_branch ugraph3
1808 prerr_endline ("\n!OUTTYPE= " ^ CicPp.ppterm outtype);
1809 prerr_endline ("!CONS= " ^ CicPp.ppterm cons);
1810 prerr_endline ("!TY_CONS= " ^ CicPp.ppterm ty_cons);
1811 prerr_endline ("#### " ^ CicPp.ppterm ty_p ^ "\n<==>\n" ^ CicPp.ppterm ty_branch);
1816 ("#### " ^ CicPp.ppterm ty_p ^
1817 " <==> " ^ CicPp.ppterm ty_branch));
1821 ) (1,true,ugraph4) pl
1823 if not branches_ok then
1825 (TypeCheckerFailure (lazy "Case analysys: wrong branch type"));
1827 if not need_dummy then outtype::arguments@[term]
1828 else outtype::arguments in
1830 if need_dummy && arguments = [] then outtype
1831 else CicReduction.head_beta_reduce (C.Appl arguments')
1835 let types_times_kl,ugraph1 =
1836 (* WAS: list rev list map *)
1838 (fun (l,ugraph) (n,k,ty,_) ->
1839 let _,ugraph1 = type_of_aux ~logger context ty ugraph in
1840 ((Some (C.Name n,(C.Decl ty)),k)::l,ugraph1)
1843 let (types,kl) = List.split types_times_kl in
1844 let len = List.length types in
1847 (fun ugraph (name,x,ty,bo) ->
1849 type_of_aux ~logger (types@context) bo ugraph
1852 R.are_convertible ~subst ~metasenv (types@context)
1853 ty_bo (CicSubstitution.lift len ty) ugraph1 in
1856 let (m, eaten, context') =
1857 eat_lambdas ~subst (types @ context) (x + 1) bo
1860 let's control the guarded by
1861 destructors conditions D{f,k,x,M}
1863 if not (guarded_by_destructors ~subst context' eaten
1864 (len + eaten) kl 1 [] m) then
1867 (lazy ("Fix: not guarded by destructors")))
1872 raise (TypeCheckerFailure (lazy ("Fix: ill-typed bodies")))
1874 (*CSC: controlli mancanti solo su D{f,k,x,M} *)
1875 let (_,_,ty,_) = List.nth fl i in
1880 (fun (l,ugraph) (n,ty,_) ->
1882 type_of_aux ~logger context ty ugraph in
1883 (Some (C.Name n,(C.Decl ty))::l,ugraph1)
1886 let len = List.length types in
1889 (fun ugraph (_,ty,bo) ->
1891 type_of_aux ~logger (types @ context) bo ugraph
1894 R.are_convertible ~subst ~metasenv (types @ context) ty_bo
1895 (CicSubstitution.lift len ty) ugraph1
1899 (* let's control that the returned type is coinductive *)
1900 match returns_a_coinductive ~subst context ty with
1904 (lazy "CoFix: does not return a coinductive type"))
1907 let's control the guarded by constructors
1910 if not (guarded_by_constructors ~subst
1911 (types @ context) 0 len false bo [] uri) then
1914 (lazy "CoFix: not guarded by constructors"))
1920 (TypeCheckerFailure (lazy "CoFix: ill-typed bodies"))
1923 let (_,ty,_) = List.nth fl i in
1926 and check_exp_named_subst ~logger ~subst context ugraph =
1927 let rec check_exp_named_subst_aux ~logger esubsts l ugraph =
1930 | ((uri,t) as item)::tl ->
1931 let ty_uri,ugraph1 = type_of_variable ~logger uri ugraph in
1933 CicSubstitution.subst_vars esubsts ty_uri in
1934 let typeoft,ugraph2 = type_of_aux ~logger context t ugraph1 in
1936 CicReduction.are_convertible ~subst ~metasenv
1937 context typeoft typeofvar ugraph2
1940 check_exp_named_subst_aux ~logger (esubsts@[item]) tl ugraph3
1943 CicReduction.fdebug := 0 ;
1945 (CicReduction.are_convertible
1946 ~subst ~metasenv context typeoft typeofvar ugraph2) ;
1948 debug typeoft [typeofvar] ;
1949 raise (TypeCheckerFailure (lazy "Wrong Explicit Named Substitution"))
1952 check_exp_named_subst_aux ~logger [] ugraph
1954 and sort_of_prod ~subst context (name,s) (t1, t2) ugraph =
1955 let module C = Cic in
1956 let t1' = CicReduction.whd ~subst context t1 in
1957 let t2' = CicReduction.whd ~subst ((Some (name,C.Decl s))::context) t2 in
1958 match (t1', t2') with
1959 (C.Sort s1, C.Sort s2)
1960 when (s2 = C.Prop or s2 = C.Set or s2 = C.CProp) ->
1961 (* different from Coq manual!!! *)
1963 | (C.Sort (C.Type t1), C.Sort (C.Type t2)) ->
1964 (* TASSI: CONSRTAINTS: the same in doubletypeinference, cicrefine *)
1965 let t' = CicUniv.fresh() in
1966 let ugraph1 = CicUniv.add_ge t' t1 ugraph in
1967 let ugraph2 = CicUniv.add_ge t' t2 ugraph1 in
1968 C.Sort (C.Type t'),ugraph2
1969 | (C.Sort _,C.Sort (C.Type t1)) ->
1970 (* TASSI: CONSRTAINTS: the same in doubletypeinference, cicrefine *)
1971 C.Sort (C.Type t1),ugraph (* c'e' bisogno di un fresh? *)
1972 | (C.Meta _, C.Sort _) -> t2',ugraph
1973 | (C.Meta _, (C.Meta (_,_) as t))
1974 | (C.Sort _, (C.Meta (_,_) as t)) when CicUtil.is_closed t ->
1976 | (_,_) -> raise (TypeCheckerFailure (lazy (sprintf
1977 "Prod: expected two sorts, found = %s, %s" (CicPp.ppterm t1')
1978 (CicPp.ppterm t2'))))
1980 and eat_prods ~subst context hetype l ugraph =
1981 (*CSC: siamo sicuri che le are_convertible non lavorino con termini non *)
1985 | (hete, hety)::tl ->
1986 (match (CicReduction.whd ~subst context hetype) with
1989 CicReduction.are_convertible
1990 ~subst ~metasenv context hety s ugraph
1994 CicReduction.fdebug := -1 ;
1995 eat_prods ~subst context
1996 (CicSubstitution.subst ~avoid_beta_redexes:true hete t)
1998 (*TASSI: not sure *)
2002 CicReduction.fdebug := 0 ;
2003 ignore (CicReduction.are_convertible
2004 ~subst ~metasenv context s hety ugraph) ;
2010 ("Appl: wrong parameter-type, expected %s, found %s")
2011 (CicPp.ppterm hetype) (CicPp.ppterm s))))
2014 raise (TypeCheckerFailure
2015 (lazy "Appl: this is not a function, it cannot be applied"))
2018 and returns_a_coinductive ~subst context ty =
2019 let module C = Cic in
2020 match CicReduction.whd ~subst context ty with
2021 C.MutInd (uri,i,_) ->
2022 (*CSC: definire una funzioncina per questo codice sempre replicato *)
2025 CicEnvironment.get_cooked_obj ~trust:false CicUniv.empty_ugraph uri
2026 with Not_found -> assert false
2029 C.InductiveDefinition (itl,_,_,_) ->
2030 let (_,is_inductive,_,_) = List.nth itl i in
2031 if is_inductive then None else (Some uri)
2033 raise (TypeCheckerFailure
2034 (lazy ("Unknown mutual inductive definition:" ^
2035 UriManager.string_of_uri uri)))
2037 | C.Appl ((C.MutInd (uri,i,_))::_) ->
2038 (let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
2040 C.InductiveDefinition (itl,_,_,_) ->
2041 let (_,is_inductive,_,_) = List.nth itl i in
2042 if is_inductive then None else (Some uri)
2044 raise (TypeCheckerFailure
2045 (lazy ("Unknown mutual inductive definition:" ^
2046 UriManager.string_of_uri uri)))
2048 | C.Prod (n,so,de) ->
2049 returns_a_coinductive ~subst ((Some (n,C.Decl so))::context) de
2054 debug_print (lazy ("INIZIO TYPE_OF_AUX " ^ CicPp.ppterm t)) ; flush stderr ;
2057 type_of_aux ~logger context t ugraph
2059 in debug_print (lazy "FINE TYPE_OF_AUX") ; flush stderr ; res
2062 (* is a small constructor? *)
2063 (*CSC: ottimizzare calcolando staticamente *)
2064 and is_small_or_non_informative ~condition ~logger context paramsno c ugraph =
2065 let rec is_small_or_non_informative_aux ~logger context c ugraph =
2066 let module C = Cic in
2067 match CicReduction.whd context c with
2069 let s,ugraph1 = type_of_aux' ~logger [] context so ugraph in
2070 let b = condition s in
2072 is_small_or_non_informative_aux
2073 ~logger ((Some (n,(C.Decl so)))::context) de ugraph1
2076 | _ -> true,ugraph (*CSC: we trust the type-checker *)
2078 let (context',dx) = split_prods ~subst:[] context paramsno c in
2079 is_small_or_non_informative_aux ~logger context' dx ugraph
2081 and is_small ~logger =
2082 is_small_or_non_informative
2083 ~condition:(fun s -> s=Cic.Sort Cic.Prop || s=Cic.Sort Cic.Set)
2086 and is_non_informative ~logger =
2087 is_small_or_non_informative
2088 ~condition:(fun s -> s=Cic.Sort Cic.Prop)
2091 and type_of ~logger t ugraph =
2093 debug_print (lazy ("INIZIO TYPE_OF_AUX' " ^ CicPp.ppterm t)) ; flush stderr ;
2096 type_of_aux' ~logger [] [] t ugraph
2098 in debug_print (lazy "FINE TYPE_OF_AUX'") ; flush stderr ; res
2102 let typecheck_obj0 ~logger uri ugraph =
2103 let module C = Cic in
2105 C.Constant (_,Some te,ty,_,_) ->
2106 let _,ugraph = type_of ~logger ty ugraph in
2107 let ty_te,ugraph = type_of ~logger te ugraph in
2108 let b,ugraph = (CicReduction.are_convertible [] ty_te ty ugraph) in
2110 raise (TypeCheckerFailure
2112 ("the type of the body is not the one expected:\n" ^
2113 CicPp.ppterm ty_te ^ "\nvs\n" ^
2117 | C.Constant (_,None,ty,_,_) ->
2118 (* only to check that ty is well-typed *)
2119 let _,ugraph = type_of ~logger ty ugraph in
2121 | C.CurrentProof (_,conjs,te,ty,_,_) ->
2124 (fun (metasenv,ugraph) ((_,context,ty) as conj) ->
2126 type_of_aux' ~logger metasenv context ty ugraph
2128 metasenv @ [conj],ugraph
2131 let _,ugraph = type_of_aux' ~logger conjs [] ty ugraph in
2132 let type_of_te,ugraph =
2133 type_of_aux' ~logger conjs [] te ugraph
2135 let b,ugraph = CicReduction.are_convertible [] type_of_te ty ugraph in
2137 raise (TypeCheckerFailure (lazy (sprintf
2138 "the current proof is not well typed because the type %s of the body is not convertible to the declared type %s"
2139 (CicPp.ppterm type_of_te) (CicPp.ppterm ty))))
2142 | C.Variable (_,bo,ty,_,_) ->
2143 (* only to check that ty is well-typed *)
2144 let _,ugraph = type_of ~logger ty ugraph in
2148 let ty_bo,ugraph = type_of ~logger bo ugraph in
2149 let b,ugraph = CicReduction.are_convertible [] ty_bo ty ugraph in
2151 raise (TypeCheckerFailure
2152 (lazy "the body is not the one expected"))
2156 | (C.InductiveDefinition _ as obj) ->
2157 check_mutual_inductive_defs ~logger uri obj ugraph
2160 let module C = Cic in
2161 let module R = CicReduction in
2162 let module U = UriManager in
2163 let logger = new CicLogger.logger in
2164 (* ??? match CicEnvironment.is_type_checked ~trust:true uri with ???? *)
2165 match CicEnvironment.is_type_checked ~trust:false CicUniv.empty_ugraph uri with
2166 CicEnvironment.CheckedObj (cobj,ugraph') ->
2167 (* debug_print (lazy ("NON-INIZIO A TYPECHECKARE " ^ U.string_of_uri uri));*)
2169 | CicEnvironment.UncheckedObj uobj ->
2170 (* let's typecheck the uncooked object *)
2171 logger#log (`Start_type_checking uri) ;
2172 (* debug_print (lazy ("INIZIO A TYPECHECKARE " ^ U.string_of_uri uri)); *)
2173 let ugraph = typecheck_obj0 ~logger uri CicUniv.empty_ugraph uobj in
2175 CicEnvironment.set_type_checking_info uri;
2176 logger#log (`Type_checking_completed uri);
2177 match CicEnvironment.is_type_checked ~trust:false ugraph uri with
2178 CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
2179 | _ -> raise CicEnvironmentError
2182 this is raised if set_type_checking_info is called on an object
2183 that has no associated universe file. If we are in univ_maker
2184 phase this is OK since univ_maker will properly commit the
2187 Invalid_argument s ->
2188 (*debug_print (lazy s);*)
2192 let typecheck_obj ~logger uri obj =
2193 let ugraph = typecheck_obj0 ~logger uri CicUniv.empty_ugraph obj in
2194 let ugraph, univlist, obj = CicUnivUtils.clean_and_fill uri obj ugraph in
2195 CicEnvironment.add_type_checked_obj uri (obj,ugraph,univlist)
2197 (** wrappers which instantiate fresh loggers *)
2199 let profiler = HExtlib.profile "K/CicTypeChecker.type_of_aux'"
2201 let type_of_aux' ?(subst = []) metasenv context t ugraph =
2202 let logger = new CicLogger.logger in
2203 profiler.HExtlib.profile
2204 (type_of_aux' ~logger ~subst metasenv context t) ugraph
2206 let typecheck_obj uri obj =
2207 let logger = new CicLogger.logger in
2208 typecheck_obj ~logger uri obj
2210 (* check_allowed_sort_elimination uri i s1 s2
2211 This function is used outside the kernel to determine in advance whether
2212 a MutCase will be allowed or not.
2213 [uri,i] is the type of the term to match
2214 [s1] is the sort of the term to eliminate (i.e. the head of the arity
2215 of the inductive type [uri,i])
2216 [s2] is the sort of the goal (i.e. the head of the type of the outtype
2218 let check_allowed_sort_elimination uri i s1 s2 =
2219 fst (check_allowed_sort_elimination ~subst:[] ~metasenv:[]
2220 ~logger:(new CicLogger.logger) [] uri i true
2221 (Cic.Implicit None) (* never used *) (Cic.Sort s1) (Cic.Sort s2)
2222 CicUniv.empty_ugraph)