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"))
58 let ugraph_convertibility ug1 ug2 ul2 = true;;
60 let check_and_clean_ugraph inferred_ugraph unchecked_ugraph uri obj =
61 match unchecked_ugraph with
63 if not (ugraph_convertibility inferred_ugraph ug ul) then
64 raise (TypeCheckerFailure (lazy
65 ("inferred univ graph not equal with declared ugraph")))
69 CicUnivUtils.clean_and_fill uri obj inferred_ugraph
72 let debrujin_constructor ?(cb=fun _ _ -> ()) ?(check_exp_named_subst=true) uri number_of_types context =
77 C.Rel n as t when n <= k -> t
79 raise (TypeCheckerFailure (lazy "unbound variable found in constructor type"))
80 | C.Var (uri,exp_named_subst) ->
81 let exp_named_subst' =
82 List.map (function (uri,t) -> (uri,aux k t)) exp_named_subst
84 C.Var (uri,exp_named_subst')
86 let l' = List.map (function None -> None | Some t -> Some (aux k t)) l in
89 | C.Implicit _ as t -> t
90 | C.Cast (te,ty) -> C.Cast (aux k te, aux k ty)
91 | C.Prod (n,s,t) -> C.Prod (n, aux k s, aux (k+1) t)
92 | C.Lambda (n,s,t) -> C.Lambda (n, aux k s, aux (k+1) t)
93 | C.LetIn (n,s,ty,t) -> C.LetIn (n, aux k s, aux k ty, aux (k+1) t)
94 | C.Appl l -> C.Appl (List.map (aux k) l)
95 | C.Const (uri,exp_named_subst) ->
96 let exp_named_subst' =
97 List.map (function (uri,t) -> (uri,aux k t)) exp_named_subst
99 C.Const (uri,exp_named_subst')
100 | C.MutInd (uri',tyno,exp_named_subst) when UriManager.eq uri uri' ->
101 if check_exp_named_subst && exp_named_subst != [] then
102 raise (TypeCheckerFailure
103 (lazy ("non-empty explicit named substitution is applied to "^
104 "a mutual inductive type which is being defined"))) ;
105 C.Rel (k + number_of_types - tyno) ;
106 | C.MutInd (uri',tyno,exp_named_subst) ->
107 let exp_named_subst' =
108 List.map (function (uri,t) -> (uri,aux k t)) exp_named_subst
110 C.MutInd (uri',tyno,exp_named_subst')
111 | C.MutConstruct (uri,tyno,consno,exp_named_subst) ->
112 let exp_named_subst' =
113 List.map (function (uri,t) -> (uri,aux k t)) exp_named_subst
115 C.MutConstruct (uri,tyno,consno,exp_named_subst')
116 | C.MutCase (sp,i,outty,t,pl) ->
117 C.MutCase (sp, i, aux k outty, aux k t,
120 let len = List.length fl in
123 (fun (name, i, ty, bo) -> (name, i, aux k ty, aux (k+len) bo))
128 let len = List.length fl in
131 (fun (name, ty, bo) -> (name, aux k ty, aux (k+len) bo))
134 C.CoFix (i, liftedfl)
139 aux (List.length context)
142 exception CicEnvironmentError;;
144 let rec type_of_constant ~logger uri orig_ugraph =
145 let module C = Cic in
146 let module R = CicReduction in
147 let module U = UriManager in
149 match CicEnvironment.is_type_checked ~trust:true orig_ugraph uri with
150 CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
151 | CicEnvironment.UncheckedObj (uobj,unchecked_ugraph) ->
152 logger#log (`Start_type_checking uri) ;
153 (* let's typecheck the uncooked obj *)
154 let inferred_ugraph =
156 C.Constant (_,Some te,ty,_,_) ->
157 let _,ugraph = type_of ~logger ty CicUniv.empty_ugraph in
158 let type_of_te,ugraph = type_of ~logger te ugraph in
159 let b,ugraph = R.are_convertible [] type_of_te ty ugraph in
161 raise (TypeCheckerFailure (lazy (sprintf
162 "the constant %s is not well typed because the type %s of the body is not convertible to the declared type %s"
163 (U.string_of_uri uri) (CicPp.ppterm type_of_te)
167 | C.Constant (_,None,ty,_,_) ->
168 (* only to check that ty is well-typed *)
169 let _,ugraph = type_of ~logger ty CicUniv.empty_ugraph in
171 | C.CurrentProof (_,conjs,te,ty,_,_) ->
174 (fun (metasenv,ugraph) ((_,context,ty) as conj) ->
176 type_of_aux' ~logger metasenv context ty ugraph
178 (metasenv @ [conj],ugraph)
179 ) ([],CicUniv.empty_ugraph) conjs
181 let _,ugraph = type_of_aux' ~logger conjs [] ty ugraph in
182 let type_of_te,ugraph = type_of_aux' ~logger conjs [] te ugraph in
183 let b,ugraph = R.are_convertible [] type_of_te ty ugraph in
185 raise (TypeCheckerFailure (lazy (sprintf
186 "the current proof %s is not well typed because the type %s of the body is not convertible to the declared type %s"
187 (U.string_of_uri uri) (CicPp.ppterm type_of_te)
193 (TypeCheckerFailure (lazy ("Unknown constant:" ^ U.string_of_uri uri)))
195 let ugraph, ul, obj = check_and_clean_ugraph inferred_ugraph unchecked_ugraph uri uobj in
196 CicEnvironment.set_type_checking_info uri (obj, ugraph, ul);
197 logger#log (`Type_checking_completed uri) ;
198 match CicEnvironment.is_type_checked ~trust:false orig_ugraph uri with
199 CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
200 | CicEnvironment.UncheckedObj _ -> raise CicEnvironmentError
202 match cobj,ugraph with
203 (C.Constant (_,_,ty,_,_)),g -> ty,g
204 | (C.CurrentProof (_,_,_,ty,_,_)),g -> ty,g
206 raise (TypeCheckerFailure (lazy ("Unknown constant:" ^ U.string_of_uri uri)))
208 and type_of_variable ~logger uri orig_ugraph =
209 let module C = Cic in
210 let module R = CicReduction in
211 let module U = UriManager in
212 (* 0 because a variable is never cooked => no partial cooking at one level *)
213 match CicEnvironment.is_type_checked ~trust:true orig_ugraph uri with
214 | CicEnvironment.CheckedObj ((C.Variable (_,_,ty,_,_)),ugraph') -> ty,ugraph'
215 | CicEnvironment.UncheckedObj
216 (C.Variable (_,bo,ty,_,_) as uobj, unchecked_ugraph)
218 logger#log (`Start_type_checking uri) ;
219 (* only to check that ty is well-typed *)
220 let _,ugraph = type_of ~logger ty CicUniv.empty_ugraph in
221 let inferred_ugraph =
225 let ty_bo,ugraph = type_of ~logger bo ugraph in
226 let b,ugraph = R.are_convertible [] ty_bo ty ugraph in
228 raise (TypeCheckerFailure
229 (lazy ("Unknown variable:" ^ U.string_of_uri uri)))
233 let ugraph, ul, obj =
234 check_and_clean_ugraph inferred_ugraph unchecked_ugraph uri uobj
236 CicEnvironment.set_type_checking_info uri (obj, ugraph, ul);
237 logger#log (`Type_checking_completed uri) ;
238 (match CicEnvironment.is_type_checked ~trust:false orig_ugraph uri with
239 CicEnvironment.CheckedObj((C.Variable(_,_,ty,_,_)),ugraph)->ty,ugraph
240 | CicEnvironment.CheckedObj _
241 | CicEnvironment.UncheckedObj _ -> raise CicEnvironmentError)
243 raise (TypeCheckerFailure (lazy
244 ("Unknown variable:" ^ U.string_of_uri uri)))
246 and does_not_occur ?(subst=[]) context n nn te =
247 let module C = Cic in
249 C.Rel m when m > n && m <= nn -> false
252 (match List.nth context (m-1) with
253 Some (_,C.Def (bo,_)) ->
254 does_not_occur ~subst context n nn (CicSubstitution.lift m bo)
257 Failure _ -> assert false)
259 | C.Implicit _ -> true
265 | Some x -> i && does_not_occur ~subst context n nn x) l true &&
267 let (canonical_context,term,ty) = CicUtil.lookup_subst mno subst in
268 does_not_occur ~subst context n nn (CicSubstitution.subst_meta l term)
270 CicUtil.Subst_not_found _ -> true)
272 does_not_occur ~subst context n nn te &&
273 does_not_occur ~subst context n nn ty
274 | C.Prod (name,so,dest) ->
275 does_not_occur ~subst context n nn so &&
276 does_not_occur ~subst ((Some (name,(C.Decl so)))::context) (n + 1)
278 | C.Lambda (name,so,dest) ->
279 does_not_occur ~subst context n nn so &&
280 does_not_occur ~subst ((Some (name,(C.Decl so)))::context) (n+1) (nn+1)
282 | C.LetIn (name,so,ty,dest) ->
283 does_not_occur ~subst context n nn so &&
284 does_not_occur ~subst context n nn ty &&
285 does_not_occur ~subst ((Some (name,(C.Def (so,ty))))::context)
286 (n + 1) (nn + 1) dest
288 List.for_all (does_not_occur ~subst context n nn) l
289 | C.Var (_,exp_named_subst)
290 | C.Const (_,exp_named_subst)
291 | C.MutInd (_,_,exp_named_subst)
292 | C.MutConstruct (_,_,_,exp_named_subst) ->
293 List.for_all (fun (_,x) -> does_not_occur ~subst context n nn x)
295 | C.MutCase (_,_,out,te,pl) ->
296 does_not_occur ~subst context n nn out &&
297 does_not_occur ~subst context n nn te &&
298 List.for_all (does_not_occur ~subst context n nn) pl
300 let len = List.length fl in
301 let n_plus_len = n + len in
302 let nn_plus_len = nn + len in
305 (fun (types,len) (n,_,ty,_) ->
306 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
311 (fun (_,_,ty,bo) i ->
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 let len = List.length fl in
317 let n_plus_len = n + len in
318 let nn_plus_len = nn + len in
321 (fun (types,len) (n,ty,_) ->
322 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
328 i && does_not_occur ~subst context n nn ty &&
329 does_not_occur ~subst (tys @ context) n_plus_len nn_plus_len bo
332 (*CSC l'indice x dei tipi induttivi e' t.c. n < x <= nn *)
333 (*CSC questa funzione e' simile alla are_all_occurrences_positive, ma fa *)
334 (*CSC dei controlli leggermente diversi. Viene invocata solamente dalla *)
335 (*CSC strictly_positive *)
336 (*CSC definizione (giusta???) tratta dalla mail di Hugo ;-) *)
337 and weakly_positive context n nn uri te =
338 let module C = Cic in
339 (*CSC: Che schifo! Bisogna capire meglio e trovare una soluzione ragionevole!*)
341 C.MutInd (HelmLibraryObjects.Datatypes.nat_URI,0,[])
343 (*CSC: mettere in cicSubstitution *)
344 let rec subst_inductive_type_with_dummy_mutind =
346 C.MutInd (uri',0,_) when UriManager.eq uri' uri ->
348 | C.Appl ((C.MutInd (uri',0,_))::tl) when UriManager.eq uri' uri ->
350 | C.Cast (te,ty) -> subst_inductive_type_with_dummy_mutind te
351 | C.Prod (name,so,ta) ->
352 C.Prod (name, subst_inductive_type_with_dummy_mutind so,
353 subst_inductive_type_with_dummy_mutind ta)
354 | C.Lambda (name,so,ta) ->
355 C.Lambda (name, subst_inductive_type_with_dummy_mutind so,
356 subst_inductive_type_with_dummy_mutind ta)
357 | C.LetIn (name,so,ty,ta) ->
358 C.LetIn (name, subst_inductive_type_with_dummy_mutind so,
359 subst_inductive_type_with_dummy_mutind ty,
360 subst_inductive_type_with_dummy_mutind ta)
362 C.Appl (List.map subst_inductive_type_with_dummy_mutind tl)
363 | C.MutCase (uri,i,outtype,term,pl) ->
365 subst_inductive_type_with_dummy_mutind outtype,
366 subst_inductive_type_with_dummy_mutind term,
367 List.map subst_inductive_type_with_dummy_mutind pl)
369 C.Fix (i,List.map (fun (name,i,ty,bo) -> (name,i,
370 subst_inductive_type_with_dummy_mutind ty,
371 subst_inductive_type_with_dummy_mutind bo)) fl)
373 C.CoFix (i,List.map (fun (name,ty,bo) -> (name,
374 subst_inductive_type_with_dummy_mutind ty,
375 subst_inductive_type_with_dummy_mutind bo)) fl)
376 | C.Const (uri,exp_named_subst) ->
377 let exp_named_subst' =
379 (function (uri,t) -> (uri,subst_inductive_type_with_dummy_mutind t))
382 C.Const (uri,exp_named_subst')
383 | C.Var (uri,exp_named_subst) ->
384 let exp_named_subst' =
386 (function (uri,t) -> (uri,subst_inductive_type_with_dummy_mutind t))
389 C.Var (uri,exp_named_subst')
390 | C.MutInd (uri,typeno,exp_named_subst) ->
391 let exp_named_subst' =
393 (function (uri,t) -> (uri,subst_inductive_type_with_dummy_mutind t))
396 C.MutInd (uri,typeno,exp_named_subst')
397 | C.MutConstruct (uri,typeno,consno,exp_named_subst) ->
398 let exp_named_subst' =
400 (function (uri,t) -> (uri,subst_inductive_type_with_dummy_mutind t))
403 C.MutConstruct (uri,typeno,consno,exp_named_subst')
406 match CicReduction.whd context te with
408 C.Appl ((C.MutInd (uri',0,_))::tl) when UriManager.eq uri' uri -> true
410 C.Appl ((C.MutInd (uri',_,_))::tl) when UriManager.eq uri' uri -> true
411 | C.MutInd (uri',0,_) when UriManager.eq uri' uri -> true
412 | C.Prod (name,source,dest) when
413 does_not_occur ((Some (name,(C.Decl source)))::context) 0 1 dest ->
414 (* dummy abstraction, so we behave as in the anonimous case *)
415 strictly_positive context n nn
416 (subst_inductive_type_with_dummy_mutind source) &&
417 weakly_positive ((Some (name,(C.Decl source)))::context)
418 (n + 1) (nn + 1) uri dest
419 | C.Prod (name,source,dest) ->
420 does_not_occur context n nn
421 (subst_inductive_type_with_dummy_mutind source)&&
422 weakly_positive ((Some (name,(C.Decl source)))::context)
423 (n + 1) (nn + 1) uri dest
425 raise (TypeCheckerFailure (lazy "Malformed inductive constructor type"))
427 (* instantiate_parameters ps (x1:T1)...(xn:Tn)C *)
428 (* returns ((x_|ps|:T_|ps|)...(xn:Tn)C){ps_1 / x1 ; ... ; ps_|ps| / x_|ps|} *)
429 and instantiate_parameters params c =
430 let module C = Cic in
431 match (c,params) with
433 | (C.Prod (_,_,ta), he::tl) ->
434 instantiate_parameters tl
435 (CicSubstitution.subst he ta)
436 | (C.Cast (te,_), _) -> instantiate_parameters params te
437 | (t,l) -> raise (AssertFailure (lazy "1"))
439 and strictly_positive context n nn te =
440 let module C = Cic in
441 let module U = UriManager in
442 match CicReduction.whd context te with
443 | t when does_not_occur context n nn t -> true
446 (*CSC: bisogna controllare ty????*)
447 strictly_positive context n nn te
448 | C.Prod (name,so,ta) ->
449 does_not_occur context n nn so &&
450 strictly_positive ((Some (name,(C.Decl so)))::context) (n+1) (nn+1) ta
451 | C.Appl ((C.Rel m)::tl) when m > n && m <= nn ->
452 List.fold_right (fun x i -> i && does_not_occur context n nn x) tl true
453 | C.Appl ((C.MutInd (uri,i,exp_named_subst))::_)
454 | (C.MutInd (uri,i,exp_named_subst)) as t ->
455 let tl = match t with C.Appl (_::tl) -> tl | _ -> [] in
456 let (ok,paramsno,ity,cl,name) =
457 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
459 C.InductiveDefinition (tl,_,paramsno,_) ->
460 let (name,_,ity,cl) = List.nth tl i in
461 (List.length tl = 1, paramsno, ity, cl, name)
462 (* (true, paramsno, ity, cl, name) *)
466 (lazy ("Unknown inductive type:" ^ U.string_of_uri uri)))
468 let (params,arguments) = split tl paramsno in
469 let lifted_params = List.map (CicSubstitution.lift 1) params in
473 instantiate_parameters lifted_params
474 (CicSubstitution.subst_vars exp_named_subst te)
479 (fun x i -> i && does_not_occur context n nn x)
485 ((Some (C.Name name,(Cic.Decl ity)))::context) (n+1) (nn+1) uri
490 (* the inductive type indexes are s.t. n < x <= nn *)
491 and are_all_occurrences_positive context uri indparamsno i n nn te =
492 let module C = Cic in
493 match CicReduction.whd context te with
494 C.Appl ((C.Rel m)::tl) when m = i ->
495 (*CSC: riscrivere fermandosi a 0 *)
496 (* let's check if the inductive type is applied at least to *)
497 (* indparamsno parameters *)
503 match CicReduction.whd context x with
504 C.Rel m when m = n - (indparamsno - k) -> k - 1
506 raise (TypeCheckerFailure
508 ("Non-positive occurence in mutual inductive definition(s) [1]" ^
509 UriManager.string_of_uri uri)))
513 List.fold_right (fun x i -> i && does_not_occur context n nn x) tl true
515 raise (TypeCheckerFailure
516 (lazy ("Non-positive occurence in mutual inductive definition(s) [2]"^
517 UriManager.string_of_uri uri)))
518 | C.Rel m when m = i ->
519 if indparamsno = 0 then
522 raise (TypeCheckerFailure
523 (lazy ("Non-positive occurence in mutual inductive definition(s) [3]"^
524 UriManager.string_of_uri uri)))
525 | C.Prod (name,source,dest) when
526 does_not_occur ((Some (name,(C.Decl source)))::context) 0 1 dest ->
527 (* dummy abstraction, so we behave as in the anonimous case *)
528 strictly_positive context n nn source &&
529 are_all_occurrences_positive
530 ((Some (name,(C.Decl source)))::context) uri indparamsno
531 (i+1) (n + 1) (nn + 1) dest
532 | C.Prod (name,source,dest) ->
533 does_not_occur context n nn source &&
534 are_all_occurrences_positive ((Some (name,(C.Decl source)))::context)
535 uri indparamsno (i+1) (n + 1) (nn + 1) dest
538 (TypeCheckerFailure (lazy ("Malformed inductive constructor type " ^
539 (UriManager.string_of_uri uri))))
541 (* Main function to checks the correctness of a mutual *)
542 (* inductive block definition. This is the function *)
543 (* exported to the proof-engine. *)
544 and typecheck_mutual_inductive_defs ~logger uri (itl,_,indparamsno) ugraph =
545 let module U = UriManager in
546 (* let's check if the arity of the inductive types are well *)
548 let ugrap1 = List.fold_left
549 (fun ugraph (_,_,x,_) -> let _,ugraph' =
550 type_of ~logger x ugraph in ugraph')
553 (* let's check if the types of the inductive constructors *)
554 (* are well formed. *)
555 (* In order not to use type_of_aux we put the types of the *)
556 (* mutual inductive types at the head of the types of the *)
557 (* constructors using Prods *)
558 let len = List.length itl in
560 List.map (fun (n,_,ty,_) -> Some (Cic.Name n,(Cic.Decl ty))) itl in
563 (fun (_,_,_,cl) (i,ugraph) ->
566 (fun ugraph (name,te) ->
567 let debrujinedte = debrujin_constructor uri len [] te in
570 (fun (name,_,ty,_) i -> Cic.Prod (Cic.Name name, ty, i))
573 let _,ugraph' = type_of ~logger augmented_term ugraph in
574 (* let's check also the positivity conditions *)
577 (are_all_occurrences_positive tys uri indparamsno i 0 len
581 prerr_endline (UriManager.string_of_uri uri);
582 prerr_endline (string_of_int (List.length tys));
585 (lazy ("Non positive occurence in " ^ U.string_of_uri uri))) end
594 (* Main function to checks the correctness of a mutual *)
595 (* inductive block definition. *)
596 and check_mutual_inductive_defs uri obj ugraph =
598 Cic.InductiveDefinition (itl, params, indparamsno, _) ->
599 typecheck_mutual_inductive_defs uri (itl,params,indparamsno) ugraph
601 raise (TypeCheckerFailure (
602 lazy ("Unknown mutual inductive definition:" ^
603 UriManager.string_of_uri uri)))
605 and type_of_mutual_inductive_defs ~logger uri i orig_ugraph =
606 let module C = Cic in
607 let module R = CicReduction in
608 let module U = UriManager in
610 match CicEnvironment.is_type_checked ~trust:true orig_ugraph uri with
611 CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
612 | CicEnvironment.UncheckedObj (uobj,unchecked_ugraph) ->
613 logger#log (`Start_type_checking uri) ;
614 let inferred_ugraph =
615 check_mutual_inductive_defs ~logger uri uobj CicUniv.empty_ugraph
617 let ugraph, ul, obj = check_and_clean_ugraph inferred_ugraph unchecked_ugraph uri uobj in
618 CicEnvironment.set_type_checking_info uri (obj,ugraph,ul);
619 logger#log (`Type_checking_completed uri) ;
620 (match CicEnvironment.is_type_checked ~trust:false orig_ugraph uri with
621 CicEnvironment.CheckedObj (cobj,ugraph') -> (cobj,ugraph')
622 | CicEnvironment.UncheckedObj _ -> raise CicEnvironmentError
626 | C.InductiveDefinition (dl,_,_,_) ->
627 let (_,_,arity,_) = List.nth dl i in
630 raise (TypeCheckerFailure
631 (lazy ("Unknown mutual inductive definition:" ^ U.string_of_uri uri)))
633 and type_of_mutual_inductive_constr ~logger uri i j orig_ugraph =
634 let module C = Cic in
635 let module R = CicReduction in
636 let module U = UriManager in
638 match CicEnvironment.is_type_checked ~trust:true orig_ugraph uri with
639 CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
640 | CicEnvironment.UncheckedObj (uobj,unchecked_ugraph) ->
641 logger#log (`Start_type_checking uri) ;
642 let inferred_ugraph =
643 check_mutual_inductive_defs ~logger uri uobj CicUniv.empty_ugraph
645 let ugraph, ul, obj = check_and_clean_ugraph inferred_ugraph unchecked_ugraph uri uobj in
646 CicEnvironment.set_type_checking_info uri (obj, ugraph, ul);
647 logger#log (`Type_checking_completed uri) ;
649 CicEnvironment.is_type_checked ~trust:false orig_ugraph uri
651 CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
652 | CicEnvironment.UncheckedObj _ ->
653 raise CicEnvironmentError)
656 C.InductiveDefinition (dl,_,_,_) ->
657 let (_,_,_,cl) = List.nth dl i in
658 let (_,ty) = List.nth cl (j-1) in
661 raise (TypeCheckerFailure
662 (lazy ("Unknown mutual inductive definition:" ^ UriManager.string_of_uri uri)))
664 and recursive_args context n nn te =
665 let module C = Cic in
666 match CicReduction.whd context te with
673 | C.Cast _ (*CSC ??? *) ->
674 raise (AssertFailure (lazy "3")) (* due to type-checking *)
675 | C.Prod (name,so,de) ->
676 (not (does_not_occur context n nn so)) ::
677 (recursive_args ((Some (name,(C.Decl so)))::context) (n+1) (nn + 1) de)
680 raise (AssertFailure (lazy "4")) (* due to type-checking *)
682 | C.Const _ -> raise (AssertFailure (lazy "5"))
686 | C.CoFix _ -> raise (AssertFailure (lazy "6")) (* due to type-checking *)
688 and get_new_safes ~subst context p rl safes n nn x =
689 let module C = Cic in
690 let module U = UriManager in
691 let module R = CicReduction in
692 match R.whd ~subst context p, rl with
693 | C.Lambda (name,so,ta), b::tl ->
694 let safes = List.map (fun x -> x + 1) safes in
695 let safes = if b then 1::safes else safes in
696 get_new_safes ~subst ((Some (name,(C.Decl so)))::context)
697 ta tl safes (n+1) (nn+1) (x+1)
698 | C.MutConstruct _ as e, _
700 | e, [] -> (e,safes,n,nn,x,context)
704 (Printf.sprintf "Get New Safes: p=%s" (CicPp.ppterm p))))
706 and split_prods ~subst context n te =
707 let module C = Cic in
708 let module R = CicReduction in
709 match (n, R.whd ~subst context te) with
711 | (n, C.Prod (name,so,ta)) when n > 0 ->
712 split_prods ~subst ((Some (name,(C.Decl so)))::context) (n - 1) ta
713 | (_, _) -> raise (AssertFailure (lazy "8"))
715 and eat_lambdas ~subst context n te =
716 let module C = Cic in
717 let module R = CicReduction in
718 match (n, R.whd ~subst context te) with
719 (0, _) -> (te, 0, context)
720 | (n, C.Lambda (name,so,ta)) when n > 0 ->
721 let (te, k, context') =
722 eat_lambdas ~subst ((Some (name,(C.Decl so)))::context) (n - 1) ta
724 (te, k + 1, context')
726 raise (AssertFailure (lazy (sprintf "9 (%d, %s)" n (CicPp.ppterm te))))
728 and specialize_inductive_type ~logger ~subst ~metasenv context t =
729 let ty,_= type_of_aux' ~logger ~subst metasenv context t CicUniv.oblivion_ugraph in
730 match CicReduction.whd ~subst context ty with
731 | Cic.MutInd (uri,_,exp)
732 | Cic.Appl (Cic.MutInd (uri,_,exp) :: _) as ty ->
733 let args = match ty with Cic.Appl (_::tl) -> tl | _ -> [] in
734 let o,_ = CicEnvironment.get_obj CicUniv.oblivion_ugraph uri in
736 | Cic.InductiveDefinition (tl,_,paramsno,_) ->
737 let left_args,_ = HExtlib.split_nth paramsno args in
738 List.map (fun (name, isind, arity, cl) ->
739 let arity = CicSubstitution.subst_vars exp arity in
740 let arity = instantiate_parameters left_args arity in
744 let ty = CicSubstitution.subst_vars exp ty in
745 id, instantiate_parameters left_args ty)
748 name, isind, arity, cl)
753 and check_is_really_smaller_arg
754 ~logger ~metasenv ~subst rec_uri rec_uri_len context n nn kl x safes te
756 let module C = Cic in
757 let module U = UriManager in
758 (*CSC: we could perform beta-iota(-zeta?) immediately, and
759 delta only on-demand when it fails without *)
760 match CicReduction.whd ~subst context te with
761 C.Rel m when List.mem m safes -> true
767 check_is_really_smaller_arg rec_uri rec_uri_len
768 ~logger ~metasenv ~subst context n nn kl x safes he
769 | C.Lambda (name,ty,ta) ->
770 check_is_really_smaller_arg rec_uri rec_uri_len
771 ~logger ~metasenv ~subst (Some (name,Cic.Decl ty)::context)
772 (n+1) (nn+1) kl (x+1) (List.map (fun n -> n+1) safes) ta
773 | C.MutCase (uri,i,outtype,term,pl) ->
775 | C.Rel m | C.Appl ((C.Rel m)::_) when List.mem m safes || m = x ->
777 specialize_inductive_type ~logger ~subst ~metasenv context term
781 (fun (types,len) (n,_,ty,_) ->
782 Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
786 let _,isinductive,_,cl = List.nth tys i in
787 if not isinductive then
789 (check_is_really_smaller_arg rec_uri rec_uri_len
790 ~logger ~metasenv ~subst context n nn kl x safes)
797 debrujin_constructor ~check_exp_named_subst:false
798 rec_uri rec_uri_len context c in
799 let len_ctx = List.length context in
800 recursive_args (context@tys_ctx) len_ctx (len_ctx+rec_uri_len) c
802 let (e, safes',n',nn',x',context') =
803 get_new_safes ~subst context p rec_params safes n nn x
805 check_is_really_smaller_arg rec_uri rec_uri_len
806 ~logger ~metasenv ~subst context' n' nn' kl x' safes' e
810 (check_is_really_smaller_arg
811 rec_uri rec_uri_len ~logger ~metasenv ~subst
812 context n nn kl x safes) pl
815 let len = List.length fl in
816 let n_plus_len = n + len
817 and nn_plus_len = nn + len
818 and x_plus_len = x + len
821 (fun (types,len) (n,_,ty,_) ->
822 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
825 and safes' = List.map (fun x -> x + len) safes in
828 check_is_really_smaller_arg
829 rec_uri rec_uri_len ~logger ~metasenv ~subst
830 (tys@context) n_plus_len nn_plus_len kl
834 raise (AssertFailure (lazy ("An inhabitant of an inductive type in normal form cannot have this shape: " ^ CicPp.ppterm t)))
836 and guarded_by_destructors
837 ~logger ~metasenv ~subst rec_uri rec_uri_len context n nn kl x safes t
839 let module C = Cic in
840 let module U = UriManager in
841 let t = CicReduction.whd ~delta:false ~subst context t in
844 C.Rel m when m > n && m <= nn -> false
846 (match List.nth context (m-1) with
847 Some (_,C.Decl _) -> true
848 | Some (_,C.Def (bo,_)) ->
849 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x safes
850 (CicSubstitution.lift m bo)
851 | None -> raise (TypeCheckerFailure (lazy "Reference to deleted hypothesis"))
855 | C.Implicit _ -> true
857 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x safes te &&
858 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x safes ty
859 | C.Prod (name,so,ta) ->
860 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x safes so &&
861 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst ((Some (name,(C.Decl so)))::context)
862 (n+1) (nn+1) kl (x+1) (List.map (fun x -> x + 1) safes) ta
863 | C.Lambda (name,so,ta) ->
864 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x safes so &&
865 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst ((Some (name,(C.Decl so)))::context)
866 (n+1) (nn+1) kl (x+1) (List.map (fun x -> x + 1) safes) ta
867 | C.LetIn (name,so,ty,ta) ->
868 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x safes so &&
869 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x safes ty &&
870 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst ((Some (name,(C.Def (so,ty))))::context)
871 (n+1) (nn+1) kl (x+1) (List.map (fun x -> x + 1) safes) ta
872 | C.Appl ((C.Rel m)::tl) when m > n && m <= nn ->
873 let k = List.nth kl (m - n - 1) in
874 if not (List.length tl > k) then false
877 (guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x safes) tl &&
878 check_is_really_smaller_arg
880 ~logger ~metasenv ~subst context n nn kl x safes (List.nth tl k)
881 | C.Var (_,exp_named_subst)
882 | C.Const (_,exp_named_subst)
883 | C.MutInd (_,_,exp_named_subst)
884 | C.MutConstruct (_,_,_,exp_named_subst) ->
886 (fun (_,t) -> guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x safes t)
888 | C.MutCase (uri,i,outtype,term,pl) ->
889 (match CicReduction.whd ~subst context term with
891 | C.Appl ((C.Rel m)::_) as t when List.mem m safes || m = x ->
892 let tl = match t with C.Appl (_::tl) -> tl | _ -> [] in
894 (guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x safes)
897 specialize_inductive_type ~logger ~subst ~metasenv context t
901 (fun (types,len) (n,_,ty,_) ->
902 Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
906 let _,isinductive,_,cl = List.nth tys i in
907 if not isinductive then
908 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x safes outtype &&
909 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x safes term &&
911 (guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x safes)
914 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x safes outtype &&
919 debrujin_constructor ~check_exp_named_subst:false
920 rec_uri rec_uri_len context c in
921 let len_ctx = List.length context in
922 recursive_args (context@tys_ctx) len_ctx (len_ctx+rec_uri_len) c
924 let (e, safes',n',nn',x',context') =
925 get_new_safes ~subst context p rec_params safes n nn x
927 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context' n' nn' kl x' safes' e
930 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x safes outtype &&
931 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x safes term &&
932 (*CSC: manca ??? il controllo sul tipo di term? *)
934 (fun p i -> i && guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x safes p)
937 | C.Appl (C.Fix (fixno, fl)::_) | C.Fix (fixno,fl) as t->
938 let l = match t with C.Appl (_::tl) -> tl | _ -> [] in
939 let len = List.length fl in
940 let n_plus_len = n + len in
941 let nn_plus_len = nn + len in
942 let x_plus_len = x + len in
945 (fun (types,len) (n,_,ty,_) ->
946 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
949 let safes' = List.map (fun x -> x + len) safes in
951 (guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x safes) l &&
953 (fun (fixno',i) (_,recno,ty,bo) ->
956 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x_plus_len safes' ty &&
959 List.length l > recno &&
960 (*case where the recursive argument is already really_smaller *)
961 check_is_really_smaller_arg
962 rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x safes
965 let bo_without_lambdas,_,context =
966 eat_lambdas ~subst (tys@context) (recno+1) bo
968 (* we assume the formal argument to be safe *)
969 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context (n_plus_len+recno+1)
970 (nn_plus_len+recno+1) kl (x_plus_len+recno+1)
971 (1::List.map (fun x -> x+recno+1) safes')
974 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst (tys@context) n_plus_len nn_plus_len
975 kl x_plus_len safes' bo
978 let len = List.length fl in
979 let n_plus_len = n + len
980 and nn_plus_len = nn + len
981 and x_plus_len = x + len
984 (fun (types,len) (n,ty,_) ->
985 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
988 and safes' = List.map (fun x -> x + len) safes in
992 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x_plus_len safes' ty &&
993 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst (tys@context) n_plus_len nn_plus_len kl
998 (fun t i -> i && guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x safes t)
1003 let t' = CicReduction.whd ~subst context t in
1007 guarded_by_destructors rec_uri rec_uri_len ~logger ~metasenv ~subst context n nn kl x safes t'
1009 (* the boolean h means already protected *)
1010 (* args is the list of arguments the type of the constructor that may be *)
1011 (* found in head position must be applied to. *)
1012 and guarded_by_constructors ~logger ~subst ~metasenv indURI =
1013 let module C = Cic in
1014 let rec aux context n nn h te =
1015 match CicReduction.whd ~subst context te with
1016 | C.Rel m when m > n && m <= nn -> h
1024 | C.LetIn _ -> raise (AssertFailure (lazy "17"))
1025 | C.Lambda (name,so,de) ->
1026 does_not_occur ~subst context n nn so &&
1027 aux ((Some (name,(C.Decl so)))::context) (n + 1) (nn + 1) h de
1028 | C.Appl ((C.Rel m)::tl) when m > n && m <= nn ->
1029 h && List.for_all (does_not_occur ~subst context n nn) tl
1030 | C.MutConstruct (_,_,_,exp_named_subst) ->
1032 (fun (_,x) -> does_not_occur ~subst context n nn x) exp_named_subst
1033 | C.Appl ((C.MutConstruct (uri,i,j,exp_named_subst))::tl) as t ->
1035 (fun (_,x) -> does_not_occur ~subst context n nn x) exp_named_subst &&
1036 let consty, len_tys, tys_ctx, paramsno =
1038 specialize_inductive_type ~logger ~subst ~metasenv context t in
1039 let _,_,_,cl = List.nth tys i in
1040 let _,ty = List.nth cl (j-1) in
1041 ty, List.length tys,
1043 (fun (types,len) (n,_,ty,_) ->
1044 Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types, len+1)
1045 ([],0) tys), paramsno
1049 debrujin_constructor ~check_exp_named_subst:false
1050 indURI len_tys context consty
1052 let len_ctx = List.length context in
1053 recursive_args (context@tys_ctx) len_ctx (len_ctx+len_tys) c
1055 let rec analyse_instantiated_type rec_spec args =
1056 match rec_spec, args with
1057 | h::rec_spec, he::args ->
1058 aux context n nn h he &&
1059 analyse_instantiated_type rec_spec args
1061 | _ -> raise (AssertFailure (lazy
1062 ("Too many args for constructor: " ^ String.concat " "
1063 (List.map (fun x-> CicPp.ppterm x) args))))
1065 let left, args = HExtlib.split_nth paramsno tl in
1066 List.for_all (does_not_occur ~subst context n nn) left &&
1067 analyse_instantiated_type rec_params args
1068 | C.Appl ((C.MutCase (_,_,out,te,pl))::_)
1069 | C.MutCase (_,_,out,te,pl) as t ->
1070 let tl = match t with C.Appl (_::tl) -> tl | _ -> [] in
1071 List.for_all (does_not_occur ~subst context n nn) tl &&
1072 does_not_occur ~subst context n nn out &&
1073 does_not_occur ~subst context n nn te &&
1074 List.for_all (aux context n nn h ) pl
1076 | C.Appl (C.Fix (_,fl)::_) as t ->
1077 let tl = match t with C.Appl (_::tl) -> tl | _ -> [] in
1078 let len = List.length fl in
1079 let n_plus_len = n + len
1080 and nn_plus_len = nn + len
1083 (fun (types,len) (n,_,ty,_) ->
1084 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
1088 List.for_all (does_not_occur ~subst context n nn) tl &&
1091 does_not_occur ~subst context n nn ty &&
1092 aux (tys@context) n_plus_len nn_plus_len h bo)
1094 | C.Appl ((C.CoFix (_,fl))::_)
1095 | C.CoFix (_,fl) as t ->
1096 let tl = match t with C.Appl (_::tl) -> tl | _ -> [] in
1097 let len = List.length fl in
1098 let n_plus_len = n + len
1099 and nn_plus_len = nn + len
1102 (fun (types,len) (n,ty,_) ->
1103 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
1107 List.for_all (does_not_occur ~subst context n nn) tl &&
1110 does_not_occur ~subst context n nn ty &&
1111 aux (tys@context) n_plus_len nn_plus_len h bo)
1115 | C.Appl _ as t -> does_not_occur ~subst context n nn t
1119 and check_allowed_sort_elimination ~subst ~metasenv ~logger context uri i
1120 need_dummy ind arity1 arity2 ugraph =
1121 let module C = Cic in
1122 let module U = UriManager in
1123 let arity1 = CicReduction.whd ~subst context arity1 in
1124 let rec check_allowed_sort_elimination_aux ugraph context arity2 need_dummy =
1125 match arity1, CicReduction.whd ~subst context arity2 with
1126 (C.Prod (name,so1,de1), C.Prod (_,so2,de2)) ->
1128 CicReduction.are_convertible ~subst ~metasenv context so1 so2 ugraph in
1130 check_allowed_sort_elimination ~subst ~metasenv ~logger
1131 ((Some (name,C.Decl so1))::context) uri i
1132 need_dummy (C.Appl [CicSubstitution.lift 1 ind ; C.Rel 1]) de1 de2
1136 | (C.Sort _, C.Prod (name,so,ta)) when not need_dummy ->
1138 CicReduction.are_convertible ~subst ~metasenv context so ind ugraph in
1142 check_allowed_sort_elimination_aux ugraph1
1143 ((Some (name,C.Decl so))::context) ta true
1144 | (C.Sort C.Prop, C.Sort C.Prop) when need_dummy -> true,ugraph
1145 | (C.Sort C.Prop, C.Sort C.Set)
1146 | (C.Sort C.Prop, C.Sort C.CProp)
1147 | (C.Sort C.Prop, C.Sort (C.Type _) ) when need_dummy ->
1148 (let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
1150 C.InductiveDefinition (itl,_,paramsno,_) ->
1151 let itl_len = List.length itl in
1152 let (name,_,ty,cl) = List.nth itl i in
1153 let cl_len = List.length cl in
1154 if (cl_len = 0 || (itl_len = 1 && cl_len = 1)) then
1155 let non_informative,ugraph =
1156 if cl_len = 0 then true,ugraph
1158 is_non_informative ~logger [Some (C.Name name,C.Decl ty)]
1159 paramsno (snd (List.nth cl 0)) ugraph
1161 (* is it a singleton or empty non recursive and non informative
1163 non_informative, ugraph
1167 raise (TypeCheckerFailure
1168 (lazy ("Unknown mutual inductive definition:" ^
1169 UriManager.string_of_uri uri)))
1171 | (C.Sort C.Set, C.Sort C.Prop) when need_dummy -> true , ugraph
1172 | (C.Sort C.CProp, C.Sort C.Prop) when need_dummy -> true , ugraph
1173 | (C.Sort C.Set, C.Sort C.Set) when need_dummy -> true , ugraph
1174 | (C.Sort C.Set, C.Sort C.CProp) when need_dummy -> true , ugraph
1175 | (C.Sort C.CProp, C.Sort C.Set) when need_dummy -> true , ugraph
1176 | (C.Sort C.CProp, C.Sort C.CProp) when need_dummy -> true , ugraph
1177 | ((C.Sort C.Set, C.Sort (C.Type _)) | (C.Sort C.CProp, C.Sort (C.Type _)))
1179 (let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
1181 C.InductiveDefinition (itl,_,paramsno,_) ->
1183 List.map (fun (n,_,ty,_) -> Some (Cic.Name n,(Cic.Decl ty))) itl
1185 let (_,_,_,cl) = List.nth itl i in
1187 (fun (_,x) (i,ugraph) ->
1189 is_small ~logger tys paramsno x ugraph
1194 raise (TypeCheckerFailure
1195 (lazy ("Unknown mutual inductive definition:" ^
1196 UriManager.string_of_uri uri)))
1198 | (C.Sort (C.Type _), C.Sort _) when need_dummy -> true , ugraph
1199 | (_,_) -> false,ugraph
1201 check_allowed_sort_elimination_aux ugraph context arity2 need_dummy
1203 and type_of_branch ~subst context argsno need_dummy outtype term constype =
1204 let module C = Cic in
1205 let module R = CicReduction in
1206 match R.whd ~subst context constype with
1211 C.Appl [outtype ; term]
1212 | C.Appl (C.MutInd (_,_,_)::tl) ->
1213 let (_,arguments) = split tl argsno
1215 if need_dummy && arguments = [] then
1218 C.Appl (outtype::arguments@(if need_dummy then [] else [term]))
1219 | C.Prod (name,so,de) ->
1221 match CicSubstitution.lift 1 term with
1222 C.Appl l -> C.Appl (l@[C.Rel 1])
1223 | t -> C.Appl [t ; C.Rel 1]
1225 C.Prod (name,so,type_of_branch ~subst
1226 ((Some (name,(C.Decl so)))::context) argsno need_dummy
1227 (CicSubstitution.lift 1 outtype) term' de)
1228 | _ -> raise (AssertFailure (lazy "20"))
1230 (* check_metasenv_consistency checks that the "canonical" context of a
1231 metavariable is consitent - up to relocation via the relocation list l -
1232 with the actual context *)
1235 and check_metasenv_consistency ~logger ~subst metasenv context
1236 canonical_context l ugraph
1238 let module C = Cic in
1239 let module R = CicReduction in
1240 let module S = CicSubstitution in
1241 let lifted_canonical_context =
1245 | (Some (n,C.Decl t))::tl ->
1246 (Some (n,C.Decl (S.subst_meta l (S.lift i t))))::(aux (i+1) tl)
1247 | None::tl -> None::(aux (i+1) tl)
1248 | (Some (n,C.Def (t,ty)))::tl ->
1249 (Some (n,C.Def ((S.subst_meta l (S.lift i t)),S.subst_meta l (S.lift i ty))))::(aux (i+1) tl)
1251 aux 1 canonical_context
1257 | Some t,Some (_,C.Def (ct,_)) ->
1258 (*CSC: the following optimization is to avoid a possibly expensive
1259 reduction that can be easily avoided and that is quite
1260 frequent. However, this is better handled using levels to
1261 control reduction *)
1266 match List.nth context (n - 1) with
1267 Some (_,C.Def (te,_)) -> S.lift n te
1273 (*if t <> optimized_t && optimized_t = ct then prerr_endline "!!!!!!!!!!!!!!!"
1274 else if t <> optimized_t then prerr_endline ("@@ " ^ CicPp.ppterm t ^ " ==> " ^ CicPp.ppterm optimized_t ^ " <==> " ^ CicPp.ppterm ct);*)
1276 R.are_convertible ~subst ~metasenv context optimized_t ct ugraph
1281 (lazy (sprintf "Not well typed metavariable local context: expected a term convertible with %s, found %s" (CicPp.ppterm ct) (CicPp.ppterm t))))
1284 | Some t,Some (_,C.Decl ct) ->
1285 let type_t,ugraph1 =
1286 type_of_aux' ~logger ~subst metasenv context t ugraph
1289 R.are_convertible ~subst ~metasenv context type_t ct ugraph1
1292 raise (TypeCheckerFailure
1293 (lazy (sprintf "Not well typed metavariable local context: expected a term of type %s, found %s of type %s"
1294 (CicPp.ppterm ct) (CicPp.ppterm t)
1295 (CicPp.ppterm type_t))))
1299 raise (TypeCheckerFailure
1300 (lazy ("Not well typed metavariable local context: "^
1301 "an hypothesis, that is not hidden, is not instantiated")))
1302 ) ugraph l lifted_canonical_context
1306 type_of_aux' is just another name (with a different scope)
1310 and type_of_aux' ~logger ?(subst = []) metasenv context t ugraph =
1311 let rec type_of_aux ~logger context t ugraph =
1312 let module C = Cic in
1313 let module R = CicReduction in
1314 let module S = CicSubstitution in
1315 let module U = UriManager in
1319 match List.nth context (n - 1) with
1320 Some (_,C.Decl t) -> S.lift n t,ugraph
1321 | Some (_,C.Def (_,ty)) -> S.lift n ty,ugraph
1323 (TypeCheckerFailure (lazy "Reference to deleted hypothesis"))
1326 raise (TypeCheckerFailure (lazy "unbound variable"))
1328 | C.Var (uri,exp_named_subst) ->
1331 check_exp_named_subst uri ~logger ~subst context exp_named_subst ugraph
1333 let ty,ugraph2 = type_of_variable ~logger uri ugraph1 in
1334 let ty1 = CicSubstitution.subst_vars exp_named_subst ty in
1339 let (canonical_context,term,ty) = CicUtil.lookup_subst n subst in
1341 check_metasenv_consistency ~logger
1342 ~subst metasenv context canonical_context l ugraph
1344 (* assuming subst is well typed !!!!! *)
1345 ((CicSubstitution.subst_meta l ty), ugraph1)
1346 (* type_of_aux context (CicSubstitution.subst_meta l term) *)
1347 with CicUtil.Subst_not_found _ ->
1348 let (_,canonical_context,ty) = CicUtil.lookup_meta n metasenv in
1350 check_metasenv_consistency ~logger
1351 ~subst metasenv context canonical_context l ugraph
1353 ((CicSubstitution.subst_meta l ty),ugraph1))
1354 (* TASSI: CONSTRAINTS *)
1355 | C.Sort (C.Type t) ->
1356 let t' = CicUniv.fresh() in
1358 let ugraph1 = CicUniv.add_gt t' t ugraph in
1359 (C.Sort (C.Type t')),ugraph1
1361 CicUniv.UniverseInconsistency msg -> raise (TypeCheckerFailure msg))
1362 | C.Sort s -> (C.Sort (C.Type (CicUniv.fresh ()))),ugraph
1363 | C.Implicit _ -> raise (AssertFailure (lazy "Implicit found"))
1364 | C.Cast (te,ty) as t ->
1365 let _,ugraph1 = type_of_aux ~logger context ty ugraph in
1366 let ty_te,ugraph2 = type_of_aux ~logger context te ugraph1 in
1368 R.are_convertible ~subst ~metasenv context ty_te ty ugraph2
1373 raise (TypeCheckerFailure
1374 (lazy (sprintf "Invalid cast %s" (CicPp.ppterm t))))
1375 | C.Prod (name,s,t) ->
1376 let sort1,ugraph1 = type_of_aux ~logger context s ugraph in
1378 type_of_aux ~logger ((Some (name,(C.Decl s)))::context) t ugraph1
1380 sort_of_prod ~subst context (name,s) (sort1,sort2) ugraph2
1381 | C.Lambda (n,s,t) ->
1382 let sort1,ugraph1 = type_of_aux ~logger context s ugraph in
1383 (match R.whd ~subst context sort1 with
1388 (TypeCheckerFailure (lazy (sprintf
1389 "Not well-typed lambda-abstraction: the source %s should be a type; instead it is a term of type %s" (CicPp.ppterm s)
1390 (CicPp.ppterm sort1))))
1393 type_of_aux ~logger ((Some (n,(C.Decl s)))::context) t ugraph1
1395 (C.Prod (n,s,type2)),ugraph2
1396 | C.LetIn (n,s,ty,t) ->
1397 (* only to check if s is well-typed *)
1398 let ty',ugraph1 = type_of_aux ~logger context s ugraph in
1399 let _,ugraph1 = type_of_aux ~logger context ty ugraph1 in
1401 R.are_convertible ~subst ~metasenv context ty ty' ugraph1
1407 "The type of %s is %s but it is expected to be %s"
1408 (CicPp.ppterm s) (CicPp.ppterm ty') (CicPp.ppterm ty))))
1410 (* The type of a LetIn is a LetIn. Extremely slow since the computed
1411 LetIn is later reduced and maybe also re-checked.
1412 (C.LetIn (n,s, type_of_aux ((Some (n,(C.Def s)))::context) t))
1414 (* The type of the LetIn is reduced. Much faster than the previous
1415 solution. Moreover the inferred type is probably very different
1416 from the expected one.
1417 (CicReduction.whd ~subst context
1418 (C.LetIn (n,s, type_of_aux ((Some (n,(C.Def s)))::context) t)))
1420 (* One-step LetIn reduction. Even faster than the previous solution.
1421 Moreover the inferred type is closer to the expected one. *)
1424 ((Some (n,(C.Def (s,ty))))::context) t ugraph1
1426 (CicSubstitution.subst ~avoid_beta_redexes:true s ty1),ugraph2
1427 | C.Appl (he::tl) when List.length tl > 0 ->
1428 let hetype,ugraph1 = type_of_aux ~logger context he ugraph in
1429 let tlbody_and_type,ugraph2 =
1432 let ty,ugraph1 = type_of_aux ~logger context x ugraph in
1433 (*let _,ugraph1 = type_of_aux ~logger context ty ugraph1 in*)
1434 ((x,ty)::l,ugraph1))
1437 (* TASSI: questa c'era nel mio... ma non nel CVS... *)
1438 (* let _,ugraph2 = type_of_aux context hetype ugraph2 in *)
1439 eat_prods ~subst context hetype tlbody_and_type ugraph2
1440 | C.Appl _ -> raise (AssertFailure (lazy "Appl: no arguments"))
1441 | C.Const (uri,exp_named_subst) ->
1444 check_exp_named_subst uri ~logger ~subst context exp_named_subst ugraph
1446 let cty,ugraph2 = type_of_constant ~logger uri ugraph1 in
1448 CicSubstitution.subst_vars exp_named_subst cty
1452 | C.MutInd (uri,i,exp_named_subst) ->
1455 check_exp_named_subst uri ~logger ~subst context exp_named_subst ugraph
1457 let mty,ugraph2 = type_of_mutual_inductive_defs ~logger uri i ugraph1 in
1459 CicSubstitution.subst_vars exp_named_subst mty
1463 | C.MutConstruct (uri,i,j,exp_named_subst) ->
1465 check_exp_named_subst uri ~logger ~subst context exp_named_subst ugraph
1468 type_of_mutual_inductive_constr ~logger uri i j ugraph1
1471 CicSubstitution.subst_vars exp_named_subst mty
1474 | C.MutCase (uri,i,outtype,term,pl) ->
1475 let outsort,ugraph1 = type_of_aux ~logger context outtype ugraph in
1476 let (need_dummy, k) =
1477 let rec guess_args context t =
1478 let outtype = CicReduction.whd ~subst context t in
1480 C.Sort _ -> (true, 0)
1481 | C.Prod (name, s, t) ->
1483 guess_args ((Some (name,(C.Decl s)))::context) t in
1485 (* last prod before sort *)
1486 match CicReduction.whd ~subst context s with
1487 (*CSC: for _ see comment below about the missing named_exp_subst ?????????? *)
1488 C.MutInd (uri',i',_) when U.eq uri' uri && i' = i ->
1490 (*CSC: for _ see comment below about the missing named_exp_subst ?????????? *)
1491 | C.Appl ((C.MutInd (uri',i',_)) :: _)
1492 when U.eq uri' uri && i' = i -> (false, 1)
1500 "Malformed case analasys' output type %s"
1501 (CicPp.ppterm outtype))))
1504 let (parameters, arguments, exp_named_subst),ugraph2 =
1505 let ty,ugraph2 = type_of_aux context term ugraph1 in
1506 match R.whd ~subst context ty with
1507 (*CSC manca il caso dei CAST *)
1508 (*CSC: ma servono i parametri (uri,i)? Se si', perche' non serve anche il *)
1509 (*CSC: parametro exp_named_subst? Se no, perche' non li togliamo? *)
1510 (*CSC: Hint: nella DTD servono per gli stylesheet. *)
1511 C.MutInd (uri',i',exp_named_subst) as typ ->
1512 if U.eq uri uri' && i = i' then
1513 ([],[],exp_named_subst),ugraph2
1518 ("Case analysys: analysed term type is %s, but is expected to be (an application of) %s#1/%d{_}")
1519 (CicPp.ppterm typ) (U.string_of_uri uri) i)))
1521 ((C.MutInd (uri',i',exp_named_subst) as typ):: tl) as typ' ->
1522 if U.eq uri uri' && i = i' then
1524 split tl (List.length tl - k)
1525 in (params,args,exp_named_subst),ugraph2
1530 ("Case analysys: analysed term type is %s, "^
1531 "but is expected to be (an application of) "^
1533 (CicPp.ppterm typ') (U.string_of_uri uri) i)))
1539 "analysed term %s is not an inductive one")
1540 (CicPp.ppterm term))))
1542 let (b, k) = guess_args context outsort in
1543 if not b then (b, k - 1) else (b, k) in
1544 let (parameters, arguments, exp_named_subst),ugraph2 =
1545 let ty,ugraph2 = type_of_aux ~logger context term ugraph1 in
1546 match R.whd ~subst context ty with
1547 C.MutInd (uri',i',exp_named_subst) as typ ->
1548 if U.eq uri uri' && i = i' then
1549 ([],[],exp_named_subst),ugraph2
1553 ("Case analysys: analysed term type is %s (%s#1/%d{_}), but is expected to be (an application of) %s#1/%d{_}")
1554 (CicPp.ppterm typ) (U.string_of_uri uri') i' (U.string_of_uri uri) i)))
1555 | C.Appl ((C.MutInd (uri',i',exp_named_subst) as typ):: tl) ->
1556 if U.eq uri uri' && i = i' then
1558 split tl (List.length tl - k)
1559 in (params,args,exp_named_subst),ugraph2
1563 ("Case analysys: analysed term type is %s (%s#1/%d{_}), but is expected to be (an application of) %s#1/%d{_}")
1564 (CicPp.ppterm typ) (U.string_of_uri uri') i' (U.string_of_uri uri) i)))
1569 "Case analysis: analysed term %s is not an inductive one"
1570 (CicPp.ppterm term))))
1573 let's control if the sort elimination is allowed:
1576 let sort_of_ind_type =
1577 if parameters = [] then
1578 C.MutInd (uri,i,exp_named_subst)
1580 C.Appl ((C.MutInd (uri,i,exp_named_subst))::parameters)
1582 let type_of_sort_of_ind_ty,ugraph3 =
1583 type_of_aux ~logger context sort_of_ind_type ugraph2 in
1585 check_allowed_sort_elimination ~subst ~metasenv ~logger context uri i
1586 need_dummy sort_of_ind_type type_of_sort_of_ind_ty outsort ugraph3
1590 (TypeCheckerFailure (lazy ("Case analysis: sort elimination not allowed")));
1591 (* let's check if the type of branches are right *)
1592 let parsno,constructorsno =
1595 CicEnvironment.get_cooked_obj ~trust:false CicUniv.empty_ugraph uri
1596 with Not_found -> assert false
1599 C.InductiveDefinition (il,_,parsno,_) ->
1601 try List.nth il i with Failure _ -> assert false
1603 parsno, List.length cl
1605 raise (TypeCheckerFailure
1606 (lazy ("Unknown mutual inductive definition:" ^
1607 UriManager.string_of_uri uri)))
1609 if List.length pl <> constructorsno then
1610 raise (TypeCheckerFailure
1611 (lazy ("Wrong number of cases in case analysis"))) ;
1612 let (_,branches_ok,ugraph5) =
1614 (fun (j,b,ugraph) p ->
1617 if parameters = [] then
1618 (C.MutConstruct (uri,i,j,exp_named_subst))
1621 (C.MutConstruct (uri,i,j,exp_named_subst)::parameters))
1623 let ty_p,ugraph1 = type_of_aux ~logger context p ugraph in
1624 let ty_cons,ugraph3 = type_of_aux ~logger context cons ugraph1 in
1627 type_of_branch ~subst context parsno need_dummy outtype cons
1631 ~subst ~metasenv context ty_p ty_branch ugraph3
1636 prerr_endline ("\n!OUTTYPE= " ^ CicPp.ppterm outtype);
1637 prerr_endline ("!CONS= " ^ CicPp.ppterm cons);
1638 prerr_endline ("!TY_CONS= " ^ CicPp.ppterm ty_cons);
1639 prerr_endline ("#### " ^ CicPp.ppterm ty_p ^ "\n<==>\n" ^ CicPp.ppterm ty_branch);
1644 ("#### " ^ CicPp.ppterm ty_p ^
1645 " <==> " ^ CicPp.ppterm ty_branch));
1649 ) (1,true,ugraph4) pl
1651 if not branches_ok then
1653 (TypeCheckerFailure (lazy "Case analysys: wrong branch type"));
1655 if not need_dummy then outtype::arguments@[term]
1656 else outtype::arguments in
1658 if need_dummy && arguments = [] then outtype
1659 else CicReduction.head_beta_reduce (C.Appl arguments')
1663 let types,kl,ugraph1,len =
1665 (fun (types,kl,ugraph,len) (n,k,ty,_) ->
1666 let _,ugraph1 = type_of_aux ~logger context ty ugraph in
1667 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::types,
1668 k::kl,ugraph1,len+1)
1669 ) ([],[],ugraph,0) fl
1673 (fun ugraph (name,x,ty,bo) ->
1675 type_of_aux ~logger (types@context) bo ugraph
1678 R.are_convertible ~subst ~metasenv (types@context)
1679 ty_bo (CicSubstitution.lift len ty) ugraph1 in
1682 let (m, eaten, context') =
1683 eat_lambdas ~subst (types @ context) (x + 1) bo
1685 let rec_uri, rec_uri_len =
1687 match List.hd context' with
1688 Some (_,Cic.Decl he) -> he
1691 match CicReduction.whd ~subst (List.tl context') he with
1692 | Cic.MutInd (uri,_,_)
1693 | Cic.Appl (Cic.MutInd (uri,_,_)::_) ->
1696 CicEnvironment.get_obj
1697 CicUniv.oblivion_ugraph uri
1699 | Cic.InductiveDefinition (tl,_,_,_), _ ->
1701 | _ -> assert false)
1705 let's control the guarded by
1706 destructors conditions D{f,k,x,M}
1708 if not (guarded_by_destructors ~logger ~metasenv ~subst
1709 rec_uri rec_uri_len context' eaten (len + eaten) kl
1714 (lazy ("Fix: not guarded by destructors:"^CicPp.ppterm t)))
1719 raise (TypeCheckerFailure (lazy ("Fix: ill-typed bodies")))
1721 (*CSC: controlli mancanti solo su D{f,k,x,M} *)
1722 let (_,_,ty,_) = List.nth fl i in
1725 let types,ugraph1,len =
1727 (fun (l,ugraph,len) (n,ty,_) ->
1729 type_of_aux ~logger context ty ugraph in
1730 (Some (C.Name n,(C.Decl (CicSubstitution.lift len ty)))::l,
1736 (fun ugraph (_,ty,bo) ->
1738 type_of_aux ~logger (types @ context) bo ugraph
1741 R.are_convertible ~subst ~metasenv (types @ context) ty_bo
1742 (CicSubstitution.lift len ty) ugraph1
1746 (* let's control that the returned type is coinductive *)
1747 match returns_a_coinductive ~subst context ty with
1751 (lazy "CoFix: does not return a coinductive type"))
1754 let's control the guarded by constructors
1757 if not (guarded_by_constructors ~logger ~subst ~metasenv uri
1758 (types @ context) 0 len false bo) then
1761 (lazy "CoFix: not guarded by constructors"))
1767 (TypeCheckerFailure (lazy "CoFix: ill-typed bodies"))
1770 let (_,ty,_) = List.nth fl i in
1773 and check_exp_named_subst uri ~logger ~subst context ens ugraph =
1775 let obj,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
1777 Cic.Constant (_,_,_,params,_) -> params
1778 | Cic.Variable (_,_,_,params,_) -> params
1779 | Cic.CurrentProof (_,_,_,_,params,_) -> params
1780 | Cic.InductiveDefinition (_,params,_,_) -> params
1782 let rec check_same_order params ens =
1783 match params,ens with
1786 raise (TypeCheckerFailure (lazy "Bad explicit named substitution"))
1787 | uri::tl,(uri',_)::tl' when UriManager.eq uri uri' ->
1788 check_same_order tl tl'
1789 | _::tl,l -> check_same_order tl l
1791 let rec check_exp_named_subst_aux ~logger esubsts l ugraph =
1794 | ((uri,t) as item)::tl ->
1795 let ty_uri,ugraph1 = type_of_variable ~logger uri ugraph in
1797 CicSubstitution.subst_vars esubsts ty_uri in
1798 let typeoft,ugraph2 = type_of_aux ~logger context t ugraph1 in
1800 CicReduction.are_convertible ~subst ~metasenv
1801 context typeoft typeofvar ugraph2
1804 check_exp_named_subst_aux ~logger (esubsts@[item]) tl ugraph3
1807 CicReduction.fdebug := 0 ;
1809 (CicReduction.are_convertible
1810 ~subst ~metasenv context typeoft typeofvar ugraph2) ;
1812 debug typeoft [typeofvar] ;
1813 raise (TypeCheckerFailure (lazy "Wrong Explicit Named Substitution"))
1816 check_same_order params ens ;
1817 check_exp_named_subst_aux ~logger [] ens ugraph
1819 and sort_of_prod ~subst context (name,s) (t1, t2) ugraph =
1820 let module C = Cic in
1821 let t1' = CicReduction.whd ~subst context t1 in
1822 let t2' = CicReduction.whd ~subst ((Some (name,C.Decl s))::context) t2 in
1823 match (t1', t2') with
1824 (C.Sort s1, C.Sort s2)
1825 when (s2 = C.Prop or s2 = C.Set or s2 = C.CProp) ->
1826 (* different from Coq manual!!! *)
1828 | (C.Sort (C.Type t1), C.Sort (C.Type t2)) ->
1829 (* TASSI: CONSRTAINTS: the same in doubletypeinference, cicrefine *)
1830 let t' = CicUniv.fresh() in
1832 let ugraph1 = CicUniv.add_ge t' t1 ugraph in
1833 let ugraph2 = CicUniv.add_ge t' t2 ugraph1 in
1834 C.Sort (C.Type t'),ugraph2
1836 CicUniv.UniverseInconsistency msg -> raise (TypeCheckerFailure msg))
1837 | (C.Sort _,C.Sort (C.Type t1)) ->
1838 (* TASSI: CONSRTAINTS: the same in doubletypeinference, cicrefine *)
1839 C.Sort (C.Type t1),ugraph (* c'e' bisogno di un fresh? *)
1840 | (C.Meta _, C.Sort _) -> t2',ugraph
1841 | (C.Meta _, (C.Meta (_,_) as t))
1842 | (C.Sort _, (C.Meta (_,_) as t)) when CicUtil.is_closed t ->
1844 | (_,_) -> raise (TypeCheckerFailure (lazy (sprintf
1845 "Prod: expected two sorts, found = %s, %s" (CicPp.ppterm t1')
1846 (CicPp.ppterm t2'))))
1848 and eat_prods ~subst context hetype l ugraph =
1849 (*CSC: siamo sicuri che le are_convertible non lavorino con termini non *)
1853 | (hete, hety)::tl ->
1854 (match (CicReduction.whd ~subst context hetype) with
1857 (*if (match hety,s with Cic.Sort _,Cic.Sort _ -> false | _,_ -> true) && hety <> s then(
1858 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*)
1859 CicReduction.are_convertible
1860 ~subst ~metasenv context hety s ugraph
1864 CicReduction.fdebug := -1 ;
1865 eat_prods ~subst context
1866 (CicSubstitution.subst ~avoid_beta_redexes:true hete t)
1868 (*TASSI: not sure *)
1872 CicReduction.fdebug := 0 ;
1873 ignore (CicReduction.are_convertible
1874 ~subst ~metasenv context s hety ugraph) ;
1880 ("Appl: wrong parameter-type, expected %s, found %s")
1881 (CicPp.ppterm hetype) (CicPp.ppterm s))))
1884 raise (TypeCheckerFailure
1885 (lazy "Appl: this is not a function, it cannot be applied"))
1888 and returns_a_coinductive ~subst context ty =
1889 let module C = Cic in
1890 match CicReduction.whd ~subst context ty with
1891 C.MutInd (uri,i,_) ->
1892 (*CSC: definire una funzioncina per questo codice sempre replicato *)
1895 CicEnvironment.get_cooked_obj ~trust:false CicUniv.empty_ugraph uri
1896 with Not_found -> assert false
1899 C.InductiveDefinition (itl,_,_,_) ->
1900 let (_,is_inductive,_,_) = List.nth itl i in
1901 if is_inductive then None else (Some uri)
1903 raise (TypeCheckerFailure
1904 (lazy ("Unknown mutual inductive definition:" ^
1905 UriManager.string_of_uri uri)))
1907 | C.Appl ((C.MutInd (uri,i,_))::_) ->
1908 (let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
1910 C.InductiveDefinition (itl,_,_,_) ->
1911 let (_,is_inductive,_,_) = List.nth itl i in
1912 if is_inductive then None else (Some uri)
1914 raise (TypeCheckerFailure
1915 (lazy ("Unknown mutual inductive definition:" ^
1916 UriManager.string_of_uri uri)))
1918 | C.Prod (n,so,de) ->
1919 returns_a_coinductive ~subst ((Some (n,C.Decl so))::context) de
1924 debug_print (lazy ("INIZIO TYPE_OF_AUX " ^ CicPp.ppterm t)) ; flush stderr ;
1927 type_of_aux ~logger context t ugraph
1929 in debug_print (lazy "FINE TYPE_OF_AUX") ; flush stderr ; res
1932 (* is a small constructor? *)
1933 (*CSC: ottimizzare calcolando staticamente *)
1934 and is_small_or_non_informative ~condition ~logger context paramsno c ugraph =
1935 let rec is_small_or_non_informative_aux ~logger context c ugraph =
1936 let module C = Cic in
1937 match CicReduction.whd context c with
1939 let s,ugraph1 = type_of_aux' ~logger [] context so ugraph in
1940 let b = condition s in
1942 is_small_or_non_informative_aux
1943 ~logger ((Some (n,(C.Decl so)))::context) de ugraph1
1946 | _ -> true,ugraph (*CSC: we trust the type-checker *)
1948 let (context',dx) = split_prods ~subst:[] context paramsno c in
1949 is_small_or_non_informative_aux ~logger context' dx ugraph
1951 and is_small ~logger =
1952 is_small_or_non_informative
1953 ~condition:(fun s -> s=Cic.Sort Cic.Prop || s=Cic.Sort Cic.Set)
1956 and is_non_informative ~logger =
1957 is_small_or_non_informative
1958 ~condition:(fun s -> s=Cic.Sort Cic.Prop)
1961 and type_of ~logger t ugraph =
1963 debug_print (lazy ("INIZIO TYPE_OF_AUX' " ^ CicPp.ppterm t)) ; flush stderr ;
1966 type_of_aux' ~logger [] [] t ugraph
1968 in debug_print (lazy "FINE TYPE_OF_AUX'") ; flush stderr ; res
1972 let typecheck_obj0 ~logger uri (obj,unchecked_ugraph) =
1973 let module C = Cic in
1974 let ugraph = CicUniv.empty_ugraph in
1975 let inferred_ugraph =
1977 | C.Constant (_,Some te,ty,_,_) ->
1978 let _,ugraph = type_of ~logger ty ugraph in
1979 let ty_te,ugraph = type_of ~logger te ugraph in
1980 let b,ugraph = (CicReduction.are_convertible [] ty_te ty ugraph) in
1982 raise (TypeCheckerFailure
1984 ("the type of the body is not the one expected:\n" ^
1985 CicPp.ppterm ty_te ^ "\nvs\n" ^
1989 | C.Constant (_,None,ty,_,_) ->
1990 (* only to check that ty is well-typed *)
1991 let _,ugraph = type_of ~logger ty ugraph in
1993 | C.CurrentProof (_,conjs,te,ty,_,_) ->
1994 (* this block is broken since the metasenv should
1995 * be topologically sorted before typing metas *)
1996 ignore(assert false);
1999 (fun (metasenv,ugraph) ((_,context,ty) as conj) ->
2001 type_of_aux' ~logger metasenv context ty ugraph
2003 metasenv @ [conj],ugraph
2006 let _,ugraph = type_of_aux' ~logger conjs [] ty ugraph in
2007 let type_of_te,ugraph =
2008 type_of_aux' ~logger conjs [] te ugraph
2010 let b,ugraph = CicReduction.are_convertible [] type_of_te ty ugraph in
2012 raise (TypeCheckerFailure (lazy (sprintf
2013 "the current proof is not well typed because the type %s of the body is not convertible to the declared type %s"
2014 (CicPp.ppterm type_of_te) (CicPp.ppterm ty))))
2017 | C.Variable (_,bo,ty,_,_) ->
2018 (* only to check that ty is well-typed *)
2019 let _,ugraph = type_of ~logger ty ugraph in
2023 let ty_bo,ugraph = type_of ~logger bo ugraph in
2024 let b,ugraph = CicReduction.are_convertible [] ty_bo ty ugraph in
2026 raise (TypeCheckerFailure
2027 (lazy "the body is not the one expected"))
2031 | (C.InductiveDefinition _ as obj) ->
2032 check_mutual_inductive_defs ~logger uri obj ugraph
2034 check_and_clean_ugraph inferred_ugraph unchecked_ugraph uri obj
2038 let module C = Cic in
2039 let module R = CicReduction in
2040 let module U = UriManager in
2041 let logger = new CicLogger.logger in
2042 match CicEnvironment.is_type_checked ~trust:false CicUniv.empty_ugraph uri with
2043 | CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
2044 | CicEnvironment.UncheckedObj (uobj,unchecked_ugraph) ->
2045 (* let's typecheck the uncooked object *)
2046 logger#log (`Start_type_checking uri) ;
2047 let ugraph, ul, obj = typecheck_obj0 ~logger uri (uobj,unchecked_ugraph) in
2048 CicEnvironment.set_type_checking_info uri (obj,ugraph,ul);
2049 logger#log (`Type_checking_completed uri);
2050 match CicEnvironment.is_type_checked ~trust:false CicUniv.empty_ugraph uri with
2051 | CicEnvironment.CheckedObj (cobj,ugraph') -> cobj,ugraph'
2052 | _ -> raise CicEnvironmentError
2055 let typecheck_obj ~logger uri obj =
2056 let ugraph,univlist,obj = typecheck_obj0 ~logger uri (obj,None) in
2057 CicEnvironment.add_type_checked_obj uri (obj,ugraph,univlist)
2059 (** wrappers which instantiate fresh loggers *)
2061 let profiler = HExtlib.profile "K/CicTypeChecker.type_of_aux'"
2063 let type_of_aux' ?(subst = []) metasenv context t ugraph =
2064 let logger = new CicLogger.logger in
2065 profiler.HExtlib.profile
2066 (type_of_aux' ~logger ~subst metasenv context t) ugraph
2068 let typecheck_obj uri obj =
2069 let logger = new CicLogger.logger in
2070 typecheck_obj ~logger uri obj
2072 (* check_allowed_sort_elimination uri i s1 s2
2073 This function is used outside the kernel to determine in advance whether
2074 a MutCase will be allowed or not.
2075 [uri,i] is the type of the term to match
2076 [s1] is the sort of the term to eliminate (i.e. the head of the arity
2077 of the inductive type [uri,i])
2078 [s2] is the sort of the goal (i.e. the head of the type of the outtype
2080 let check_allowed_sort_elimination uri i s1 s2 =
2081 fst (check_allowed_sort_elimination ~subst:[] ~metasenv:[]
2082 ~logger:(new CicLogger.logger) [] uri i true
2083 (Cic.Implicit None) (* never used *) (Cic.Sort s1) (Cic.Sort s2)
2084 CicUniv.empty_ugraph)
2087 Deannotate.type_of_aux' :=
2094 | Some (_,Cic.Decl ty) ->
2095 ignore (type_of_aux' [] context ty CicUniv.empty_ugraph)
2096 | Some (_,Cic.Def (bo,ty)) ->
2097 ignore (type_of_aux' [] context ty CicUniv.empty_ugraph);
2098 ignore (type_of_aux' [] context bo CicUniv.empty_ugraph));
2101 fst (type_of_aux' [] context t CicUniv.empty_ugraph);;