Explore >> Select a destination
|
You are here 
|
www.oranlooney.com | ||
| | | | |
mvanier.livejournal.com
|
|
| | | | | or: How to Succeed at Recursion Without Really Recursing Tiger got to hunt, Bird got to fly; Lisper got to sit and wonder, (Y (Y Y))? Tiger got to sleep, Bird got to land; Lisper got to tell himself he understand. Kurt Vonnegut, modified by Darius Bacon Introduction... | |
| | | | |
github.com
|
|
| | | | | Playing around with different Y Combinator implementations - calincru/Y-Combinator | |
| | | | |
johnazariah.github.io
|
|
| | | | | The Y-Combinator. How to derive recursion in a purely functional context. | |
| | | | |
nguyenhuythanh.com
|
|
| | | "Y Combinator" is the name of a "meta" startup (one that powers other startups), and also is considered the most beautiful term of Computer Science, or Lambda Calculus. You may encountered this kind of post somewhere else, but I cannot stop doing the same. It blown my mind. Spares the techinal jargons, we should just jump straight into Lisp code. I will try to go step by step in the hope that you will "get" it. | ||
