(* put t under n lambdas, lifting t accordingtly *)
val make_lams : nf -> int -> nf
val lift : int -> nf -> nf
+val free_vars' : nf -> var list
val free_vars : nf -> int list
module ToScott :
sig
val mk_appx : nf -> nf Listx.listx -> nf
val mk_match : nf i_num_var_ -> var -> int -> (int * nf) list ref -> nf list -> nf
val subst : bool -> bool -> int -> nf -> nf -> nf
-val parse' : string list -> nf list * string list
val eta_compare : nf -> nf -> int
val eta_eq : [< nf ] -> [< nf ] -> bool
val eta_subterm : [< nf ] -> [< nf ] -> bool
-val max_arity_tms : int -> [< nf] list -> int
+val max_arity_tms : int -> [< nf] list -> int option
val compute_arities : int -> int -> nf list -> int list
+val minus1 : int -> int