/explore
|
You are here 
|
jao.io | ||
| | | | |
sookocheff.com
|
|
| | | | | In a purely functional language - like lambda calculus - programs are expressed as nested function calls. Repetition in such an environment requires that nesting of function calls continues until some condition is met. During the repetition, each function passes its result to the next function in the nested chain and this repetition is completed when a test for some condition passes. The repetitive behaviour I've just described is recursion: | |
| | | | |
github.com
|
|
| | | | | Playing around with different Y Combinator implementations - calincru/Y-Combinator | |
| | | | |
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. | |
| | | | |
longnow.org
|
|
| | | Launched by Stewart Brand in 02003, Long Now Talks has invited more than 400 leading thinkers to share their civilization-scale ideas. | ||
