let rec
   fact  = lambda n. if n=0 then 1 else n*fact(n-1),
   map   = lambda f. lambda ls.
           if null ls then nil else (f hd ls)::(map f tl ls),
   succ  = lambda n. n+1,
   ints  = 1::(map succ ints),
   first = lambda n. lambda ls.
           if n<=0 then nil else (hd ls)::(first (n-1) tl ls)
in first 10 (map fact ints)