(let rec f = function 0 -> [] | n -> true :: f (n-1) in f j) bos
;;
-(* if n < 0, then splits all prods from an arity, returning a sort *)
-let rec split_prods ~subst context n te =
- match (n, R.whd ~subst context te) with
- | (0, _) -> context,te
- | (n, C.Sort _) when n <= 0 -> context,te
- | (n, C.Prod (name,so,ta)) ->
- split_prods ~subst ((name,(C.Decl so))::context) (n - 1) ta
- | (_, _) -> raise (AssertFailure (lazy "split_prods"))
-;;
-
let debruijn uri number_of_types context =
let rec aux k t =
match t with
let s = typeof ~metasenv ~subst context so in
s = C.Sort C.Prop && aux ((n,(C.Decl so))::context) de
| _ -> true in
- let context',dx = split_prods ~subst [] paramsno c in
+ let context',dx = NCicReduction.split_prods ~subst [] paramsno c in
aux context' dx
and check_mutual_inductive_defs uri ~metasenv ~subst leftno tyl =
ignore
(List.fold_right
(fun (it_relev,_,ty,cl) i ->
- let context,ty_sort = split_prods ~subst [] ~-1 ty in
+ let context,ty_sort = NCicReduction.split_prods ~subst [] ~-1 ty in
let sx_context_ty_rev,_ = HExtlib.split_nth leftno (List.rev context) in
List.iter
(fun (k_relev,_,te) ->
let _,k_relev = HExtlib.split_nth leftno k_relev in
let te = debruijn uri len [] te in
- let context,te = split_prods ~subst tys leftno te in
+ let context,te = NCicReduction.split_prods ~subst tys leftno te in
let _,chopped_context_rev =
HExtlib.split_nth (List.length tys) (List.rev context) in
let sx_context_te_rev,_ =