|
You are here |
backdrifting.net | ||
| | | | |
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. | |
| | | | |
jacksongl.github.io
|
|
| | | | | online lambda calculus interpreter | |
| | | | |
deniskyashif.com
|
|
| | | | | How to define a recursive function in a language which doesn't support recursion using the Y combinator. | |
| | | | |
maryrosecook.com
|
|
| | | Many functional programming articles teach abstract functional techniques. That is, composition, pipelining, higher order functions. This one is different. I... | ||