2 ||M|| This file is part of HELM, an Hypertextual, Electronic
3 ||A|| Library of Mathematics, developed at the Computer Science
4 ||T|| Department, University of Bologna, Italy.
6 ||T|| HELM is free software; you can redistribute it and/or
7 ||A|| modify it under the terms of the GNU General Public License
8 \ / version 2 or (at your option) any later version.
9 \ / This software is distributed as is, NO WARRANTY.
10 V_______________________________________________________________ *)
15 module R = NCicReduction
16 module Ref = NReference
17 module S = NCicSubstitution
19 module E = NCicEnvironment
22 exception TypeCheckerFailure of string Lazy.t
23 exception AssertFailure of string Lazy.t
26 | TypeCheckerFailure s as e -> prerr_endline (Lazy.force s); raise e
31 | Evil of int (* rno *)
32 | UnfFix of bool list (* fixed arguments *)
36 let is_dangerous i l =
37 List.exists (function (j,Evil _) when j=i -> true | _ -> false) l
41 List.exists (function (j,UnfFix _) when j=i -> true | _ -> false) l
45 List.exists (function (j,Safe) when j=i -> true | _ -> false) l
49 try match List.assoc i l with Evil rno -> rno | _ -> assert false
50 with Not_found -> assert false
53 let get_fixed_args i l =
54 try match List.assoc i l with UnfFix fa -> fa | _ -> assert false
55 with Not_found -> assert false
58 let shift_k e (c,rf,x) = e::c,List.map (fun (k,v) -> k+1,v) rf,x+1;;
61 let string_of_recfuns ~subst ~metasenv ~context l =
62 let pp = PP.ppterm ~subst ~metasenv ~context in
63 let safe, rest = List.partition (function (_,Safe) -> true | _ -> false) l in
64 let dang,unf = List.partition (function (_,UnfFix _)-> false | _->true)rest in
65 "\n\tsafes: "^String.concat "," (List.map (fun (i,_)->pp (C.Rel i)) safe) ^
66 "\n\tfix : "^String.concat ","
68 (function (i,UnfFix l)-> pp(C.Rel i)^"/"^String.concat "," (List.map
70 | _ ->assert false) unf) ^
71 "\n\trec : "^String.concat ","
73 (function (i,Evil rno)->pp(C.Rel i)^"/"^string_of_int rno
74 | _ -> assert false) dang)
78 let fixed_args bos j n nn =
79 let rec aux k acc = function
80 | C.Appl (C.Rel i::args) when i-k > n && i-k <= nn ->
81 let rec combine l1 l2 =
84 | he1::tl1, he2::tl2 -> (he1,he2)::combine tl1 tl2
85 | he::tl, [] -> (false,C.Rel ~-1)::combine tl [] (* dummy term *)
86 | [],_::_ -> assert false
88 let lefts, _ = HExtlib.split_nth (min j (List.length args)) args in
89 List.map (fun ((b,x),i) -> b && x = C.Rel (k-i))
90 (HExtlib.list_mapi (fun x i -> x,i) (combine acc lefts))
91 | t -> U.fold (fun _ k -> k+1) k aux acc t
93 List.fold_left (aux 0)
94 (let rec f = function 0 -> [] | n -> true :: f (n-1) in f j) bos
97 (* if n < 0, then splits all prods from an arity, returning a sort *)
98 let rec split_prods ~subst context n te =
99 match (n, R.whd ~subst context te) with
100 | (0, _) -> context,te
101 | (n, C.Sort _) when n <= 0 -> context,te
102 | (n, C.Prod (name,so,ta)) ->
103 split_prods ~subst ((name,(C.Decl so))::context) (n - 1) ta
104 | (_, _) -> raise (AssertFailure (lazy "split_prods"))
107 let debruijn uri number_of_types context =
110 | C.Meta (i,(s,C.Ctx l)) ->
111 let l1 = HExtlib.sharing_map (aux (k-s)) l in
112 if l1 == l then t else C.Meta (i,(s,C.Ctx l1))
114 | C.Const (Ref.Ref (uri1,(Ref.Fix (no,_,_) | Ref.CoFix no)))
115 | C.Const (Ref.Ref (uri1,Ref.Ind (_,no))) when NUri.eq uri uri1 ->
116 C.Rel (k + number_of_types - no)
117 | t -> U.map (fun _ k -> k+1) k aux t
119 aux (List.length context)
122 let sort_of_prod ~metasenv ~subst context (name,s) (t1, t2) =
123 let t1 = R.whd ~subst context t1 in
124 let t2 = R.whd ~subst ((name,C.Decl s)::context) t2 in
126 | C.Sort s1, C.Sort C.Prop -> t2
127 | C.Sort (C.Type u1), C.Sort (C.Type u2) -> C.Sort (C.Type (u1@u2))
128 | C.Sort _,C.Sort (C.Type _) -> t2
129 | C.Sort (C.Type _) , C.Sort C.CProp -> t1
130 | C.Sort _, C.Sort C.CProp
131 | C.Meta (_,(_,(C.Irl 0 | C.Ctx []))), C.Sort _
132 | C.Meta (_,(_,(C.Irl 0 | C.Ctx []))), C.Meta (_,(_,(C.Irl 0 | C.Ctx [])))
133 | C.Sort _, C.Meta (_,(_,(C.Irl 0 | C.Ctx []))) -> t2
135 raise (TypeCheckerFailure (lazy (Printf.sprintf
136 "Prod: expected two sorts, found = %s, %s"
137 (PP.ppterm ~subst ~metasenv ~context t1)
138 (PP.ppterm ~subst ~metasenv ~context t2))))
141 let eat_prods ~subst ~metasenv context he ty_he args_with_ty =
142 let rec aux ty_he = function
144 | (arg, ty_arg)::tl ->
145 match R.whd ~subst context ty_he with
148 prerr_endline (PP.ppterm ~subst ~metasenv ~context s ^ " - Vs - "
149 ^ PP.ppterm ~subst ~metasenv ~context ty_arg);
150 prerr_endline (PP.ppterm ~subst ~metasenv ~context
151 (S.subst ~avoid_beta_redexes:true arg t));
153 if R.are_convertible ~subst context ty_arg s then
154 aux (S.subst ~avoid_beta_redexes:true arg t) tl
158 (lazy (Printf.sprintf
159 ("Appl: wrong application of %s: the parameter %s has type"^^
160 "\n%s\nbut it should have type \n%s\nContext:\n%s\n")
161 (PP.ppterm ~subst ~metasenv ~context he)
162 (PP.ppterm ~subst ~metasenv ~context arg)
163 (PP.ppterm ~subst ~metasenv ~context ty_arg)
164 (PP.ppterm ~subst ~metasenv ~context s)
165 (PP.ppcontext ~subst ~metasenv context))))
169 (lazy (Printf.sprintf
170 "Appl: %s is not a function, it cannot be applied"
171 (PP.ppterm ~subst ~metasenv ~context
172 (let res = List.length tl in
173 let eaten = List.length args_with_ty - res in
176 (fst (HExtlib.split_nth eaten args_with_ty)))))))))
178 aux ty_he args_with_ty
181 (* instantiate_parameters ps (x1:T1)...(xn:Tn)C *)
182 (* returns ((x_|ps|:T_|ps|)...(xn:Tn)C){ps_1 / x1 ; ... ; ps_|ps| / x_|ps|} *)
183 let rec instantiate_parameters params c =
186 | C.Prod (_,_,ta), he::tl -> instantiate_parameters tl (S.subst he ta)
187 | t,l -> raise (AssertFailure (lazy "1"))
190 let specialize_inductive_type_constrs ~subst context ty_term =
191 match R.whd ~subst context ty_term with
192 | C.Const (Ref.Ref (uri,Ref.Ind (_,i)) as ref)
193 | C.Appl (C.Const (Ref.Ref (uri,Ref.Ind (_,i)) as ref) :: _ ) as ty ->
194 let args = match ty with C.Appl (_::tl) -> tl | _ -> [] in
195 let is_ind, leftno, itl, attrs, i = E.get_checked_indtys ref in
196 let left_args,_ = HExtlib.split_nth leftno args in
197 let _,_,_,cl = List.nth itl i in
199 (fun (rel,name,ty) -> rel, name, instantiate_parameters left_args ty) cl
203 let specialize_and_abstract_constrs ~subst r_uri r_len context ty_term =
204 let cl = specialize_inductive_type_constrs ~subst context ty_term in
205 let len = List.length context in
207 match E.get_checked_obj r_uri with
208 | _,_,_,_, NCic.Inductive (_,_,tys,_) ->
209 context @ List.map (fun (_,name,arity,_) -> name,C.Decl arity) tys
213 List.map (fun (_,id,ty) -> id, debruijn r_uri r_len context ty) cl,
217 exception DoesOccur;;
219 let does_not_occur ~subst context n nn t =
220 let rec aux k _ = function
221 | C.Rel m when m > n+k && m <= nn+k -> raise DoesOccur
222 | C.Rel m when m <= k || m > nn+k -> ()
224 (try match List.nth context (m-1-k) with
225 | _,C.Def (bo,_) -> aux (n-m) () bo
227 with Failure _ -> assert false)
228 | C.Meta (_,(_,(C.Irl 0 | C.Ctx []))) -> (* closed meta *) ()
229 | C.Meta (mno,(s,l)) ->
231 (* possible optimization here: try does_not_occur on l and
232 perform substitution only if DoesOccur is raised *)
233 let _,_,term,_ = U.lookup_subst mno subst in
234 aux (k-s) () (S.subst_meta (0,l) term)
235 with U.Subst_not_found _ -> match l with
236 | C.Irl len -> if not (n+k >= s+len || s > nn+k) then raise DoesOccur
237 | C.Ctx lc -> List.iter (aux (k-s) ()) lc)
238 | t -> U.fold (fun _ k -> k + 1) k aux () t
241 with DoesOccur -> false
244 let rec eat_lambdas ~subst ~metasenv context n te =
245 match (n, R.whd ~subst context te) with
246 | (0, _) -> (te, context)
247 | (n, C.Lambda (name,so,ta)) when n > 0 ->
248 eat_lambdas ~subst ~metasenv ((name,(C.Decl so))::context) (n - 1) ta
250 raise (AssertFailure (lazy (Printf.sprintf "eat_lambdas (%d, %s)" n
251 (PP.ppterm ~subst ~metasenv ~context te))))
254 let rec eat_or_subst_lambdas ~subst ~metasenv n te to_be_subst args
255 (context, recfuns, x as k)
257 match n, R.whd ~subst context te, to_be_subst, args with
258 | (n, C.Lambda (name,so,ta),true::to_be_subst,arg::args) when n > 0 ->
259 eat_or_subst_lambdas ~subst ~metasenv (n - 1) (S.subst arg ta)
261 | (n, C.Lambda (name,so,ta),false::to_be_subst,arg::args) when n > 0 ->
262 eat_or_subst_lambdas ~subst ~metasenv (n - 1) ta to_be_subst args
263 (shift_k (name,(C.Decl so)) k)
264 | (_, te, _, _) -> te, k
268 (*CSC l'indice x dei tipi induttivi e' t.c. n < x <= nn *)
269 (*CSC questa funzione e' simile alla are_all_occurrences_positive, ma fa *)
270 (*CSC dei controlli leggermente diversi. Viene invocata solamente dalla *)
271 (*CSC strictly_positive *)
272 (*CSC definizione (giusta???) tratta dalla mail di Hugo ;-) *)
273 let rec weakly_positive ~subst context n nn uri te =
274 (*CSC: Che schifo! Bisogna capire meglio e trovare una soluzione ragionevole!*)
275 let dummy = C.Sort C.Prop in
276 (*CSC: mettere in cicSubstitution *)
277 let rec subst_inductive_type_with_dummy _ = function
278 | C.Const (Ref.Ref (uri',Ref.Ind (true,0))) when NUri.eq uri' uri -> dummy
279 | C.Appl ((C.Const (Ref.Ref (uri',Ref.Ind (true,0))))::tl)
280 when NUri.eq uri' uri -> dummy
281 | t -> U.map (fun _ x->x) () subst_inductive_type_with_dummy t
283 match R.whd context te with
284 | C.Const (Ref.Ref (uri',Ref.Ind _))
285 | C.Appl ((C.Const (Ref.Ref (uri',Ref.Ind _)))::_)
286 when NUri.eq uri' uri -> true
287 | C.Prod (name,source,dest) when
288 does_not_occur ~subst ((name,C.Decl source)::context) 0 1 dest ->
289 (* dummy abstraction, so we behave as in the anonimous case *)
290 strictly_positive ~subst context n nn
291 (subst_inductive_type_with_dummy () source) &&
292 weakly_positive ~subst ((name,C.Decl source)::context)
293 (n + 1) (nn + 1) uri dest
294 | C.Prod (name,source,dest) ->
295 does_not_occur ~subst context n nn
296 (subst_inductive_type_with_dummy () source)&&
297 weakly_positive ~subst ((name,C.Decl source)::context)
298 (n + 1) (nn + 1) uri dest
300 raise (TypeCheckerFailure (lazy "Malformed inductive constructor type"))
302 and strictly_positive ~subst context n nn te =
303 match R.whd context te with
304 | t when does_not_occur ~subst context n nn t -> true
306 | C.Prod (name,so,ta) ->
307 does_not_occur ~subst context n nn so &&
308 strictly_positive ~subst ((name,C.Decl so)::context) (n+1) (nn+1) ta
309 | C.Appl ((C.Rel m)::tl) when m > n && m <= nn ->
310 List.for_all (does_not_occur ~subst context n nn) tl
311 | C.Appl (C.Const (Ref.Ref (uri,Ref.Ind (_,i)) as r)::tl) ->
312 let _,paramsno,tyl,_,i = E.get_checked_indtys r in
313 let _,name,ity,cl = List.nth tyl i in
314 let ok = List.length tyl = 1 in
315 let params, arguments = HExtlib.split_nth paramsno tl in
316 let lifted_params = List.map (S.lift 1) params in
318 List.map (fun (_,_,te) -> instantiate_parameters lifted_params te) cl
321 List.for_all (does_not_occur ~subst context n nn) arguments &&
323 (weakly_positive ~subst ((name,C.Decl ity)::context) (n+1) (nn+1) uri) cl
326 (* the inductive type indexes are s.t. n < x <= nn *)
327 and are_all_occurrences_positive ~subst context uri indparamsno i n nn te =
328 match R.whd context te with
329 | C.Appl ((C.Rel m)::tl) as reduct when m = i ->
335 match R.whd context x with
336 | C.Rel m when m = n - (indparamsno - k) -> k - 1
337 | y -> raise (TypeCheckerFailure (lazy
338 ("Argument "^string_of_int (indparamsno - k + 1) ^ " (of " ^
339 string_of_int indparamsno ^ " fixed) is not homogeneous in "^
340 "appl:\n"^ PP.ppterm ~context ~subst ~metasenv:[] reduct))))
344 List.for_all (does_not_occur ~subst context n nn) tl
346 raise (TypeCheckerFailure
347 (lazy ("Non-positive occurence in mutual inductive definition(s) [2]"^
348 NUri.string_of_uri uri)))
349 | C.Rel m when m = i ->
350 if indparamsno = 0 then
353 raise (TypeCheckerFailure
354 (lazy ("Non-positive occurence in mutual inductive definition(s) [3]"^
355 NUri.string_of_uri uri)))
356 | C.Prod (name,source,dest) when
357 does_not_occur ~subst ((name,C.Decl source)::context) 0 1 dest ->
358 strictly_positive ~subst context n nn source &&
359 are_all_occurrences_positive ~subst
360 ((name,C.Decl source)::context) uri indparamsno
361 (i+1) (n + 1) (nn + 1) dest
362 | C.Prod (name,source,dest) ->
363 if not (does_not_occur ~subst context n nn source) then
364 raise (TypeCheckerFailure (lazy ("Non-positive occurrence in "^
365 PP.ppterm ~context ~metasenv:[] ~subst te)));
366 are_all_occurrences_positive ~subst ((name,C.Decl source)::context)
367 uri indparamsno (i+1) (n + 1) (nn + 1) dest
369 prerr_endline ("MM: " ^ NCicPp.ppterm ~subst ~metasenv:[] ~context te);
371 (TypeCheckerFailure (lazy ("Malformed inductive constructor type " ^
372 (NUri.string_of_uri uri))))
375 exception NotGuarded of string Lazy.t;;
377 let rec typeof ~subst ~metasenv context term =
378 let rec typeof_aux context =
379 fun t -> (*prerr_endline (PP.ppterm ~metasenv ~subst ~context t);*)
383 match List.nth context (n - 1) with
384 | (_,C.Decl ty) -> S.lift n ty
385 | (_,C.Def (_,ty)) -> S.lift n ty
386 with Failure _ -> raise (TypeCheckerFailure (lazy "unbound variable")))
387 | C.Sort (C.Type [false,u]) -> C.Sort (C.Type [true, u])
388 | C.Sort (C.Type _) ->
389 raise (AssertFailure (lazy ("Cannot type an inferred type: "^
390 NCicPp.ppterm ~subst ~metasenv ~context t)))
391 | C.Sort _ -> C.Sort (C.Type NCicEnvironment.type0)
392 | C.Implicit _ -> raise (AssertFailure (lazy "Implicit found"))
393 | C.Meta (n,l) as t ->
394 let canonical_ctx,ty =
396 let _,c,_,ty = U.lookup_subst n subst in c,ty
397 with U.Subst_not_found _ -> try
398 let _,c,ty = U.lookup_meta n metasenv in c,ty
399 with U.Meta_not_found _ ->
400 raise (AssertFailure (lazy (Printf.sprintf
401 "%s not found" (PP.ppterm ~subst ~metasenv ~context t))))
403 check_metasenv_consistency t ~subst ~metasenv context canonical_ctx l;
405 | C.Const ref -> type_of_constant ref
406 | C.Prod (name,s,t) ->
407 let sort1 = typeof_aux context s in
408 let sort2 = typeof_aux ((name,(C.Decl s))::context) t in
409 sort_of_prod ~metasenv ~subst context (name,s) (sort1,sort2)
410 | C.Lambda (n,s,t) ->
411 let sort = typeof_aux context s in
412 (match R.whd ~subst context sort with
413 | C.Meta _ | C.Sort _ -> ()
416 (TypeCheckerFailure (lazy (Printf.sprintf
417 ("Not well-typed lambda-abstraction: " ^^
418 "the source %s should be a type; instead it is a term " ^^
419 "of type %s") (PP.ppterm ~subst ~metasenv ~context s)
420 (PP.ppterm ~subst ~metasenv ~context sort)))));
421 let ty = typeof_aux ((n,(C.Decl s))::context) t in
423 | C.LetIn (n,ty,t,bo) ->
424 let ty_t = typeof_aux context t in
425 let _ = typeof_aux context ty in
426 if not (R.are_convertible ~subst context ty_t ty) then
429 (lazy (Printf.sprintf
430 "The type of %s is %s but it is expected to be %s"
431 (PP.ppterm ~subst ~metasenv ~context t)
432 (PP.ppterm ~subst ~metasenv ~context ty_t)
433 (PP.ppterm ~subst ~metasenv ~context ty))))
435 let ty_bo = typeof_aux ((n,C.Def (t,ty))::context) bo in
436 S.subst ~avoid_beta_redexes:true t ty_bo
437 | C.Appl (he::(_::_ as args)) ->
438 let ty_he = typeof_aux context he in
439 let args_with_ty = List.map (fun t -> t, typeof_aux context t) args in
441 prerr_endline ("HEAD: " ^ PP.ppterm ~subst ~metasenv ~context ty_he);
442 prerr_endline ("TARGS: " ^ String.concat " | " (List.map (PP.ppterm
443 ~subst ~metasenv ~context) (List.map snd args_with_ty)));
444 prerr_endline ("ARGS: " ^ String.concat " | " (List.map (PP.ppterm
445 ~subst ~metasenv ~context) (List.map fst args_with_ty)));
447 eat_prods ~subst ~metasenv context he ty_he args_with_ty
448 | C.Appl _ -> raise (AssertFailure (lazy "Appl of length < 2"))
449 | C.Match (Ref.Ref (_,Ref.Ind (_,tyno)) as r,outtype,term,pl) ->
450 let outsort = typeof_aux context outtype in
451 let inductive,leftno,itl,_,_ = E.get_checked_indtys r in
453 let _,_,_,cl = List.nth itl tyno in List.length cl
455 let parameters, arguments =
456 let ty = R.whd ~subst context (typeof_aux context term) in
459 C.Const (Ref.Ref (_,Ref.Ind _) as r') -> r',[]
460 | C.Appl (C.Const (Ref.Ref (_,Ref.Ind _) as r') :: tl) -> r',tl
463 (TypeCheckerFailure (lazy (Printf.sprintf
464 "Case analysis: analysed term %s is not an inductive one"
465 (PP.ppterm ~subst ~metasenv ~context term)))) in
466 if not (Ref.eq r r') then
468 (TypeCheckerFailure (lazy (Printf.sprintf
469 ("Case analysys: analysed term type is %s, but is expected " ^^
470 "to be (an application of) %s")
471 (PP.ppterm ~subst ~metasenv ~context ty)
472 (PP.ppterm ~subst ~metasenv ~context (C.Const r')))))
474 try HExtlib.split_nth leftno tl
477 raise (TypeCheckerFailure (lazy (Printf.sprintf
478 "%s is partially applied"
479 (PP.ppterm ~subst ~metasenv ~context ty)))) in
480 (* let's control if the sort elimination is allowed: [(I q1 ... qr)|B] *)
481 let sort_of_ind_type =
482 if parameters = [] then C.Const r
483 else C.Appl ((C.Const r)::parameters) in
484 let type_of_sort_of_ind_ty = typeof_aux context sort_of_ind_type in
485 check_allowed_sort_elimination ~subst ~metasenv r context
486 sort_of_ind_type type_of_sort_of_ind_ty outsort;
487 (* let's check if the type of branches are right *)
488 if List.length pl <> constructorsno then
489 raise (TypeCheckerFailure (lazy ("Wrong number of cases in a match")));
490 let j,branches_ok,p_ty, exp_p_ty =
492 (fun (j,b,old_p_ty,old_exp_p_ty) p ->
495 let cons = Ref.mk_constructor j r in
496 if parameters = [] then C.Const cons
497 else C.Appl (C.Const cons::parameters)
499 let ty_p = typeof_aux context p in
500 let ty_cons = typeof_aux context cons in
502 type_of_branch ~subst context leftno outtype cons ty_cons 0
504 j+1, R.are_convertible ~subst context ty_p ty_branch,
507 j,false,old_p_ty,old_exp_p_ty
508 ) (1,true,C.Sort C.Prop,C.Sort C.Prop) pl
510 if not branches_ok then
513 (lazy (Printf.sprintf ("Branch for constructor %s :=\n%s\n"^^
514 "has type %s\nnot convertible with %s")
515 (PP.ppterm ~subst ~metasenv ~context
516 (C.Const (Ref.mk_constructor (j-1) r)))
517 (PP.ppterm ~metasenv ~subst ~context (List.nth pl (j-2)))
518 (PP.ppterm ~metasenv ~subst ~context p_ty)
519 (PP.ppterm ~metasenv ~subst ~context exp_p_ty))));
520 let res = outtype::arguments@[term] in
521 R.head_beta_reduce (C.Appl res)
522 | C.Match _ -> assert false
524 and type_of_branch ~subst context leftno outty cons tycons liftno =
525 match R.whd ~subst context tycons with
526 | C.Const (Ref.Ref (_,Ref.Ind _)) -> C.Appl [S.lift liftno outty ; cons]
527 | C.Appl (C.Const (Ref.Ref (_,Ref.Ind _))::tl) ->
528 let _,arguments = HExtlib.split_nth leftno tl in
529 C.Appl (S.lift liftno outty::arguments@[cons])
530 | C.Prod (name,so,de) ->
532 match S.lift 1 cons with
533 | C.Appl l -> C.Appl (l@[C.Rel 1])
534 | t -> C.Appl [t ; C.Rel 1]
537 type_of_branch ~subst ((name,(C.Decl so))::context)
538 leftno outty cons de (liftno+1))
539 | _ -> raise (AssertFailure (lazy "type_of_branch"))
541 (* check_metasenv_consistency checks that the "canonical" context of a
542 metavariable is consitent - up to relocation via the relocation list l -
543 with the actual context *)
544 and check_metasenv_consistency
545 ~subst ~metasenv term context canonical_context l
549 let context = snd (HExtlib.split_nth shift context) in
550 let rec compare = function
554 raise (AssertFailure (lazy (Printf.sprintf
555 "Local and canonical context %s have different lengths"
556 (PP.ppterm ~subst ~context ~metasenv term))))
558 raise (TypeCheckerFailure (lazy (Printf.sprintf
559 "Unbound variable -%d in %s" m
560 (PP.ppterm ~subst ~metasenv ~context term))))
563 (_,C.Decl t1), (_,C.Decl t2)
564 | (_,C.Def (t1,_)), (_,C.Def (t2,_))
565 | (_,C.Def (_,t1)), (_,C.Decl t2) ->
566 if not (R.are_convertible ~subst tl t1 t2) then
569 (lazy (Printf.sprintf
570 ("Not well typed metavariable local context for %s: " ^^
571 "%s expected, which is not convertible with %s")
572 (PP.ppterm ~subst ~metasenv ~context term)
573 (PP.ppterm ~subst ~metasenv ~context t2)
574 (PP.ppterm ~subst ~metasenv ~context t1))))
577 (TypeCheckerFailure (lazy (Printf.sprintf
578 ("Not well typed metavariable local context for %s: " ^^
579 "a definition expected, but a declaration found")
580 (PP.ppterm ~subst ~metasenv ~context term)))));
581 compare (m - 1,tl,ctl)
583 compare (n,context,canonical_context)
585 (* we avoid useless lifting by shortening the context*)
586 let l,context = (0,lc_kind), snd (HExtlib.split_nth shift context) in
587 let lifted_canonical_context =
588 let rec lift_metas i = function
590 | (n,C.Decl t)::tl ->
591 (n,C.Decl (S.subst_meta l (S.lift i t)))::(lift_metas (i+1) tl)
592 | (n,C.Def (t,ty))::tl ->
593 (n,C.Def ((S.subst_meta l (S.lift i t)),
594 S.subst_meta l (S.lift i ty)))::(lift_metas (i+1) tl)
596 lift_metas 1 canonical_context in
597 let l = U.expand_local_context lc_kind in
602 | t, (_,C.Def (ct,_)) ->
603 (*CSC: the following optimization is to avoid a possibly expensive
604 reduction that can be easily avoided and that is quite
605 frequent. However, this is better handled using levels to
611 match List.nth context (n - 1) with
612 | (_,C.Def (te,_)) -> S.lift n te
617 if not (R.are_convertible ~subst context optimized_t ct)
621 (lazy (Printf.sprintf
622 ("Not well typed metavariable local context: " ^^
623 "expected a term convertible with %s, found %s")
624 (PP.ppterm ~subst ~metasenv ~context ct)
625 (PP.ppterm ~subst ~metasenv ~context t))))
626 | t, (_,C.Decl ct) ->
627 let type_t = typeof_aux context t in
628 if not (R.are_convertible ~subst context type_t ct) then
629 raise (TypeCheckerFailure
630 (lazy (Printf.sprintf
631 ("Not well typed metavariable local context: "^^
632 "expected a term of type %s, found %s of type %s")
633 (PP.ppterm ~subst ~metasenv ~context ct)
634 (PP.ppterm ~subst ~metasenv ~context t)
635 (PP.ppterm ~subst ~metasenv ~context type_t))))
636 ) l lifted_canonical_context
638 Invalid_argument _ ->
639 raise (AssertFailure (lazy (Printf.sprintf
640 "Local and canonical context %s have different lengths"
641 (PP.ppterm ~subst ~metasenv ~context term))))
643 and is_non_informative context paramsno c =
644 let rec aux context c =
645 match R.whd context c with
646 | C.Prod (n,so,de) ->
647 let s = typeof_aux context so in
648 s = C.Sort C.Prop && aux ((n,(C.Decl so))::context) de
650 let context',dx = split_prods ~subst:[] context paramsno c in
653 and check_allowed_sort_elimination ~subst ~metasenv r =
656 | C.Appl l -> C.Appl (l @ [arg])
657 | t -> C.Appl [t;arg] in
658 let rec aux context ind arity1 arity2 =
659 let arity1 = R.whd ~subst context arity1 in
660 let arity2 = R.whd ~subst context arity2 in
661 match arity1,arity2 with
662 | C.Prod (name,so1,de1), C.Prod (_,so2,de2) ->
663 if not (R.are_convertible ~subst context so1 so2) then
664 raise (TypeCheckerFailure (lazy (Printf.sprintf
665 "In outtype: expected %s, found %s"
666 (PP.ppterm ~subst ~metasenv ~context so1)
667 (PP.ppterm ~subst ~metasenv ~context so2)
669 aux ((name, C.Decl so1)::context)
670 (mkapp (S.lift 1 ind) (C.Rel 1)) de1 de2
671 | C.Sort _, C.Prod (name,so,ta) ->
672 if not (R.are_convertible ~subst context so ind) then
673 raise (TypeCheckerFailure (lazy (Printf.sprintf
674 "In outtype: expected %s, found %s"
675 (PP.ppterm ~subst ~metasenv ~context ind)
676 (PP.ppterm ~subst ~metasenv ~context so)
678 (match arity1, R.whd ~subst ((name,C.Decl so)::context) ta with
679 | (C.Sort (C.CProp | C.Type _), C.Sort _)
680 | (C.Sort C.Prop, C.Sort C.Prop) -> ()
681 | (C.Sort C.Prop, C.Sort (C.CProp | C.Type _)) ->
682 (* TODO: we should pass all these parameters since we
683 * have them already *)
684 let inductive,leftno,itl,_,i = E.get_checked_indtys r in
685 let itl_len = List.length itl in
686 let _,name,ty,cl = List.nth itl i in
687 let cl_len = List.length cl in
688 (* is it a singleton or empty non recursive and non informative
692 (itl_len = 1 && cl_len = 1 &&
693 is_non_informative [name,C.Decl ty] leftno
694 (let _,_,x = List.nth cl 0 in x)))
696 raise (TypeCheckerFailure (lazy
697 ("Sort elimination not allowed")));
704 typeof_aux context term
706 and check_mutual_inductive_defs uri ~metasenv ~subst is_ind leftno tyl =
707 (* let's check if the arity of the inductive types are well formed *)
708 List.iter (fun (_,_,x,_) -> ignore (typeof ~subst ~metasenv [] x)) tyl;
709 (* let's check if the types of the inductive constructors are well formed. *)
710 let len = List.length tyl in
711 let tys = List.rev_map (fun (_,n,ty,_) -> (n,(C.Decl ty))) tyl in
714 (fun (_,_,ty,cl) i ->
715 let sx_context_ty,ty_sort = split_prods ~subst [] ~-1 ty in
718 let te = debruijn uri len [] te in
719 let context,te = split_prods ~subst tys leftno te in
720 let sx_context_te,_ = HExtlib.split_nth leftno context in
722 ignore (List.fold_right2
723 (fun item1 item2 context ->
725 match item1,item2 with
726 (n1,C.Decl ty1),(n2,C.Decl ty2) ->
727 n1 = n2 && R.are_convertible ~subst context ty1 ty2
728 | (n1,C.Def (bo1,ty1)),(n2,C.Def (bo2,ty2)) ->
730 && R.are_convertible ~subst context ty1 ty2
731 && R.are_convertible ~subst context bo1 bo2
734 if not convertible then
735 raise (TypeCheckerFailure (lazy
736 ("Mismatch between the left parameters of the constructor " ^
737 "and those of its inductive type")))
740 ) sx_context_ty sx_context_te [])
741 with Invalid_argument _ -> assert false);
742 let con_sort = typeof ~subst ~metasenv context te in
743 (match R.whd ~subst context con_sort, R.whd ~subst [] ty_sort with
744 (C.Sort (C.Type u1) as s1), (C.Sort (C.Type u2) as s2) ->
745 if not (E.universe_leq u1 u2) then
748 (lazy ("The type " ^ PP.ppterm ~metasenv ~subst ~context s1^
749 " of the constructor is not included in the inductive" ^
750 " type sort " ^ PP.ppterm ~metasenv ~subst ~context s2)))
751 | C.Sort _, C.Sort C.Prop
752 | C.Sort C.CProp, C.Sort C.CProp
753 | C.Sort _, C.Sort C.Type _ -> ()
757 (lazy ("Wrong constructor or inductive arity shape"))));
758 (* let's check also the positivity conditions *)
761 (are_all_occurrences_positive ~subst context uri leftno
762 (i+leftno) leftno (len+leftno) te)
766 (lazy ("Non positive occurence in "^NUri.string_of_uri uri))))
771 and guarded_by_destructors r_uri r_len ~subst ~metasenv context recfuns t =
772 let recursor f k t = U.fold shift_k k (fun k () -> f k) () t in
773 let rec aux (context, recfuns, x as k) t =
775 prerr_endline ("GB:\n" ^
776 PP.ppcontext ~subst ~metasenv context^
777 PP.ppterm ~metasenv ~subst ~context t^
778 string_of_recfuns ~subst ~metasenv ~context recfuns);
782 | C.Rel m as t when is_dangerous m recfuns ->
783 raise (NotGuarded (lazy
784 (PP.ppterm ~subst ~metasenv ~context t ^
785 " is a partial application of a fix")))
786 | C.Appl ((C.Rel m)::tl) as t when is_dangerous m recfuns ->
787 let rec_no = get_recno m recfuns in
788 if not (List.length tl > rec_no) then
789 raise (NotGuarded (lazy
790 (PP.ppterm ~context ~subst ~metasenv t ^
791 " is a partial application of a fix")))
793 let rec_arg = List.nth tl rec_no in
794 if not (is_really_smaller r_uri r_len ~subst ~metasenv k rec_arg) then
795 raise (NotGuarded (lazy (Printf.sprintf ("Recursive call %s, %s is not"
796 ^^ " smaller.\ncontext:\n%s") (PP.ppterm ~context ~subst ~metasenv
797 t) (PP.ppterm ~context ~subst ~metasenv rec_arg)
798 (PP.ppcontext ~subst ~metasenv context))));
800 | C.Appl ((C.Rel m)::tl) when is_unfolded m recfuns ->
801 let fixed_args = get_fixed_args m recfuns in
802 HExtlib.list_iter_default2
803 (fun x b -> if not b then aux k x) tl false fixed_args
805 (match List.nth context (m-1) with
807 | _,C.Def (bo,_) -> aux k (S.lift m bo))
809 | C.Appl (C.Const ((Ref.Ref (uri,Ref.Fix (i,recno,_))) as r)::args) ->
810 if List.exists (fun t -> try aux k t;false with NotGuarded _ -> true) args
812 let fl,_,_ = E.get_checked_fixes_or_cofixes r in
814 List.split (List.map (fun (_,name,_,ty,bo) -> (name, C.Decl ty), bo) fl)
816 let fl_len = List.length fl in
817 let bos = List.map (debruijn uri fl_len context) bos in
818 let j = List.fold_left min max_int (List.map (fun (_,_,i,_,_)->i) fl) in
819 let ctx_len = List.length context in
820 (* we may look for fixed params not only up to j ... *)
821 let fa = fixed_args bos j ctx_len (ctx_len + fl_len) in
822 HExtlib.list_iter_default2
823 (fun x b -> if not b then aux k x) args false fa;
824 let context = context@ctx_tys in
825 let ctx_len = List.length context in
827 HExtlib.list_mapi (fun _ i -> ctx_len - i, UnfFix fa) ctx_tys
829 let new_k = context, extra_recfuns@recfuns, x in
834 eat_or_subst_lambdas ~subst ~metasenv j bo fa args new_k
838 List.length args > recno &&
839 (*case where the recursive argument is already really_smaller *)
840 is_really_smaller r_uri r_len ~subst ~metasenv k
841 (List.nth args recno)
843 let bo,(context, _, _ as new_k) = bo_and_k in
845 eat_lambdas ~subst ~metasenv context (recno + 1 - j) bo in
846 let new_context_part,_ =
847 HExtlib.split_nth (List.length context' - List.length context)
849 let k = List.fold_right shift_k new_context_part new_k in
850 let context, recfuns, x = k in
851 let k = context, (1,Safe)::recfuns, x in
857 List.iter (fun (bo,k) -> aux k bo) bos_and_ks
858 | C.Match (Ref.Ref (uri,Ref.Ind (true,_)),outtype,term,pl) as t ->
859 (match R.whd ~subst context term with
860 | C.Rel m | C.Appl (C.Rel m :: _ ) as t when is_safe m recfuns || m = x ->
861 let ty = typeof ~subst ~metasenv context term in
862 let dc_ctx, dcl, start, stop =
863 specialize_and_abstract_constrs ~subst r_uri r_len context ty in
864 let args = match t with C.Appl (_::tl) -> tl | _ -> [] in
866 List.iter (aux k) args;
869 let rl = recursive_args ~subst ~metasenv dc_ctx start stop dc in
870 let p, k = get_new_safes ~subst k p rl in
873 | _ -> recursor aux k t)
874 | t -> recursor aux k t
876 NotGuarded _ as exc ->
877 let t' = R.whd ~delta:0 ~subst context t in
878 if t = t' then raise exc
881 try aux (context, recfuns, 1) t
882 with NotGuarded s -> raise (TypeCheckerFailure s)
884 and guarded_by_constructors ~subst ~metasenv context t indURI indlen nn =
885 let rec aux context n nn h te =
886 match R.whd ~subst context te with
887 | C.Rel m when m > n && m <= nn -> h
888 | C.Rel _ | C.Meta _ -> true
892 | C.Const (Ref.Ref (_,Ref.Ind _))
893 | C.LetIn _ -> raise (AssertFailure (lazy "17"))
894 | C.Lambda (name,so,de) ->
895 does_not_occur ~subst context n nn so &&
896 aux ((name,C.Decl so)::context) (n + 1) (nn + 1) h de
897 | C.Appl ((C.Rel m)::tl) when m > n && m <= nn ->
898 h && List.for_all (does_not_occur ~subst context n nn) tl
899 | C.Const (Ref.Ref (_,Ref.Con _)) -> true
900 | C.Appl (C.Const (Ref.Ref (uri, Ref.Con (_,j)) as ref) :: tl) as t ->
901 let _, paramsno, _, _, _ = E.get_checked_indtys ref in
902 let ty_t = typeof ~subst ~metasenv context t in
903 let dc_ctx, dcl, start, stop =
904 specialize_and_abstract_constrs ~subst indURI indlen context ty_t in
905 let _, dc = List.nth dcl (j-1) in
907 prerr_endline (PP.ppterm ~subst ~metasenv ~context:dc_ctx dc);
908 prerr_endline (PP.ppcontext ~subst ~metasenv dc_ctx);
910 let rec_params = recursive_args ~subst ~metasenv dc_ctx start stop dc in
911 let rec analyse_instantiated_type rec_spec args =
912 match rec_spec, args with
913 | h::rec_spec, he::args ->
914 aux context n nn h he && analyse_instantiated_type rec_spec args
916 | _ -> raise (AssertFailure (lazy
917 ("Too many args for constructor: " ^ String.concat " "
918 (List.map (fun x-> PP.ppterm ~subst ~metasenv ~context x) args))))
920 let left, args = HExtlib.split_nth paramsno tl in
921 List.for_all (does_not_occur ~subst context n nn) left &&
922 analyse_instantiated_type rec_params args
923 | C.Appl ((C.Match (_,out,te,pl))::_)
924 | C.Match (_,out,te,pl) as t ->
925 let tl = match t with C.Appl (_::tl) -> tl | _ -> [] in
926 List.for_all (does_not_occur ~subst context n nn) tl &&
927 does_not_occur ~subst context n nn out &&
928 does_not_occur ~subst context n nn te &&
929 List.for_all (aux context n nn h) pl
930 | C.Const (Ref.Ref (u,(Ref.Fix _| Ref.CoFix _)) as ref)
931 | C.Appl(C.Const (Ref.Ref(u,(Ref.Fix _| Ref.CoFix _)) as ref) :: _) as t ->
932 let tl = match t with C.Appl (_::tl) -> tl | _ -> [] in
933 let fl,_,_ = E.get_checked_fixes_or_cofixes ref in
934 let len = List.length fl in
935 let tys = List.map (fun (_,n,_,ty,_) -> n, C.Decl ty) fl in
936 List.for_all (does_not_occur ~subst context n nn) tl &&
939 aux (context@tys) n nn h (debruijn u len context bo))
942 | C.Appl _ as t -> does_not_occur ~subst context n nn t
944 aux context 0 nn false t
946 and recursive_args ~subst ~metasenv context n nn te =
947 match R.whd context te with
948 | C.Rel _ | C.Appl _ | C.Const _ -> []
949 | C.Prod (name,so,de) ->
950 (not (does_not_occur ~subst context n nn so)) ::
951 (recursive_args ~subst ~metasenv
952 ((name,(C.Decl so))::context) (n+1) (nn + 1) de)
954 raise (AssertFailure (lazy ("recursive_args:" ^ PP.ppterm ~subst
955 ~metasenv ~context:[] t)))
957 and get_new_safes ~subst (context, recfuns, x as k) p rl =
958 match R.whd ~subst context p, rl with
959 | C.Lambda (name,so,ta), b::tl ->
960 let recfuns = (if b then [0,Safe] else []) @ recfuns in
962 (shift_k (name,(C.Decl so)) (context, recfuns, x)) ta tl
963 | C.Meta _ as e, _ | e, [] -> e, k
964 | _ -> raise (AssertFailure (lazy "Ill formed pattern"))
966 and is_really_smaller
967 r_uri r_len ~subst ~metasenv (context, recfuns, x as k) te
969 match R.whd ~subst context te with
970 | C.Rel m when is_safe m recfuns -> true
971 | C.Lambda (name, s, t) ->
972 is_really_smaller r_uri r_len ~subst ~metasenv (shift_k (name,C.Decl s) k) t
974 is_really_smaller r_uri r_len ~subst ~metasenv k he
976 | C.Const (Ref.Ref (_,Ref.Con _)) -> false
978 | C.Const (Ref.Ref (_,Ref.Fix _)) -> assert false
980 | C.Match (Ref.Ref (uri,Ref.Ind (isinductive,_)),outtype,term,pl) ->
982 | C.Rel m | C.Appl (C.Rel m :: _ ) when is_safe m recfuns || m = x ->
983 if not isinductive then
984 List.for_all (is_really_smaller r_uri r_len ~subst ~metasenv k) pl
986 let ty = typeof ~subst ~metasenv context term in
987 let dc_ctx, dcl, start, stop =
988 specialize_and_abstract_constrs ~subst r_uri r_len context ty in
991 let rl = recursive_args ~subst ~metasenv dc_ctx start stop dc in
992 let e, k = get_new_safes ~subst k p rl in
993 is_really_smaller r_uri r_len ~subst ~metasenv k e)
995 | _ -> List.for_all (is_really_smaller r_uri r_len ~subst ~metasenv k) pl)
998 and returns_a_coinductive ~subst context ty =
999 match R.whd ~subst context ty with
1000 | C.Const (Ref.Ref (uri,Ref.Ind (false,_)) as ref)
1001 | C.Appl (C.Const (Ref.Ref (uri,Ref.Ind (false,_)) as ref)::_) ->
1002 let _, _, itl, _, _ = E.get_checked_indtys ref in
1003 Some (uri,List.length itl)
1004 | C.Prod (n,so,de) ->
1005 returns_a_coinductive ~subst ((n,C.Decl so)::context) de
1008 and type_of_constant ((Ref.Ref (uri,_)) as ref) =
1009 match E.get_checked_obj uri, ref with
1010 | (_,_,_,_,C.Inductive (_,_,tl,_)), Ref.Ref (_,Ref.Ind (_,i)) ->
1011 let _,_,arity,_ = List.nth tl i in arity
1012 | (_,_,_,_,C.Inductive (_,_,tl,_)), Ref.Ref (_,Ref.Con (i,j)) ->
1013 let _,_,_,cl = List.nth tl i in
1014 let _,_,arity = List.nth cl (j-1) in
1016 | (_,_,_,_,C.Fixpoint (_,fl,_)), Ref.Ref (_,(Ref.Fix (i,_,_)|Ref.CoFix i)) ->
1017 let _,_,_,arity,_ = List.nth fl i in
1019 | (_,_,_,_,C.Constant (_,_,_,ty,_)), Ref.Ref (_,(Ref.Def _|Ref.Decl)) -> ty
1020 | _ -> raise (AssertFailure (lazy "type_of_constant: environment/reference"))
1023 let typecheck_context ~metasenv ~subst context =
1029 _,C.Decl t -> ignore (typeof ~metasenv ~subst:[] context t)
1030 | name,C.Def (te,ty) ->
1031 ignore (typeof ~metasenv ~subst:[] context ty);
1032 let ty' = typeof ~metasenv ~subst:[] context te in
1033 if not (R.are_convertible ~subst context ty' ty) then
1034 raise (AssertFailure (lazy (Printf.sprintf (
1035 "the type of the definiens for %s in the context is not "^^
1036 "convertible with the declared one.\n"^^
1037 "inferred type:\n%s\nexpected type:\n%s")
1039 (PP.ppterm ~subst ~metasenv ~context ty')
1040 (PP.ppterm ~subst ~metasenv ~context ty))))
1046 let typecheck_metasenv metasenv =
1049 (fun metasenv (i,(_,context,ty) as conj) ->
1050 if List.mem_assoc i metasenv then
1051 raise (TypeCheckerFailure (lazy ("duplicate meta " ^ string_of_int i ^
1053 typecheck_context ~metasenv ~subst:[] context;
1054 ignore (typeof ~metasenv ~subst:[] context ty);
1059 let typecheck_subst ~metasenv subst =
1062 (fun subst (i,(_,context,ty,bo) as conj) ->
1063 if List.mem_assoc i subst then
1064 raise (AssertFailure (lazy ("duplicate meta " ^ string_of_int i ^
1065 " in substitution")));
1066 if List.mem_assoc i metasenv then
1067 raise (AssertFailure (lazy ("meta " ^ string_of_int i ^
1068 " is both in the metasenv and in the substitution")));
1069 typecheck_context ~metasenv ~subst context;
1070 ignore (typeof ~metasenv ~subst context ty);
1071 let ty' = typeof ~metasenv ~subst context bo in
1072 if not (R.are_convertible ~subst context ty' ty) then
1073 raise (AssertFailure (lazy (Printf.sprintf (
1074 "the type of the definiens for %d in the substitution is not "^^
1075 "convertible with the declared one.\n"^^
1076 "inferred type:\n%s\nexpected type:\n%s")
1078 (PP.ppterm ~subst ~metasenv ~context ty')
1079 (PP.ppterm ~subst ~metasenv ~context ty))));
1084 let typecheck_obj (uri,height,metasenv,subst,kind) =
1085 typecheck_metasenv metasenv;
1086 typecheck_subst ~metasenv subst;
1088 | C.Constant (_,_,Some te,ty,_) ->
1089 let _ = typeof ~subst ~metasenv [] ty in
1090 let ty_te = typeof ~subst ~metasenv [] te in
1091 if not (R.are_convertible ~subst [] ty_te ty) then
1092 raise (TypeCheckerFailure (lazy (Printf.sprintf (
1093 "the type of the body is not convertible with the declared one.\n"^^
1094 "inferred type:\n%s\nexpected type:\n%s")
1095 (PP.ppterm ~subst ~metasenv ~context:[] ty_te)
1096 (PP.ppterm ~subst ~metasenv ~context:[] ty))))
1097 | C.Constant (_,_,None,ty,_) -> ignore (typeof ~subst ~metasenv [] ty)
1098 | C.Inductive (is_ind, leftno, tyl, _) ->
1099 check_mutual_inductive_defs uri ~metasenv ~subst is_ind leftno tyl
1100 | C.Fixpoint (inductive,fl,_) ->
1103 (fun (types,kl) (_,name,k,ty,_) ->
1104 let _ = typeof ~subst ~metasenv [] ty in
1105 ((name,C.Decl ty)::types, k::kl)
1108 let len = List.length types in
1110 List.split (List.map2
1111 (fun (_,_,_,_,bo) rno ->
1112 let dbo = debruijn uri len [] bo in
1116 List.iter2 (fun (_,name,x,ty,_) bo ->
1117 let ty_bo = typeof ~subst ~metasenv types bo in
1118 if not (R.are_convertible ~subst types ty_bo ty)
1119 then raise (TypeCheckerFailure (lazy ("(Co)Fix: ill-typed bodies")))
1121 if inductive then begin
1122 let m, context = eat_lambdas ~subst ~metasenv types (x + 1) bo in
1125 match List.hd context with _,C.Decl t -> t | _ -> assert false
1127 match R.whd ~subst (List.tl context) he with
1128 | C.Const (Ref.Ref (uri,Ref.Ind _) as ref)
1129 | C.Appl (C.Const (Ref.Ref (uri,Ref.Ind _) as ref) :: _) ->
1130 let _,_,itl,_,_ = E.get_checked_indtys ref in
1131 uri, List.length itl
1134 (* guarded by destructors conditions D{f,k,x,M} *)
1135 let rec enum_from k =
1136 function [] -> [] | v::tl -> (k,v)::enum_from (k+1) tl
1138 guarded_by_destructors r_uri r_len
1139 ~subst ~metasenv context (enum_from (x+2) kl) m
1141 match returns_a_coinductive ~subst [] ty with
1143 raise (TypeCheckerFailure
1144 (lazy "CoFix: does not return a coinductive type"))
1145 | Some (r_uri, r_len) ->
1146 (* guarded by constructors conditions C{f,M} *)
1148 (guarded_by_constructors ~subst ~metasenv types bo r_uri r_len len)
1150 raise (TypeCheckerFailure
1151 (lazy "CoFix: not guarded by constructors"))
1157 let trust = ref (fun _ -> false);;
1158 let set_trust f = trust := f
1159 let trust_obj obj = !trust obj
1162 (* web interface stuff *)
1165 ref (function (`Start_type_checking _|`Type_checking_completed _|`Type_checking_interrupted _|`Type_checking_failed _|`Trust_obj _) -> ())
1168 let set_logger f = logger := f;;
1170 let typecheck_obj obj =
1171 let u,_,_,_,_ = obj in
1173 !logger (`Start_type_checking u);
1175 !logger (`Type_checking_completed u)
1178 !logger (`Type_checking_interrupted u);
1181 !logger (`Type_checking_failed u);
1187 if trust_obj obj then
1188 let u,_,_,_,_ = obj in
1189 !logger (`Trust_obj u)