Explore >> Select a destination
|
You are here 
|
sookocheff.com | ||
| | | | |
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. | |
| | | | |
johnazariah.github.io
|
|
| | | | | The Y-Combinator. How to derive recursion in a purely functional context. | |
| | | | |
text.marvinborner.de
|
|
| | | | | This article describes a variadic extension to the default fixed-point combinator namely the Y-combinator. We do this by translating the Scheme code from a paper to bruijn (pure lambda calculus). | |
| | | | |
stackoverflow.blog
|
|
| | | [AI summary] The article discusses Rust's popularity, its features like static typing, memory safety, and performance benefits, while also addressing its challenges and ecosystem. | ||
