The Y Combinator explained in a runnable Scheme file
;;; The Y Combinator explained in scheme.
;;; with credits to:
;;; https://mvanier.livejournal.com/2897.html
;;; Status: WIP
(define fibonacci
(lambda (n)
(cond ((= n 0) 0)
((= n 1) 1)
(else (+ (fibonacci (- n 1)) (fibonacci (- n 2)))))))
(define almost-fibonacci
(lambda (f)
(lambda (n)
(cond ((= n 0) 0)
((= n 1) 1)
(else (+ (f (- n 1)) (f (- n 2))))))))
;; Recursive definition of factorial.
(define factorial
(lambda (n)
(if (= n 0)
1
(* n (factorial (- n 1))))))
;; But, imagine we cannot recu...
Read more at gist.github.com
© News Score score the news, sort the news, rewrite the headlines