/explore
|
You are here 
|
aartaka.me | ||
| | | | |
backdrifting.net
|
|
| | | | | Lambda Calculus: A gentle introduction and broader context | |
| | | | |
deniskyashif.com
|
|
| | | | | How to define a recursive function in a language which doesn't support recursion using the Y combinator. | |
| | | | |
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: | |
| | | | |
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. | ||
