![]() ![]() ![]() | Wishful thinking - the goal of our work: Generating a recursive factorial function from an almost recursive factorial function. | Lecture 2 - slide 11 : 35 Program 1 |
(let ((recursive-factorial (Y (lambda (???) (lambda (n) (if (= n 0) 1 (* n (??? (- n 1))))))))) (recursive-factorial 5)) ; ??? is just a name. But what is Y?