/explore
|
You are here 
|
blog.klipse.tech | ||
| | | | |
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. |
|
| | | | | ||
| | | | |
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: |
|
| | | | | ||
| | | | |
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). |
|
| | | | | ||
| | | | |
afnan.io
In 1936, Alonzo Church invented a universal model of computation called "lambda calculus." This system expresses computation as reductions on lambda expressions, which are basically just functions and variables. The system is simple but incredibly expressive, and serves as the foundation for programming languages such as Haskell and Idris. The significance of having a universal model of computation is that it provides a way of solving any problem that can be expressed in the system, and changes the problem from "how can I calculate this" to "can I express this properly?" Lambda calculus is also Turing complete, and even more impressively, was invented in the 1930s independently of Turing. |
|
| | | |||
