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 Ref = NReference
16 module R = NCicReduction
17 module S = NCicSubstitution
19 module E = NCicEnvironment
22 exception TypeCheckerFailure of string Lazy.t
23 exception AssertFailure of string Lazy.t
27 | TypeCheckerFailure s as e -> prerr_endline (Lazy.force s); raise e
33 | Evil of int (* rno *)
34 | UnfFix of bool list (* fixed arguments *)
38 let is_dangerous i l =
39 List.exists (function (j,Evil _) when j=i -> true | _ -> false) l
43 List.exists (function (j,UnfFix _) when j=i -> true | _ -> false) l
47 List.exists (function (j,Safe) when j=i -> true | _ -> false) l
51 try match List.assoc i l with Evil rno -> rno | _ -> assert false
52 with Not_found -> assert false
55 let get_fixed_args i l =
56 try match List.assoc i l with UnfFix fa -> fa | _ -> assert false
57 with Not_found -> assert false
60 let shift_k e (c,rf,x) = e::c,List.map (fun (k,v) -> k+1,v) rf,x+1;;
63 let string_of_recfuns ~subst ~metasenv ~context l =
64 let pp = PP.ppterm ~subst ~metasenv ~context in
65 let safe, rest = List.partition (function (_,Safe) -> true | _ -> false) l in
66 let dang,unf = List.partition (function (_,UnfFix _)-> false | _->true)rest in
67 "\n\tsafes: "^String.concat "," (List.map (fun (i,_)->pp (C.Rel i)) safe) ^
68 "\n\tfix : "^String.concat ","
70 (function (i,UnfFix l)-> pp(C.Rel i)^"/"^String.concat "," (List.map
72 | _ ->assert false) unf) ^
73 "\n\trec : "^String.concat ","
75 (function (i,Evil rno)->pp(C.Rel i)^"/"^string_of_int rno
76 | _ -> assert false) dang)
80 let fixed_args bos j n nn =
81 let rec aux k acc = function
82 | C.Appl (C.Rel i::args) when i-k > n && i-k <= nn ->
83 let rec combine l1 l2 =
86 | he1::tl1, he2::tl2 -> (he1,he2)::combine tl1 tl2
87 | _::tl, [] -> (false,C.Rel ~-1)::combine tl [] (* dummy term *)
88 | [],_::_ -> assert false
90 let lefts, _ = HExtlib.split_nth (min j (List.length args)) args in
91 List.map (fun ((b,x),i) -> b && x = C.Rel (k-i))
92 (HExtlib.list_mapi (fun x i -> x,i) (combine acc lefts))
93 | t -> U.fold (fun _ k -> k+1) k aux acc t
95 List.fold_left (aux 0)
96 (let rec f = function 0 -> [] | n -> true :: f (n-1) in f j) bos
99 (* if n < 0, then splits all prods from an arity, returning a sort *)
100 let rec split_prods ~subst context n te =
101 match (n, R.whd ~subst context te) with
102 | (0, _) -> context,te
103 | (n, C.Sort _) when n <= 0 -> context,te
104 | (n, C.Prod (name,so,ta)) ->
105 split_prods ~subst ((name,(C.Decl so))::context) (n - 1) ta
106 | (_, _) -> raise (AssertFailure (lazy "split_prods"))
109 let debruijn uri number_of_types context =
112 | C.Meta (i,(s,C.Ctx l)) ->
113 let l1 = HExtlib.sharing_map (aux (k-s)) l in
114 if l1 == l then t else C.Meta (i,(s,C.Ctx l1))
116 | C.Const (Ref.Ref (uri1,(Ref.Fix (no,_,_) | Ref.CoFix no)))
117 | C.Const (Ref.Ref (uri1,Ref.Ind (_,no,_))) when NUri.eq uri uri1 ->
118 C.Rel (k + number_of_types - no)
119 | t -> U.map (fun _ k -> k+1) k aux t
121 aux (List.length context)
124 let sort_of_prod ~metasenv ~subst context (name,s) (t1, t2) =
125 let t1 = R.whd ~subst context t1 in
126 let t2 = R.whd ~subst ((name,C.Decl s)::context) t2 in
128 | C.Sort _, C.Sort C.Prop -> t2
129 | C.Sort (C.Type u1), C.Sort (C.Type u2) -> C.Sort (C.Type (u1@u2))
130 | C.Sort C.Prop,C.Sort (C.Type _) -> t2
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
147 if R.are_convertible ~subst context ty_arg s then
148 aux (S.subst ~avoid_beta_redexes:true arg t) tl
152 (lazy (Printf.sprintf
153 ("Appl: wrong application of %s: the parameter %s has type"^^
154 "\n%s\nbut it should have type \n%s\nContext:\n%s\n")
155 (PP.ppterm ~subst ~metasenv ~context he)
156 (PP.ppterm ~subst ~metasenv ~context arg)
157 (PP.ppterm ~subst ~metasenv ~context ty_arg)
158 (PP.ppterm ~subst ~metasenv ~context s)
159 (PP.ppcontext ~subst ~metasenv context))))
163 (lazy (Printf.sprintf
164 "Appl: %s is not a function, it cannot be applied"
165 (PP.ppterm ~subst ~metasenv ~context
166 (let res = List.length tl in
167 let eaten = List.length args_with_ty - res in
170 (fst (HExtlib.split_nth eaten args_with_ty)))))))))
172 aux ty_he args_with_ty
175 (* instantiate_parameters ps (x1:T1)...(xn:Tn)C *)
176 (* returns ((x_|ps|:T_|ps|)...(xn:Tn)C){ps_1 / x1 ; ... ; ps_|ps| / x_|ps|} *)
177 let rec instantiate_parameters params c =
180 | C.Prod (_,_,ta), he::tl -> instantiate_parameters tl (S.subst he ta)
181 | _,_ -> raise (AssertFailure (lazy "1"))
184 let specialize_inductive_type_constrs ~subst context ty_term =
185 match R.whd ~subst context ty_term with
186 | C.Const (Ref.Ref (_,Ref.Ind _) as ref)
187 | C.Appl (C.Const (Ref.Ref (_,Ref.Ind _) as ref) :: _ ) as ty ->
188 let args = match ty with C.Appl (_::tl) -> tl | _ -> [] in
189 let _, leftno, itl, _, i = E.get_checked_indtys ref in
190 let left_args,_ = HExtlib.split_nth leftno args in
191 let _,_,_,cl = List.nth itl i in
193 (fun (rel,name,ty) -> rel, name, instantiate_parameters left_args ty) cl
197 let specialize_and_abstract_constrs ~subst r_uri r_len context ty_term =
198 let cl = specialize_inductive_type_constrs ~subst context ty_term in
199 let len = List.length context in
201 match E.get_checked_obj r_uri with
202 | _,_,_,_, C.Inductive (_,_,tys,_) ->
203 context @ List.map (fun (_,name,arity,_) -> name,C.Decl arity) tys
207 List.map (fun (_,id,ty) -> id, debruijn r_uri r_len context ty) cl,
211 exception DoesOccur;;
213 let does_not_occur ~subst context n nn t =
214 let rec aux k _ = function
215 | C.Rel m when m > n+k && m <= nn+k -> raise DoesOccur
216 | C.Rel m when m <= k || m > nn+k -> ()
218 (try match List.nth context (m-1-k) with
219 | _,C.Def (bo,_) -> aux (n-m) () bo
221 with Failure _ -> assert false)
222 | C.Meta (_,(_,(C.Irl 0 | C.Ctx []))) -> (* closed meta *) ()
223 | C.Meta (mno,(s,l)) ->
225 (* possible optimization here: try does_not_occur on l and
226 perform substitution only if DoesOccur is raised *)
227 let _,_,term,_ = U.lookup_subst mno subst in
228 aux (k-s) () (S.subst_meta (0,l) term)
229 with U.Subst_not_found _ -> match l with
230 | C.Irl len -> if not (n+k >= s+len || s > nn+k) then raise DoesOccur
231 | C.Ctx lc -> List.iter (aux (k-s) ()) lc)
232 | t -> U.fold (fun _ k -> k + 1) k aux () t
235 with DoesOccur -> false
238 let rec eat_lambdas ~subst ~metasenv context n te =
239 match (n, R.whd ~subst context te) with
240 | (0, _) -> (te, context)
241 | (n, C.Lambda (name,so,ta)) when n > 0 ->
242 eat_lambdas ~subst ~metasenv ((name,(C.Decl so))::context) (n - 1) ta
244 raise (AssertFailure (lazy (Printf.sprintf "eat_lambdas (%d, %s)" n
245 (PP.ppterm ~subst ~metasenv ~context te))))
248 let rec eat_or_subst_lambdas
249 ~subst ~metasenv n te to_be_subst args (context,_,_ as k)
251 match n, R.whd ~subst context te, to_be_subst, args with
252 | (n, C.Lambda (_,_,ta),true::to_be_subst,arg::args) when n > 0 ->
253 eat_or_subst_lambdas ~subst ~metasenv (n - 1) (S.subst arg ta)
255 | (n, C.Lambda (name,so,ta),false::to_be_subst,_::args) when n > 0 ->
256 eat_or_subst_lambdas ~subst ~metasenv (n - 1) ta to_be_subst args
257 (shift_k (name,(C.Decl so)) k)
258 | (_, te, _, _) -> te, k
262 (*CSC l'indice x dei tipi induttivi e' t.c. n < x <= nn *)
263 (*CSC questa funzione e' simile alla are_all_occurrences_positive, ma fa *)
264 (*CSC dei controlli leggermente diversi. Viene invocata solamente dalla *)
265 (*CSC strictly_positive *)
266 (*CSC definizione (giusta???) tratta dalla mail di Hugo ;-) *)
267 let rec weakly_positive ~subst context n nn uri te =
268 (*CSC: Che schifo! Bisogna capire meglio e trovare una soluzione ragionevole!*)
269 let dummy = C.Sort C.Prop in
270 (*CSC: mettere in cicSubstitution *)
271 let rec subst_inductive_type_with_dummy _ = function
272 | C.Const (Ref.Ref (uri',Ref.Ind (true,0,_))) when NUri.eq uri' uri -> dummy
273 | C.Appl ((C.Const (Ref.Ref (uri',Ref.Ind (true,0,_))))::_)
274 when NUri.eq uri' uri -> dummy
275 | t -> U.map (fun _ x->x) () subst_inductive_type_with_dummy t
277 match R.whd context te with
278 | C.Const (Ref.Ref (uri',Ref.Ind _))
279 | C.Appl ((C.Const (Ref.Ref (uri',Ref.Ind _)))::_)
280 when NUri.eq uri' uri -> true
281 | C.Prod (name,source,dest) when
282 does_not_occur ~subst ((name,C.Decl source)::context) 0 1 dest ->
283 (* dummy abstraction, so we behave as in the anonimous case *)
284 strictly_positive ~subst context n nn
285 (subst_inductive_type_with_dummy () source) &&
286 weakly_positive ~subst ((name,C.Decl source)::context)
287 (n + 1) (nn + 1) uri dest
288 | C.Prod (name,source,dest) ->
289 does_not_occur ~subst context n nn
290 (subst_inductive_type_with_dummy () source)&&
291 weakly_positive ~subst ((name,C.Decl source)::context)
292 (n + 1) (nn + 1) uri dest
294 raise (TypeCheckerFailure (lazy "Malformed inductive constructor type"))
296 and strictly_positive ~subst context n nn te =
297 match R.whd context te with
298 | t when does_not_occur ~subst context n nn t -> true
300 | C.Prod (name,so,ta) ->
301 does_not_occur ~subst context n nn so &&
302 strictly_positive ~subst ((name,C.Decl so)::context) (n+1) (nn+1) ta
303 | C.Appl ((C.Rel m)::tl) when m > n && m <= nn ->
304 List.for_all (does_not_occur ~subst context n nn) tl
305 | C.Appl (C.Const (Ref.Ref (uri,Ref.Ind _) as r)::tl) ->
306 let _,paramsno,tyl,_,i = E.get_checked_indtys r in
307 let _,name,ity,cl = List.nth tyl i in
308 let ok = List.length tyl = 1 in
309 let params, arguments = HExtlib.split_nth paramsno tl in
310 let lifted_params = List.map (S.lift 1) params in
312 List.map (fun (_,_,te) -> instantiate_parameters lifted_params te) cl
315 List.for_all (does_not_occur ~subst context n nn) arguments &&
317 (weakly_positive ~subst ((name,C.Decl ity)::context) (n+1) (nn+1) uri) cl
320 (* the inductive type indexes are s.t. n < x <= nn *)
321 and are_all_occurrences_positive ~subst context uri indparamsno i n nn te =
322 match R.whd context te with
323 | C.Appl ((C.Rel m)::tl) as reduct when m = i ->
329 match R.whd context x with
330 | C.Rel m when m = n - (indparamsno - k) -> k - 1
331 | _ -> raise (TypeCheckerFailure (lazy
332 ("Argument "^string_of_int (indparamsno - k + 1) ^ " (of " ^
333 string_of_int indparamsno ^ " fixed) is not homogeneous in "^
334 "appl:\n"^ PP.ppterm ~context ~subst ~metasenv:[] reduct))))
338 List.for_all (does_not_occur ~subst context n nn) tl
340 raise (TypeCheckerFailure
341 (lazy ("Non-positive occurence in mutual inductive definition(s) [2]"^
342 NUri.string_of_uri uri)))
343 | C.Rel m when m = i ->
344 if indparamsno = 0 then
347 raise (TypeCheckerFailure
348 (lazy ("Non-positive occurence in mutual inductive definition(s) [3]"^
349 NUri.string_of_uri uri)))
350 | C.Prod (name,source,dest) when
351 does_not_occur ~subst ((name,C.Decl source)::context) 0 1 dest ->
352 strictly_positive ~subst context n nn source &&
353 are_all_occurrences_positive ~subst
354 ((name,C.Decl source)::context) uri indparamsno
355 (i+1) (n + 1) (nn + 1) dest
356 | C.Prod (name,source,dest) ->
357 if not (does_not_occur ~subst context n nn source) then
358 raise (TypeCheckerFailure (lazy ("Non-positive occurrence in "^
359 PP.ppterm ~context ~metasenv:[] ~subst te)));
360 are_all_occurrences_positive ~subst ((name,C.Decl source)::context)
361 uri indparamsno (i+1) (n + 1) (nn + 1) dest
363 prerr_endline ("MM: " ^ NCicPp.ppterm ~subst ~metasenv:[] ~context te);
365 (TypeCheckerFailure (lazy ("Malformed inductive constructor type " ^
366 (NUri.string_of_uri uri))))
369 exception NotGuarded of string Lazy.t;;
371 let rec typeof ~subst ~metasenv context term =
372 let rec typeof_aux context =
373 fun t -> (*prerr_endline (PP.ppterm ~metasenv ~subst ~context t);*)
377 match List.nth context (n - 1) with
378 | (_,C.Decl ty) -> S.lift n ty
379 | (_,C.Def (_,ty)) -> S.lift n ty
380 with Failure _ -> raise (TypeCheckerFailure (lazy "unbound variable")))
381 | C.Sort (C.Type [false,u]) -> C.Sort (C.Type [true, u])
382 | C.Sort (C.Type _) ->
383 raise (AssertFailure (lazy ("Cannot type an inferred type: "^
384 NCicPp.ppterm ~subst ~metasenv ~context t)))
385 | C.Sort _ -> C.Sort (C.Type NCicEnvironment.type0)
386 | C.Implicit _ -> raise (AssertFailure (lazy "Implicit found"))
387 | C.Meta (n,l) as t ->
388 let canonical_ctx,ty =
390 let _,c,_,ty = U.lookup_subst n subst in c,ty
391 with U.Subst_not_found _ -> try
392 let _,c,ty = U.lookup_meta n metasenv in c,ty
393 with U.Meta_not_found _ ->
394 raise (AssertFailure (lazy (Printf.sprintf
395 "%s not found" (PP.ppterm ~subst ~metasenv ~context t))))
397 check_metasenv_consistency t ~subst ~metasenv context canonical_ctx l;
399 | C.Const ref -> type_of_constant ref
400 | C.Prod (name,s,t) ->
401 let sort1 = typeof_aux context s in
402 let sort2 = typeof_aux ((name,(C.Decl s))::context) t in
403 sort_of_prod ~metasenv ~subst context (name,s) (sort1,sort2)
404 | C.Lambda (n,s,t) ->
405 let sort = typeof_aux context s in
406 (match R.whd ~subst context sort with
407 | C.Meta _ | C.Sort _ -> ()
410 (TypeCheckerFailure (lazy (Printf.sprintf
411 ("Not well-typed lambda-abstraction: " ^^
412 "the source %s should be a type; instead it is a term " ^^
413 "of type %s") (PP.ppterm ~subst ~metasenv ~context s)
414 (PP.ppterm ~subst ~metasenv ~context sort)))));
415 let ty = typeof_aux ((n,(C.Decl s))::context) t in
417 | C.LetIn (n,ty,t,bo) ->
418 let ty_t = typeof_aux context t in
419 let _ = typeof_aux context ty in
420 if not (R.are_convertible ~subst context ty_t ty) then
423 (lazy (Printf.sprintf
424 "The type of %s is %s but it is expected to be %s"
425 (PP.ppterm ~subst ~metasenv ~context t)
426 (PP.ppterm ~subst ~metasenv ~context ty_t)
427 (PP.ppterm ~subst ~metasenv ~context ty))))
429 let ty_bo = typeof_aux ((n,C.Def (t,ty))::context) bo in
430 S.subst ~avoid_beta_redexes:true t ty_bo
431 | C.Appl (he::(_::_ as args)) ->
432 let ty_he = typeof_aux context he in
433 let args_with_ty = List.map (fun t -> t, typeof_aux context t) args in
434 eat_prods ~subst ~metasenv context he ty_he args_with_ty
435 | C.Appl _ -> raise (AssertFailure (lazy "Appl of length < 2"))
436 | C.Match (Ref.Ref (_,Ref.Ind (_,tyno,_)) as r,outtype,term,pl) ->
437 let outsort = typeof_aux context outtype in
438 let _,leftno,itl,_,_ = E.get_checked_indtys r in
440 let _,_,_,cl = List.nth itl tyno in List.length cl
442 let parameters, arguments =
443 let ty = R.whd ~subst context (typeof_aux context term) in
446 C.Const (Ref.Ref (_,Ref.Ind _) as r') -> r',[]
447 | C.Appl (C.Const (Ref.Ref (_,Ref.Ind _) as r') :: tl) -> r',tl
450 (TypeCheckerFailure (lazy (Printf.sprintf
451 "Case analysis: analysed term %s is not an inductive one"
452 (PP.ppterm ~subst ~metasenv ~context term)))) in
453 if not (Ref.eq r r') then
455 (TypeCheckerFailure (lazy (Printf.sprintf
456 ("Case analysys: analysed term type is %s, but is expected " ^^
457 "to be (an application of) %s")
458 (PP.ppterm ~subst ~metasenv ~context ty)
459 (PP.ppterm ~subst ~metasenv ~context (C.Const r')))))
461 try HExtlib.split_nth leftno tl
464 raise (TypeCheckerFailure (lazy (Printf.sprintf
465 "%s is partially applied"
466 (PP.ppterm ~subst ~metasenv ~context ty)))) in
467 (* let's control if the sort elimination is allowed: [(I q1 ... qr)|B] *)
468 let sort_of_ind_type =
469 if parameters = [] then C.Const r
470 else C.Appl ((C.Const r)::parameters) in
471 let type_of_sort_of_ind_ty = typeof_aux context sort_of_ind_type in
472 check_allowed_sort_elimination ~subst ~metasenv r context
473 sort_of_ind_type type_of_sort_of_ind_ty outsort;
474 (* let's check if the type of branches are right *)
475 if List.length pl <> constructorsno then
476 raise (TypeCheckerFailure (lazy ("Wrong number of cases in a match")));
477 let j,branches_ok,p_ty, exp_p_ty =
479 (fun (j,b,old_p_ty,old_exp_p_ty) p ->
482 let cons = Ref.mk_constructor j r in
483 if parameters = [] then C.Const cons
484 else C.Appl (C.Const cons::parameters)
486 let ty_p = typeof_aux context p in
487 let ty_cons = typeof_aux context cons in
489 type_of_branch ~subst context leftno outtype cons ty_cons 0
491 j+1, R.are_convertible ~subst context ty_p ty_branch,
494 j,false,old_p_ty,old_exp_p_ty
495 ) (1,true,C.Sort C.Prop,C.Sort C.Prop) pl
497 if not branches_ok then
500 (lazy (Printf.sprintf ("Branch for constructor %s :=\n%s\n"^^
501 "has type %s\nnot convertible with %s")
502 (PP.ppterm ~subst ~metasenv ~context
503 (C.Const (Ref.mk_constructor (j-1) r)))
504 (PP.ppterm ~metasenv ~subst ~context (List.nth pl (j-2)))
505 (PP.ppterm ~metasenv ~subst ~context p_ty)
506 (PP.ppterm ~metasenv ~subst ~context exp_p_ty))));
507 let res = outtype::arguments@[term] in
508 R.head_beta_reduce (C.Appl res)
509 | C.Match _ -> assert false
511 and type_of_branch ~subst context leftno outty cons tycons liftno =
512 match R.whd ~subst context tycons with
513 | C.Const (Ref.Ref (_,Ref.Ind _)) -> C.Appl [S.lift liftno outty ; cons]
514 | C.Appl (C.Const (Ref.Ref (_,Ref.Ind _))::tl) ->
515 let _,arguments = HExtlib.split_nth leftno tl in
516 C.Appl (S.lift liftno outty::arguments@[cons])
517 | C.Prod (name,so,de) ->
519 match S.lift 1 cons with
520 | C.Appl l -> C.Appl (l@[C.Rel 1])
521 | t -> C.Appl [t ; C.Rel 1]
524 type_of_branch ~subst ((name,(C.Decl so))::context)
525 leftno outty cons de (liftno+1))
526 | _ -> raise (AssertFailure (lazy "type_of_branch"))
528 (* check_metasenv_consistency checks that the "canonical" context of a
529 metavariable is consitent - up to relocation via the relocation list l -
530 with the actual context *)
531 and check_metasenv_consistency
532 ~subst ~metasenv term context canonical_context l
536 let context = snd (HExtlib.split_nth shift context) in
537 let rec compare = function
541 raise (AssertFailure (lazy (Printf.sprintf
542 "Local and canonical context %s have different lengths"
543 (PP.ppterm ~subst ~context ~metasenv term))))
545 raise (TypeCheckerFailure (lazy (Printf.sprintf
546 "Unbound variable -%d in %s" m
547 (PP.ppterm ~subst ~metasenv ~context term))))
550 (_,C.Decl t1), (_,C.Decl t2)
551 | (_,C.Def (t1,_)), (_,C.Def (t2,_))
552 | (_,C.Def (_,t1)), (_,C.Decl t2) ->
553 if not (R.are_convertible ~subst tl t1 t2) then
556 (lazy (Printf.sprintf
557 ("Not well typed metavariable local context for %s: " ^^
558 "%s expected, which is not convertible with %s")
559 (PP.ppterm ~subst ~metasenv ~context term)
560 (PP.ppterm ~subst ~metasenv ~context t2)
561 (PP.ppterm ~subst ~metasenv ~context t1))))
564 (TypeCheckerFailure (lazy (Printf.sprintf
565 ("Not well typed metavariable local context for %s: " ^^
566 "a definition expected, but a declaration found")
567 (PP.ppterm ~subst ~metasenv ~context term)))));
568 compare (m - 1,tl,ctl)
570 compare (n,context,canonical_context)
572 (* we avoid useless lifting by shortening the context*)
573 let l,context = (0,lc_kind), snd (HExtlib.split_nth shift context) in
574 let lifted_canonical_context =
575 let rec lift_metas i = function
577 | (n,C.Decl t)::tl ->
578 (n,C.Decl (S.subst_meta l (S.lift i t)))::(lift_metas (i+1) tl)
579 | (n,C.Def (t,ty))::tl ->
580 (n,C.Def ((S.subst_meta l (S.lift i t)),
581 S.subst_meta l (S.lift i ty)))::(lift_metas (i+1) tl)
583 lift_metas 1 canonical_context in
584 let l = U.expand_local_context lc_kind in
589 | t, (_,C.Def (ct,_)) ->
590 (*CSC: the following optimization is to avoid a possibly expensive
591 reduction that can be easily avoided and that is quite
592 frequent. However, this is better handled using levels to
598 match List.nth context (n - 1) with
599 | (_,C.Def (te,_)) -> S.lift n te
604 if not (R.are_convertible ~subst context optimized_t ct)
608 (lazy (Printf.sprintf
609 ("Not well typed metavariable local context: " ^^
610 "expected a term convertible with %s, found %s")
611 (PP.ppterm ~subst ~metasenv ~context ct)
612 (PP.ppterm ~subst ~metasenv ~context t))))
613 | t, (_,C.Decl ct) ->
614 let type_t = typeof_aux context t in
615 if not (R.are_convertible ~subst context type_t ct) then
616 raise (TypeCheckerFailure
617 (lazy (Printf.sprintf
618 ("Not well typed metavariable local context: "^^
619 "expected a term of type %s, found %s of type %s")
620 (PP.ppterm ~subst ~metasenv ~context ct)
621 (PP.ppterm ~subst ~metasenv ~context t)
622 (PP.ppterm ~subst ~metasenv ~context type_t))))
623 ) l lifted_canonical_context
625 Invalid_argument _ ->
626 raise (AssertFailure (lazy (Printf.sprintf
627 "Local and canonical context %s have different lengths"
628 (PP.ppterm ~subst ~metasenv ~context term))))
630 and is_non_informative context paramsno c =
631 let rec aux context c =
632 match R.whd context c with
633 | C.Prod (n,so,de) ->
634 let s = typeof_aux context so in
635 s = C.Sort C.Prop && aux ((n,(C.Decl so))::context) de
637 let context',dx = split_prods ~subst:[] context paramsno c in
640 and check_allowed_sort_elimination ~subst ~metasenv r =
643 | C.Appl l -> C.Appl (l @ [arg])
644 | t -> C.Appl [t;arg] in
645 let rec aux context ind arity1 arity2 =
646 let arity1 = R.whd ~subst context arity1 in
647 let arity2 = R.whd ~subst context arity2 in
648 match arity1,arity2 with
649 | C.Prod (name,so1,de1), C.Prod (_,so2,de2) ->
650 if not (R.are_convertible ~subst context so1 so2) then
651 raise (TypeCheckerFailure (lazy (Printf.sprintf
652 "In outtype: expected %s, found %s"
653 (PP.ppterm ~subst ~metasenv ~context so1)
654 (PP.ppterm ~subst ~metasenv ~context so2)
656 aux ((name, C.Decl so1)::context)
657 (mkapp (S.lift 1 ind) (C.Rel 1)) de1 de2
658 | C.Sort _, C.Prod (name,so,ta) ->
659 if not (R.are_convertible ~subst context so ind) then
660 raise (TypeCheckerFailure (lazy (Printf.sprintf
661 "In outtype: expected %s, found %s"
662 (PP.ppterm ~subst ~metasenv ~context ind)
663 (PP.ppterm ~subst ~metasenv ~context so)
665 (match arity1, R.whd ~subst ((name,C.Decl so)::context) ta with
666 | (C.Sort C.Type _, C.Sort _)
667 | (C.Sort C.Prop, C.Sort C.Prop) -> ()
668 | (C.Sort C.Prop, C.Sort C.Type _) ->
669 (* TODO: we should pass all these parameters since we
670 * have them already *)
671 let _,leftno,itl,_,i = E.get_checked_indtys r in
672 let itl_len = List.length itl in
673 let _,name,ty,cl = List.nth itl i in
674 let cl_len = List.length cl in
675 (* is it a singleton or empty non recursive and non informative
679 (itl_len = 1 && cl_len = 1 &&
680 is_non_informative [name,C.Decl ty] leftno
681 (let _,_,x = List.nth cl 0 in x)))
683 raise (TypeCheckerFailure (lazy
684 ("Sort elimination not allowed")));
691 typeof_aux context term
693 and check_mutual_inductive_defs uri ~metasenv ~subst leftno tyl =
694 (* let's check if the arity of the inductive types are well formed *)
695 List.iter (fun (_,_,x,_) -> ignore (typeof ~subst ~metasenv [] x)) tyl;
696 (* let's check if the types of the inductive constructors are well formed. *)
697 let len = List.length tyl in
698 let tys = List.rev_map (fun (_,n,ty,_) -> (n,(C.Decl ty))) tyl in
701 (fun (_,_,ty,cl) i ->
702 let context,ty_sort = split_prods ~subst [] ~-1 ty in
703 let sx_context_ty_rev,_ = HExtlib.split_nth leftno (List.rev context) in
706 let te = debruijn uri len [] te in
707 let context,te = split_prods ~subst tys leftno te in
708 let _,chopped_context_rev =
709 HExtlib.split_nth (List.length tys) (List.rev context) in
710 let sx_context_te_rev,_ =
711 HExtlib.split_nth leftno chopped_context_rev in
713 ignore (List.fold_left2
714 (fun context item1 item2 ->
716 match item1,item2 with
717 (n1,C.Decl ty1),(n2,C.Decl ty2) ->
718 n1 = n2 && R.are_convertible ~subst context ty1 ty2
719 | (n1,C.Def (bo1,ty1)),(n2,C.Def (bo2,ty2)) ->
721 && R.are_convertible ~subst context ty1 ty2
722 && R.are_convertible ~subst context bo1 bo2
725 if not convertible then
726 raise (TypeCheckerFailure (lazy
727 ("Mismatch between the left parameters of the constructor " ^
728 "and those of its inductive type")))
731 ) [] sx_context_ty_rev sx_context_te_rev)
732 with Invalid_argument _ -> assert false);
733 let con_sort = typeof ~subst ~metasenv context te in
734 (match R.whd ~subst context con_sort, R.whd ~subst [] ty_sort with
735 (C.Sort (C.Type u1) as s1), (C.Sort (C.Type u2) as s2) ->
736 if not (E.universe_leq u1 u2) then
739 (lazy ("The type " ^ PP.ppterm ~metasenv ~subst ~context s1^
740 " of the constructor is not included in the inductive" ^
741 " type sort " ^ PP.ppterm ~metasenv ~subst ~context s2)))
742 | C.Sort _, C.Sort C.Prop
743 | C.Sort _, C.Sort C.Type _ -> ()
747 (lazy ("Wrong constructor or inductive arity shape"))));
748 (* let's check also the positivity conditions *)
751 (are_all_occurrences_positive ~subst context uri leftno
752 (i+leftno) leftno (len+leftno) te)
756 (lazy ("Non positive occurence in "^NUri.string_of_uri uri))))
761 and guarded_by_destructors r_uri r_len ~subst ~metasenv context recfuns t =
762 let recursor f k t = U.fold shift_k k (fun k () -> f k) () t in
763 let rec aux (context, recfuns, x as k) t =
765 prerr_endline ("GB:\n" ^
766 PP.ppcontext ~subst ~metasenv context^
767 PP.ppterm ~metasenv ~subst ~context t^
768 string_of_recfuns ~subst ~metasenv ~context recfuns);
772 | C.Rel m as t when is_dangerous m recfuns ->
773 raise (NotGuarded (lazy
774 (PP.ppterm ~subst ~metasenv ~context t ^
775 " is a partial application of a fix")))
776 | C.Appl ((C.Rel m)::tl) as t when is_dangerous m recfuns ->
777 let rec_no = get_recno m recfuns in
778 if not (List.length tl > rec_no) then
779 raise (NotGuarded (lazy
780 (PP.ppterm ~context ~subst ~metasenv t ^
781 " is a partial application of a fix")))
783 let rec_arg = List.nth tl rec_no in
784 if not (is_really_smaller r_uri r_len ~subst ~metasenv k rec_arg) then
785 raise (NotGuarded (lazy (Printf.sprintf ("Recursive call %s, %s is not"
786 ^^ " smaller.\ncontext:\n%s") (PP.ppterm ~context ~subst ~metasenv
787 t) (PP.ppterm ~context ~subst ~metasenv rec_arg)
788 (PP.ppcontext ~subst ~metasenv context))));
790 | C.Appl ((C.Rel m)::tl) when is_unfolded m recfuns ->
791 let fixed_args = get_fixed_args m recfuns in
792 HExtlib.list_iter_default2
793 (fun x b -> if not b then aux k x) tl false fixed_args
795 (match List.nth context (m-1) with
797 | _,C.Def (bo,_) -> aux k (S.lift m bo))
799 | C.Appl (C.Const ((Ref.Ref (uri,Ref.Fix (i,recno,_))) as r)::args) ->
800 if List.exists (fun t -> try aux k t;false with NotGuarded _ -> true) args
802 let fl,_,_ = E.get_checked_fixes_or_cofixes r in
804 List.split (List.map (fun (_,name,_,ty,bo) -> (name, C.Decl ty), bo) fl)
806 let fl_len = List.length fl in
807 let bos = List.map (debruijn uri fl_len context) bos in
808 let j = List.fold_left min max_int (List.map (fun (_,_,i,_,_)->i) fl) in
809 let ctx_len = List.length context in
810 (* we may look for fixed params not only up to j ... *)
811 let fa = fixed_args bos j ctx_len (ctx_len + fl_len) in
812 HExtlib.list_iter_default2
813 (fun x b -> if not b then aux k x) args false fa;
814 let context = context@ctx_tys in
815 let ctx_len = List.length context in
817 HExtlib.list_mapi (fun _ i -> ctx_len - i, UnfFix fa) ctx_tys
819 let new_k = context, extra_recfuns@recfuns, x in
824 eat_or_subst_lambdas ~subst ~metasenv j bo fa args new_k
828 List.length args > recno &&
829 (*case where the recursive argument is already really_smaller *)
830 is_really_smaller r_uri r_len ~subst ~metasenv k
831 (List.nth args recno)
833 let bo,(context, _, _ as new_k) = bo_and_k in
835 eat_lambdas ~subst ~metasenv context (recno + 1 - j) bo in
836 let new_context_part,_ =
837 HExtlib.split_nth (List.length context' - List.length context)
839 let k = List.fold_right shift_k new_context_part new_k in
840 let context, recfuns, x = k in
841 let k = context, (1,Safe)::recfuns, x in
847 List.iter (fun (bo,k) -> aux k bo) bos_and_ks
848 | C.Match (Ref.Ref (_,Ref.Ind (true,_,_)),outtype,term,pl) as t ->
849 (match R.whd ~subst context term with
850 | C.Rel m | C.Appl (C.Rel m :: _ ) as t when is_safe m recfuns || m = x ->
851 let ty = typeof ~subst ~metasenv context term in
852 let dc_ctx, dcl, start, stop =
853 specialize_and_abstract_constrs ~subst r_uri r_len context ty in
854 let args = match t with C.Appl (_::tl) -> tl | _ -> [] in
856 List.iter (aux k) args;
859 let rl = recursive_args ~subst ~metasenv dc_ctx start stop dc in
860 let p, k = get_new_safes ~subst k p rl in
863 | _ -> recursor aux k t)
864 | t -> recursor aux k t
866 NotGuarded _ as exc ->
867 let t' = R.whd ~delta:0 ~subst context t in
868 if t = t' then raise exc
871 try aux (context, recfuns, 1) t
872 with NotGuarded s -> raise (TypeCheckerFailure s)
874 and guarded_by_constructors ~subst ~metasenv context t indURI indlen nn =
875 let rec aux context n nn h te =
876 match R.whd ~subst context te with
877 | C.Rel m when m > n && m <= nn -> h
878 | C.Rel _ | C.Meta _ -> true
882 | C.Const (Ref.Ref (_,Ref.Ind _))
883 | C.LetIn _ -> raise (AssertFailure (lazy "17"))
884 | C.Lambda (name,so,de) ->
885 does_not_occur ~subst context n nn so &&
886 aux ((name,C.Decl so)::context) (n + 1) (nn + 1) h de
887 | C.Appl ((C.Rel m)::tl) when m > n && m <= nn ->
888 h && List.for_all (does_not_occur ~subst context n nn) tl
889 | C.Const (Ref.Ref (_,Ref.Con _)) -> true
890 | C.Appl (C.Const (Ref.Ref (_, Ref.Con (_,j,paramsno))) :: tl) as t ->
891 let ty_t = typeof ~subst ~metasenv context t in
892 let dc_ctx, dcl, start, stop =
893 specialize_and_abstract_constrs ~subst indURI indlen context ty_t in
894 let _, dc = List.nth dcl (j-1) in
896 prerr_endline (PP.ppterm ~subst ~metasenv ~context:dc_ctx dc);
897 prerr_endline (PP.ppcontext ~subst ~metasenv dc_ctx);
899 let rec_params = recursive_args ~subst ~metasenv dc_ctx start stop dc in
900 let rec analyse_instantiated_type rec_spec args =
901 match rec_spec, args with
902 | h::rec_spec, he::args ->
903 aux context n nn h he && analyse_instantiated_type rec_spec args
905 | _ -> raise (AssertFailure (lazy
906 ("Too many args for constructor: " ^ String.concat " "
907 (List.map (fun x-> PP.ppterm ~subst ~metasenv ~context x) args))))
909 let left, args = HExtlib.split_nth paramsno tl in
910 List.for_all (does_not_occur ~subst context n nn) left &&
911 analyse_instantiated_type rec_params args
912 | C.Appl ((C.Match (_,out,te,pl))::_)
913 | C.Match (_,out,te,pl) as t ->
914 let tl = match t with C.Appl (_::tl) -> tl | _ -> [] in
915 List.for_all (does_not_occur ~subst context n nn) tl &&
916 does_not_occur ~subst context n nn out &&
917 does_not_occur ~subst context n nn te &&
918 List.for_all (aux context n nn h) pl
919 | C.Const (Ref.Ref (u,(Ref.Fix _| Ref.CoFix _)) as ref)
920 | C.Appl(C.Const (Ref.Ref(u,(Ref.Fix _| Ref.CoFix _)) as ref) :: _) as t ->
921 let tl = match t with C.Appl (_::tl) -> tl | _ -> [] in
922 let fl,_,_ = E.get_checked_fixes_or_cofixes ref in
923 let len = List.length fl in
924 let tys = List.map (fun (_,n,_,ty,_) -> n, C.Decl ty) fl in
925 List.for_all (does_not_occur ~subst context n nn) tl &&
928 aux (context@tys) n nn h (debruijn u len context bo))
931 | C.Appl _ as t -> does_not_occur ~subst context n nn t
933 aux context 0 nn false t
935 and recursive_args ~subst ~metasenv context n nn te =
936 match R.whd context te with
937 | C.Rel _ | C.Appl _ | C.Const _ -> []
938 | C.Prod (name,so,de) ->
939 (not (does_not_occur ~subst context n nn so)) ::
940 (recursive_args ~subst ~metasenv
941 ((name,(C.Decl so))::context) (n+1) (nn + 1) de)
943 raise (AssertFailure (lazy ("recursive_args:" ^ PP.ppterm ~subst
944 ~metasenv ~context:[] t)))
946 and get_new_safes ~subst (context, recfuns, x as k) p rl =
947 match R.whd ~subst context p, rl with
948 | C.Lambda (name,so,ta), b::tl ->
949 let recfuns = (if b then [0,Safe] else []) @ recfuns in
951 (shift_k (name,(C.Decl so)) (context, recfuns, x)) ta tl
952 | C.Meta _ as e, _ | e, [] -> e, k
953 | _ -> raise (AssertFailure (lazy "Ill formed pattern"))
955 and is_really_smaller
956 r_uri r_len ~subst ~metasenv (context, recfuns, x as k) te
958 match R.whd ~subst context te with
959 | C.Rel m when is_safe m recfuns -> true
960 | C.Lambda (name, s, t) ->
961 is_really_smaller r_uri r_len ~subst ~metasenv (shift_k (name,C.Decl s) k) t
963 is_really_smaller r_uri r_len ~subst ~metasenv k he
965 | C.Const (Ref.Ref (_,Ref.Con _)) -> false
967 | C.Const (Ref.Ref (_,Ref.Fix _)) -> assert false
969 | C.Match (Ref.Ref (_,Ref.Ind (isinductive,_,_)),_,term,pl) ->
971 | C.Rel m | C.Appl (C.Rel m :: _ ) when is_safe m recfuns || m = x ->
972 if not isinductive then
973 List.for_all (is_really_smaller r_uri r_len ~subst ~metasenv k) pl
975 let ty = typeof ~subst ~metasenv context term in
976 let dc_ctx, dcl, start, stop =
977 specialize_and_abstract_constrs ~subst r_uri r_len context ty in
980 let rl = recursive_args ~subst ~metasenv dc_ctx start stop dc in
981 let e, k = get_new_safes ~subst k p rl in
982 is_really_smaller r_uri r_len ~subst ~metasenv k e)
984 | _ -> List.for_all (is_really_smaller r_uri r_len ~subst ~metasenv k) pl)
987 and returns_a_coinductive ~subst context ty =
988 match R.whd ~subst context ty with
989 | C.Const (Ref.Ref (uri,Ref.Ind (false,_,_)) as ref)
990 | C.Appl (C.Const (Ref.Ref (uri,Ref.Ind (false,_,_)) as ref)::_) ->
991 let _, _, itl, _, _ = E.get_checked_indtys ref in
992 Some (uri,List.length itl)
993 | C.Prod (n,so,de) ->
994 returns_a_coinductive ~subst ((n,C.Decl so)::context) de
997 and type_of_constant ((Ref.Ref (uri,_)) as ref) =
999 raise (TypeCheckerFailure (lazy "Inconsistent cached infos in reference"))
1001 match E.get_checked_obj uri, ref with
1002 | (_,_,_,_,C.Inductive(isind1,lno1,tl,_)),Ref.Ref(_,Ref.Ind (isind2,i,lno2))->
1003 if isind1 <> isind2 || lno1 <> lno2 then error ();
1004 let _,_,arity,_ = List.nth tl i in arity
1005 | (_,_,_,_,C.Inductive (_,lno1,tl,_)), Ref.Ref (_,Ref.Con (i,j,lno2)) ->
1006 if lno1 <> lno2 then error ();
1007 let _,_,_,cl = List.nth tl i in
1008 let _,_,arity = List.nth cl (j-1) in
1010 | (_,_,_,_,C.Fixpoint (false,fl,_)), Ref.Ref (_,Ref.CoFix i) ->
1011 let _,_,_,arity,_ = List.nth fl i in
1013 | (_,h1,_,_,C.Fixpoint (true,fl,_)), Ref.Ref (_,Ref.Fix (i,recno2,h2)) ->
1014 let _,_,recno1,arity,_ = List.nth fl i in
1015 if h1 <> h2 || recno1 <> recno2 then error ();
1017 | (_,_,_,_,C.Constant (_,_,_,ty,_)), Ref.Ref (_,Ref.Decl) -> ty
1018 | (_,h1,_,_,C.Constant (_,_,_,ty,_)), Ref.Ref (_,Ref.Def h2) ->
1019 if h1 <> h2 then error ();
1021 | _ -> raise (AssertFailure (lazy "type_of_constant: environment/reference"))
1024 let typecheck_context ~metasenv ~subst context =
1030 _,C.Decl t -> ignore (typeof ~metasenv ~subst:[] context t)
1031 | name,C.Def (te,ty) ->
1032 ignore (typeof ~metasenv ~subst:[] context ty);
1033 let ty' = typeof ~metasenv ~subst:[] context te in
1034 if not (R.are_convertible ~subst context ty' ty) then
1035 raise (AssertFailure (lazy (Printf.sprintf (
1036 "the type of the definiens for %s in the context is not "^^
1037 "convertible with the declared one.\n"^^
1038 "inferred type:\n%s\nexpected type:\n%s")
1039 name (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 (* height is not checked since it is only used to implement an optimization *)
1086 typecheck_metasenv metasenv;
1087 typecheck_subst ~metasenv subst;
1089 | C.Constant (relevance,_,Some te,ty,_) ->
1090 let _ = typeof ~subst ~metasenv [] ty in
1091 let ty_te = typeof ~subst ~metasenv [] te in
1092 if not (R.are_convertible ~subst [] ty_te ty) then
1093 raise (TypeCheckerFailure (lazy (Printf.sprintf (
1094 "the type of the body is not convertible with the declared one.\n"^^
1095 "inferred type:\n%s\nexpected type:\n%s")
1096 (PP.ppterm ~subst ~metasenv ~context:[] ty_te)
1097 (PP.ppterm ~subst ~metasenv ~context:[] ty))))
1098 | C.Constant (relevance,_,None,ty,_) ->
1099 ignore (typeof ~subst ~metasenv [] ty)
1100 | C.Inductive (_, leftno, tyl, _) ->
1101 check_mutual_inductive_defs uri ~metasenv ~subst leftno tyl
1102 | C.Fixpoint (inductive,fl,_) ->
1105 (fun (types,kl) (relevance,name,k,ty,_) ->
1106 let _ = typeof ~subst ~metasenv [] ty in
1107 ((name,C.Decl ty)::types, k::kl)
1110 let len = List.length types in
1112 List.split (List.map2
1113 (fun (_,_,_,_,bo) rno ->
1114 let dbo = debruijn uri len [] bo in
1118 List.iter2 (fun (_,_,x,ty,_) bo ->
1119 let ty_bo = typeof ~subst ~metasenv types bo in
1120 if not (R.are_convertible ~subst types ty_bo ty)
1121 then raise (TypeCheckerFailure (lazy ("(Co)Fix: ill-typed bodies")))
1123 if inductive then begin
1124 let m, context = eat_lambdas ~subst ~metasenv types (x + 1) bo in
1127 match List.hd context with _,C.Decl t -> t | _ -> assert false
1129 match R.whd ~subst (List.tl context) he with
1130 | C.Const (Ref.Ref (uri,Ref.Ind _) as ref)
1131 | C.Appl (C.Const (Ref.Ref (uri,Ref.Ind _) as ref) :: _) ->
1132 let _,_,itl,_,_ = E.get_checked_indtys ref in
1133 uri, List.length itl
1136 (* guarded by destructors conditions D{f,k,x,M} *)
1137 let rec enum_from k =
1138 function [] -> [] | v::tl -> (k,v)::enum_from (k+1) tl
1140 guarded_by_destructors r_uri r_len
1141 ~subst ~metasenv context (enum_from (x+2) kl) m
1143 match returns_a_coinductive ~subst [] ty with
1145 raise (TypeCheckerFailure
1146 (lazy "CoFix: does not return a coinductive type"))
1147 | Some (r_uri, r_len) ->
1148 (* guarded by constructors conditions C{f,M} *)
1150 (guarded_by_constructors ~subst ~metasenv types bo r_uri r_len len)
1152 raise (TypeCheckerFailure
1153 (lazy "CoFix: not guarded by constructors"))
1159 let trust = ref (fun _ -> false);;
1160 let set_trust f = trust := f
1161 let trust_obj obj = !trust obj
1164 (* web interface stuff *)
1167 ref (function (`Start_type_checking _|`Type_checking_completed _|`Type_checking_interrupted _|`Type_checking_failed _|`Trust_obj _) -> ())
1170 let set_logger f = logger := f;;
1172 let typecheck_obj obj =
1173 let u,_,_,_,_ = obj in
1175 !logger (`Start_type_checking u);
1177 !logger (`Type_checking_completed u)
1180 !logger (`Type_checking_interrupted u);
1183 !logger (`Type_checking_failed u);
1189 if trust_obj obj then
1190 let u,_,_,_,_ = obj in
1191 !logger (`Trust_obj u)