[PRL] Type question...

[Bryan Chadwick]

   Quick question.   After thinking about a complex lambda term (really 
just a poor man's recursion),  I don't think it can be hand annotated 
with simple types (if the language was extended to do so).

Is this correct?  Thoughts?

Here's factorial without letrec...

(let ((fact (lambda (num)
                ((lambda (f n) (f f n))
                 (lambda (g m)
                   (if (< m 2) 1
                       (* m (g g (- m 1))))) num))))
   (fact 5))


Thanks,
Bryan.