Get the latest tech news
The Y Combinator explained in a runnable Scheme file
The Y Combinator explained in a runnable Scheme file - yplay.scm
In fact, this might;; work as a generator or as a definition of a;; factorial list builder in a lazy language such;; as Haskell. ;; The reason that the recrusive definition won't work,;; even in scheme which does support recursion is due to;; the order of evaluation. ;; This won't work yet:(definenot-quite-part-factorial (lambda (self n) (if (= n 0)1 (* n (self (- n 1))))));; Note that this not-quite-part-factorial is not the;; same as the almost-factorial I described previously.
Or read this on Hacker News
