[racket] Y combinator

Two hours ago, Matthias Felleisen wrote:
> 
> 2. when you have an expression e and you know it will evaluate to a

Missing at this point: "unary" (which leads to some nice homework to
understand it better).

>    function if the evaluation terminates but it may not terminate,
>    you can write (lambda (x) (e x)) to make sure that it is a
>    function NOW. That way you can pass this quasi-e to another
>    function and it can make the decision to evaluate it or not.

-- 
          ((lambda (x) (x x)) (lambda (x) (x x)))          Eli Barzilay:
                    http://barzilay.org/                   Maze is Life!