I'll hijack the thread since I've been meaning to ask about the Y
combinator.
From SICP I've seen that the Y combinator is the function
(define (y f)
((lambda (x) (f (x x)))
(lambda (x) (f (x x)
This makes mathematical sense, since
(y f)
= ((lambda (x) (f (x x))) (lambda (x) (f (x x
The use of the Y combinator (as opposed to the built-in forms of
recursion) seems to be hacking around the ability for Ruby methods to
be redefined more than anything?
Robby
On Sat, Jul 31, 2010 at 8:54 PM, Shriram Krishnamurthi s...@cs.brown.edu
wrote:
...provide a mis-feature that the
2 matches
Mail list logo
