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/.
26 exception Impossible of int;;
27 exception NotWellTyped of string;;
28 exception WrongUriToConstant of string;;
29 exception WrongUriToVariable of string;;
30 exception WrongUriToMutualInductiveDefinitions of string;;
31 exception ListTooShort;;
32 exception RelToHiddenHypothesis;;
34 let syntactic_equality_add_time = ref 0.0;;
35 let type_of_aux'_add_time = ref 0.0;;
36 let number_new_type_of_aux'_double_work = ref 0;;
37 let number_new_type_of_aux' = ref 0;;
38 let number_new_type_of_aux'_prop = ref 0;;
40 let double_work = ref 0;;
42 let xxx_type_of_aux' m c t =
43 let t1 = Sys.time () in
44 let res,_ = CicTypeChecker.type_of_aux' m c t CicUniv.empty_ugraph in
45 let t2 = Sys.time () in
46 type_of_aux'_add_time := !type_of_aux'_add_time +. t2 -. t1 ;
50 type types = {synthesized : Cic.term ; expected : Cic.term option};;
52 (* does_not_occur n te *)
53 (* returns [true] if [Rel n] does not occur in [te] *)
54 let rec does_not_occur n =
57 C.Rel m when m = n -> false
61 | C.Implicit _ -> true
63 does_not_occur n te && does_not_occur n ty
64 | C.Prod (name,so,dest) ->
65 does_not_occur n so &&
66 does_not_occur (n + 1) dest
67 | C.Lambda (name,so,dest) ->
68 does_not_occur n so &&
69 does_not_occur (n + 1) dest
70 | C.LetIn (name,so,dest) ->
71 does_not_occur n so &&
72 does_not_occur (n + 1) dest
74 List.fold_right (fun x i -> i && does_not_occur n x) l true
75 | C.Var (_,exp_named_subst)
76 | C.Const (_,exp_named_subst)
77 | C.MutInd (_,_,exp_named_subst)
78 | C.MutConstruct (_,_,_,exp_named_subst) ->
79 List.fold_right (fun (_,x) i -> i && does_not_occur n x)
81 | C.MutCase (_,_,out,te,pl) ->
82 does_not_occur n out && does_not_occur n te &&
83 List.fold_right (fun x i -> i && does_not_occur n x) pl true
85 let len = List.length fl in
86 let n_plus_len = n + len in
88 List.map (fun (n,_,ty,_) -> Some (C.Name n,(Cic.Decl ty))) fl
92 i && does_not_occur n ty &&
93 does_not_occur n_plus_len bo
96 let len = List.length fl in
97 let n_plus_len = n + len in
99 List.map (fun (n,ty,_) -> Some (C.Name n,(Cic.Decl ty))) fl
103 i && does_not_occur n ty &&
104 does_not_occur n_plus_len bo
108 let rec beta_reduce =
109 let module S = CicSubstitution in
110 let module C = Cic in
113 | C.Var (uri,exp_named_subst) ->
114 let exp_named_subst' =
115 List.map (function (i,t) -> i, beta_reduce t) exp_named_subst
117 C.Var (uri,exp_named_subst)
121 (function None -> None | Some t -> Some (beta_reduce t)) l
124 | C.Implicit _ -> assert false
126 C.Cast (beta_reduce te, beta_reduce ty)
128 C.Prod (n, beta_reduce s, beta_reduce t)
129 | C.Lambda (n,s,t) ->
130 C.Lambda (n, beta_reduce s, beta_reduce t)
132 C.LetIn (n, beta_reduce s, beta_reduce t)
133 | C.Appl ((C.Lambda (name,s,t))::he::tl) ->
134 let he' = S.subst he t in
139 C.Appl l -> beta_reduce (C.Appl (l@tl))
140 | _ -> beta_reduce (C.Appl (he'::tl)))
142 C.Appl (List.map beta_reduce l)
143 | C.Const (uri,exp_named_subst) ->
144 let exp_named_subst' =
145 List.map (function (i,t) -> i, beta_reduce t) exp_named_subst
147 C.Const (uri,exp_named_subst')
148 | C.MutInd (uri,i,exp_named_subst) ->
149 let exp_named_subst' =
150 List.map (function (i,t) -> i, beta_reduce t) exp_named_subst
152 C.MutInd (uri,i,exp_named_subst')
153 | C.MutConstruct (uri,i,j,exp_named_subst) ->
154 let exp_named_subst' =
155 List.map (function (i,t) -> i, beta_reduce t) exp_named_subst
157 C.MutConstruct (uri,i,j,exp_named_subst')
158 | C.MutCase (sp,i,outt,t,pl) ->
159 C.MutCase (sp,i,beta_reduce outt,beta_reduce t,
160 List.map beta_reduce pl)
164 (function (name,i,ty,bo) ->
165 name,i,beta_reduce ty,beta_reduce bo
172 (function (name,ty,bo) ->
173 name,beta_reduce ty,beta_reduce bo
179 (* syntactic_equality up to the *)
180 (* distinction between fake dependent products *)
181 (* and non-dependent products, alfa-conversion *)
182 (*CSC: must alfa-conversion be considered or not? *)
183 let syntactic_equality t t' =
184 let module C = Cic in
185 let rec syntactic_equality t t' =
189 C.Var (uri,exp_named_subst), C.Var (uri',exp_named_subst') ->
190 UriManager.eq uri uri' &&
191 syntactic_equality_exp_named_subst exp_named_subst exp_named_subst'
192 | C.Cast (te,ty), C.Cast (te',ty') ->
193 syntactic_equality te te' &&
194 syntactic_equality ty ty'
195 | C.Prod (_,s,t), C.Prod (_,s',t') ->
196 syntactic_equality s s' &&
197 syntactic_equality t t'
198 | C.Lambda (_,s,t), C.Lambda (_,s',t') ->
199 syntactic_equality s s' &&
200 syntactic_equality t t'
201 | C.LetIn (_,s,t), C.LetIn(_,s',t') ->
202 syntactic_equality s s' &&
203 syntactic_equality t t'
204 | C.Appl l, C.Appl l' ->
205 List.fold_left2 (fun b t1 t2 -> b && syntactic_equality t1 t2) true l l'
206 | C.Const (uri,exp_named_subst), C.Const (uri',exp_named_subst') ->
207 UriManager.eq uri uri' &&
208 syntactic_equality_exp_named_subst exp_named_subst exp_named_subst'
209 | C.MutInd (uri,i,exp_named_subst), C.MutInd (uri',i',exp_named_subst') ->
210 UriManager.eq uri uri' && i = i' &&
211 syntactic_equality_exp_named_subst exp_named_subst exp_named_subst'
212 | C.MutConstruct (uri,i,j,exp_named_subst),
213 C.MutConstruct (uri',i',j',exp_named_subst') ->
214 UriManager.eq uri uri' && i = i' && j = j' &&
215 syntactic_equality_exp_named_subst exp_named_subst exp_named_subst'
216 | C.MutCase (sp,i,outt,t,pl), C.MutCase (sp',i',outt',t',pl') ->
217 UriManager.eq sp sp' && i = i' &&
218 syntactic_equality outt outt' &&
219 syntactic_equality t t' &&
221 (fun b t1 t2 -> b && syntactic_equality t1 t2) true pl pl'
222 | C.Fix (i,fl), C.Fix (i',fl') ->
225 (fun b (_,i,ty,bo) (_,i',ty',bo') ->
227 syntactic_equality ty ty' &&
228 syntactic_equality bo bo') true fl fl'
229 | C.CoFix (i,fl), C.CoFix (i',fl') ->
232 (fun b (_,ty,bo) (_,ty',bo') ->
234 syntactic_equality ty ty' &&
235 syntactic_equality bo bo') true fl fl'
236 | _, _ -> false (* we already know that t != t' *)
237 and syntactic_equality_exp_named_subst exp_named_subst1 exp_named_subst2 =
239 (fun b (_,t1) (_,t2) -> b && syntactic_equality t1 t2) true
240 exp_named_subst1 exp_named_subst2
243 syntactic_equality t t'
248 let xxx_syntactic_equality t t' =
249 let t1 = Sys.time () in
250 let res = syntactic_equality t t' in
251 let t2 = Sys.time () in
252 syntactic_equality_add_time := !syntactic_equality_add_time +. t2 -. t1 ;
260 | (he::tl, n) -> let (l1,l2) = split tl (n-1) in (he::l1,l2)
261 | (_,_) -> raise ListTooShort
264 let type_of_constant uri =
265 let module C = Cic in
266 let module R = CicReduction in
267 let module U = UriManager in
269 match CicEnvironment.is_type_checked CicUniv.empty_ugraph uri with
270 CicEnvironment.CheckedObj (cobj,_) -> cobj
271 | CicEnvironment.UncheckedObj uobj ->
272 raise (NotWellTyped "Reference to an unchecked constant")
275 C.Constant (_,_,ty,_,_) -> ty
276 | C.CurrentProof (_,_,_,ty,_,_) -> ty
277 | _ -> raise (WrongUriToConstant (U.string_of_uri uri))
280 let type_of_variable uri =
281 let module C = Cic in
282 let module R = CicReduction in
283 let module U = UriManager in
284 match CicEnvironment.is_type_checked CicUniv.empty_ugraph uri with
285 CicEnvironment.CheckedObj ((C.Variable (_,_,ty,_,_)),_) -> ty
286 | CicEnvironment.UncheckedObj (C.Variable _) ->
287 raise (NotWellTyped "Reference to an unchecked variable")
288 | _ -> raise (WrongUriToVariable (UriManager.string_of_uri uri))
291 let type_of_mutual_inductive_defs uri i =
292 let module C = Cic in
293 let module R = CicReduction in
294 let module U = UriManager in
296 match CicEnvironment.is_type_checked CicUniv.empty_ugraph uri with
297 CicEnvironment.CheckedObj (cobj,_) -> cobj
298 | CicEnvironment.UncheckedObj uobj ->
299 raise (NotWellTyped "Reference to an unchecked inductive type")
302 C.InductiveDefinition (dl,_,_,_) ->
303 let (_,_,arity,_) = List.nth dl i in
305 | _ -> raise (WrongUriToMutualInductiveDefinitions (U.string_of_uri uri))
308 let type_of_mutual_inductive_constr uri i j =
309 let module C = Cic in
310 let module R = CicReduction in
311 let module U = UriManager in
313 match CicEnvironment.is_type_checked CicUniv.empty_ugraph uri with
314 CicEnvironment.CheckedObj (cobj,_) -> cobj
315 | CicEnvironment.UncheckedObj uobj ->
316 raise (NotWellTyped "Reference to an unchecked constructor")
319 C.InductiveDefinition (dl,_,_,_) ->
320 let (_,_,_,cl) = List.nth dl i in
321 let (_,ty) = List.nth cl (j-1) in
323 | _ -> raise (WrongUriToMutualInductiveDefinitions (U.string_of_uri uri))
331 let hash = Hashtbl.hash
335 (* type_of_aux' is just another name (with a different scope) for type_of_aux *)
336 let rec type_of_aux' subterms_to_types metasenv context t expectedty =
337 (* Coscoy's double type-inference algorithm *)
338 (* It computes the inner-types of every subterm of [t], *)
339 (* even when they are not needed to compute the types *)
340 (* of other terms. *)
341 let rec type_of_aux context t expectedty =
342 let module C = Cic in
343 let module R = CicReduction in
344 let module S = CicSubstitution in
345 let module U = UriManager in
350 match List.nth context (n - 1) with
351 Some (_,C.Decl t) -> S.lift n t
352 | Some (_,C.Def (_,Some ty)) -> S.lift n ty
353 | Some (_,C.Def (bo,None)) ->
354 type_of_aux context (S.lift n bo) expectedty
355 | None -> raise RelToHiddenHypothesis
357 _ -> raise (NotWellTyped "Not a close term")
359 | C.Var (uri,exp_named_subst) ->
360 visit_exp_named_subst context uri exp_named_subst ;
361 CicSubstitution.subst_vars exp_named_subst (type_of_variable uri)
363 (* Let's visit all the subterms that will not be visited later *)
364 let (_,canonical_context,_) = CicUtil.lookup_meta n metasenv in
365 let lifted_canonical_context =
369 | (Some (n,C.Decl t))::tl ->
370 (Some (n,C.Decl (S.subst_meta l (S.lift i t))))::(aux (i+1) tl)
371 | (Some (n,C.Def (t,None)))::tl ->
372 (Some (n,C.Def ((S.subst_meta l (S.lift i t)),None)))::
374 | None::tl -> None::(aux (i+1) tl)
375 | (Some (_,C.Def (_,Some _)))::_ -> assert false
377 aux 1 canonical_context
384 | Some t,Some (_,C.Def (ct,_)) ->
387 (xxx_type_of_aux' metasenv context ct)
389 (* Maybe I am a bit too paranoid, because *)
390 (* if the term is well-typed than t and ct *)
391 (* are convertible. Nevertheless, I compute *)
392 (* the expected type. *)
393 ignore (type_of_aux context t (Some expected_type))
394 | Some t,Some (_,C.Decl ct) ->
395 ignore (type_of_aux context t (Some ct))
396 | _,_ -> assert false (* the term is not well typed!!! *)
397 ) l lifted_canonical_context
399 let (_,canonical_context,ty) = CicUtil.lookup_meta n metasenv in
400 (* Checks suppressed *)
401 CicSubstitution.subst_meta l ty
402 | C.Sort (C.Type t) -> (* TASSI: CONSTRAINT *)
403 C.Sort (C.Type (CicUniv.fresh()))
404 | C.Sort _ -> C.Sort (C.Type (CicUniv.fresh())) (* TASSI: CONSTRAINT *)
405 | C.Implicit _ -> raise (Impossible 21)
407 (* Let's visit all the subterms that will not be visited later *)
408 let _ = type_of_aux context te (Some (beta_reduce ty)) in
409 let _ = type_of_aux context ty None in
410 (* Checks suppressed *)
412 | C.Prod (name,s,t) ->
413 let sort1 = type_of_aux context s None
414 and sort2 = type_of_aux ((Some (name,(C.Decl s)))::context) t None in
415 sort_of_prod context (name,s) (sort1,sort2)
416 | C.Lambda (n,s,t) ->
417 (* Let's visit all the subterms that will not be visited later *)
418 let _ = type_of_aux context s None in
419 let expected_target_type =
420 match expectedty with
422 | Some expectedty' ->
424 match R.whd context expectedty' with
425 C.Prod (_,_,expected_target_type) ->
426 beta_reduce expected_target_type
432 type_of_aux ((Some (n,(C.Decl s)))::context) t expected_target_type
434 (* Checks suppressed *)
437 (*CSC: What are the right expected types for the source and *)
438 (*CSC: target of a LetIn? None used. *)
439 (* Let's visit all the subterms that will not be visited later *)
440 let ty = type_of_aux context s None in
442 (* Checks suppressed *)
443 type_of_aux ((Some (n,(C.Def (s,Some ty))))::context) t None
444 in (* CicSubstitution.subst s t_typ *)
445 if does_not_occur 1 t_typ then
446 (* since [Rel 1] does not occur in typ, substituting any term *)
447 (* in place of [Rel 1] is equivalent to delifting once *)
448 CicSubstitution.subst (C.Implicit None) t_typ
451 | C.Appl (he::tl) when List.length tl > 0 ->
453 let expected_hetype =
454 (* Inefficient, the head is computed twice. But I know *)
455 (* of no other solution. *)
457 (R.whd context (xxx_type_of_aux' metasenv context he)))
459 let hetype = type_of_aux context he (Some expected_hetype) in
460 let tlbody_and_type =
464 | C.Prod (n,s,t),he::tl ->
465 (he, type_of_aux context he (Some (beta_reduce s)))::
466 (aux (R.whd context (S.subst he t), tl))
469 aux (expected_hetype, tl) *)
470 let hetype = R.whd context (type_of_aux context he None) in
471 let tlbody_and_type =
475 | C.Prod (n,s,t),he::tl ->
476 (he, type_of_aux context he (Some (beta_reduce s)))::
477 (aux (R.whd context (S.subst he t), tl))
482 eat_prods context hetype tlbody_and_type
483 | C.Appl _ -> raise (NotWellTyped "Appl: no arguments")
484 | C.Const (uri,exp_named_subst) ->
485 visit_exp_named_subst context uri exp_named_subst ;
486 CicSubstitution.subst_vars exp_named_subst (type_of_constant uri)
487 | C.MutInd (uri,i,exp_named_subst) ->
488 visit_exp_named_subst context uri exp_named_subst ;
489 CicSubstitution.subst_vars exp_named_subst
490 (type_of_mutual_inductive_defs uri i)
491 | C.MutConstruct (uri,i,j,exp_named_subst) ->
492 visit_exp_named_subst context uri exp_named_subst ;
493 CicSubstitution.subst_vars exp_named_subst
494 (type_of_mutual_inductive_constr uri i j)
495 | C.MutCase (uri,i,outtype,term,pl) ->
496 let outsort = type_of_aux context outtype None in
497 let (need_dummy, k) =
498 let rec guess_args context t =
499 match CicReduction.whd context t with
500 C.Sort _ -> (true, 0)
501 | C.Prod (name, s, t) ->
502 let (b, n) = guess_args ((Some (name,(C.Decl s)))::context) t in
504 (* last prod before sort *)
505 match CicReduction.whd context s with
506 C.MutInd (uri',i',_) when U.eq uri' uri && i' = i ->
508 | C.Appl ((C.MutInd (uri',i',_)) :: _)
509 when U.eq uri' uri && i' = i -> (false, 1)
513 | _ -> raise (NotWellTyped "MutCase: outtype ill-formed")
515 let (b, k) = guess_args context outsort in
516 if not b then (b, k - 1) else (b, k)
518 let (parameters, arguments,exp_named_subst) =
520 xxx_type_of_aux' metasenv context term
523 R.whd context (type_of_aux context term
524 (Some (beta_reduce type_of_term)))
526 (*CSC manca il caso dei CAST *)
527 C.MutInd (uri',i',exp_named_subst) ->
528 (* Checks suppressed *)
529 [],[],exp_named_subst
530 | C.Appl (C.MutInd (uri',i',exp_named_subst) :: tl) ->
532 split tl (List.length tl - k)
533 in params,args,exp_named_subst
535 raise (NotWellTyped "MutCase: the term is not an inductive one")
537 (* Checks suppressed *)
538 (* Let's visit all the subterms that will not be visited later *)
542 CicEnvironment.get_cooked_obj CicUniv.empty_ugraph uri
543 with Not_found -> assert false
546 C.InductiveDefinition (tl,_,parsno,_) ->
547 let (_,_,_,cl) = List.nth tl i in (cl,parsno)
549 raise (WrongUriToMutualInductiveDefinitions (U.string_of_uri uri))
555 if parameters = [] then
556 (C.MutConstruct (uri,i,j,exp_named_subst))
558 (C.Appl (C.MutConstruct (uri,i,j,exp_named_subst)::parameters))
561 type_of_branch context parsno need_dummy outtype cons
562 (xxx_type_of_aux' metasenv context cons)
564 ignore (type_of_aux context p
565 (Some (beta_reduce expectedtype))) ;
567 ) 1 (List.combine pl cl)
569 if not need_dummy then
570 C.Appl ((outtype::arguments)@[term])
571 else if arguments = [] then
574 C.Appl (outtype::arguments)
576 (* Let's visit all the subterms that will not be visited later *)
581 let _ = type_of_aux context ty None in
582 (Some (C.Name n,(C.Decl ty)))
591 beta_reduce (CicSubstitution.lift (List.length fl) ty)
593 ignore (type_of_aux context' bo (Some expectedty))
596 (* Checks suppressed *)
597 let (_,_,ty,_) = List.nth fl i in
600 (* Let's visit all the subterms that will not be visited later *)
605 let _ = type_of_aux context ty None in
606 (Some (C.Name n,(C.Decl ty)))
615 beta_reduce (CicSubstitution.lift (List.length fl) ty)
617 ignore (type_of_aux context' bo (Some expectedty))
620 (* Checks suppressed *)
621 let (_,ty,_) = List.nth fl i in
624 let synthesized' = beta_reduce synthesized in
626 match expectedty with
628 (* No expected type *)
629 {synthesized = synthesized' ; expected = None}, synthesized
630 | Some ty when xxx_syntactic_equality synthesized' ty ->
631 (* The expected type is synthactically equal to *)
632 (* the synthesized type. Let's forget it. *)
633 {synthesized = synthesized' ; expected = None}, synthesized
634 | Some expectedty' ->
635 {synthesized = synthesized' ; expected = Some expectedty'},
638 CicHash.add subterms_to_types t types ;
641 and visit_exp_named_subst context uri exp_named_subst =
645 CicEnvironment.get_cooked_obj CicUniv.empty_ugraph uri
646 with Not_found -> assert false
648 let params = CicUtil.params_of_obj obj in
653 CicEnvironment.get_cooked_obj CicUniv.empty_ugraph uri
654 with Not_found -> assert false
657 Cic.Variable (_,None,ty,_,_) -> uri,ty
658 | _ -> assert false (* the theorem is well-typed *)
661 let rec check uris_and_types subst =
662 match uris_and_types,subst with
664 | (uri,ty)::tytl,(uri',t)::substtl when uri = uri' ->
665 ignore (type_of_aux context t (Some ty)) ;
668 (function uri,t' -> uri,(CicSubstitution.subst_vars [uri',t] t')) tytl
671 | _,_ -> assert false (* the theorem is well-typed *)
673 check uris_and_types exp_named_subst
675 and sort_of_prod context (name,s) (t1, t2) =
676 let module C = Cic in
677 let t1' = CicReduction.whd context t1 in
678 let t2' = CicReduction.whd ((Some (name,C.Decl s))::context) t2 in
679 match (t1', t2') with
680 (C.Sort _, C.Sort s2)
681 when (s2 = C.Prop or s2 = C.Set or s2 = C.CProp) ->
682 (* different from Coq manual!!! *)
684 | (C.Sort (C.Type t1), C.Sort (C.Type t2)) ->
685 C.Sort (C.Type (CicUniv.fresh()))
686 | (C.Sort _,C.Sort (C.Type t1)) ->
687 (* TASSI: CONSRTAINTS: the same in cictypechecker,cicrefine *)
688 C.Sort (C.Type t1) (* c'e' bisogno di un fresh? *)
689 | (C.Meta _, C.Sort _) -> t2'
690 | (C.Meta _, (C.Meta (_,_) as t))
691 | (C.Sort _, (C.Meta (_,_) as t)) when CicUtil.is_closed t ->
696 ("Prod: sort1= " ^ CicPp.ppterm t1' ^ " ; sort2= " ^ CicPp.ppterm t2'))
698 and eat_prods context hetype =
699 (*CSC: siamo sicuri che le are_convertible non lavorino con termini non *)
703 | (hete, hety)::tl ->
704 (match (CicReduction.whd context hetype) with
706 (* Checks suppressed *)
707 eat_prods context (CicSubstitution.subst hete t) tl
708 | _ -> raise (NotWellTyped "Appl: wrong Prod-type")
711 and type_of_branch context argsno need_dummy outtype term constype =
712 let module C = Cic in
713 let module R = CicReduction in
714 match R.whd context constype with
719 C.Appl [outtype ; term]
720 | C.Appl (C.MutInd (_,_,_)::tl) ->
721 let (_,arguments) = split tl argsno
723 if need_dummy && arguments = [] then
726 C.Appl (outtype::arguments@(if need_dummy then [] else [term]))
727 | C.Prod (name,so,de) ->
729 match CicSubstitution.lift 1 term with
730 C.Appl l -> C.Appl (l@[C.Rel 1])
731 | t -> C.Appl [t ; C.Rel 1]
733 C.Prod (C.Anonymous,so,type_of_branch
734 ((Some (name,(C.Decl so)))::context) argsno need_dummy
735 (CicSubstitution.lift 1 outtype) term' de)
736 | _ -> raise (Impossible 20)
739 type_of_aux context t expectedty
742 let double_type_of metasenv context t expectedty =
743 let subterms_to_types = CicHash.create 503 in
744 ignore (type_of_aux' subterms_to_types metasenv context t expectedty) ;