-let rec check_type sorts metasenv context = function
- | C.MutInd (uri, tyno, _) as t ->
- let lpsno, tys = get_inductive_def uri in
- let _, inductive, arity, _ = List.nth tys tyno in
- let _, psno = split [] arity in
- let not_relation = (lpsno = psno) in
- let not_recursive = is_not_recursive uri tyno tys in
- let ty_ty, _ = TC.type_of_aux' metasenv context t Un.empty_ugraph in
- let sort = match split context ty_ty with
- | C.Sort sort ::_ , _ -> CicPp.ppsort sort
- | C.Meta _ :: _, _ -> CicPp.ppsort (C.Type (Un.fresh ()))
- | _ -> assert false
- in
- let right_sort = List.mem sort sorts in
- if not_relation && inductive && not_recursive && right_sort then
- (HLog.warn (Printf.sprintf "Decomposing %s %u %b %u %u %b" (UriManager.string_of_uri uri) (succ tyno) inductive lpsno psno not_recursive);
- Ind)
- else Other
-(* | C.Const (uri, _) as t ->
- if List.mem (uri, None) types then Con (PET.const_lazy_term t) else Other
-*) | C.Appl (hd :: tl) -> check_type sorts metasenv context hd
- | _ -> Other
+let rec check_type sorts metasenv context t =
+ match R.whd ~delta:true context t with
+ | C.MutInd (uri, tyno, _) as t ->
+ let lpsno, tys = get_inductive_def uri in
+ let _, inductive, arity, _ = List.nth tys tyno in
+ let _, psno = split [] arity in
+ let not_relation = (lpsno = psno) in
+ let not_recursive = is_not_recursive uri tyno tys in
+ let ty_ty, _ = TC.type_of_aux' metasenv context t Un.empty_ugraph in
+ let sort = match split context ty_ty with
+ | C.Sort sort ::_ , _ -> CicPp.ppsort sort
+ | C.Meta _ :: _, _ -> CicPp.ppsort (C.Type (Un.fresh ()))
+ | _ -> assert false
+ in
+ let right_sort = List.mem sort sorts in
+ if not_relation && inductive && not_recursive && right_sort then
+ begin
+ HLog.warn (Printf.sprintf "Decomposing %s %u" (UriManager.string_of_uri uri) (succ tyno));
+ true
+ end
+ else false
+ | C.Appl (hd :: tl) -> check_type sorts metasenv context hd
+ | _ -> false