let rec makefunrec (i,e1,r) = let f1 =newvar() in (match f1 with Vvar(x) -> alfp((Forall([x],f1),[]), i, e1, r, k))
and alfp (ff ,i ,e1 ,r, n) = let tnext = sem e1 (bind(r,i,ff)) in (match tnext with |(Forall(_,Notype),_) -> (Forall([],Notype),[]) |(Forall(_,t),c) -> let t1 = generalize t (Subst c) r in
if abstreq((t1,c),ff) then ff else
(if n = 0 then widening(ff,(t1,c),r) else alfp ((t1,c) ,i,e1 ,r, n-1) )
note that the Ml widening (k=0) would always succeed computing an incorrect type