/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

danilafe.com
| | backdrifting.net
1.5 parsecs away

Travel
| | Lambda Calculus: A gentle introduction and broader context
| | azdavis.net
1.6 parsecs away

Travel
| | Various varieties of function in programming languages.
| | afnan.io
1.1 parsecs away

Travel
| | 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.
| | text.marvinborner.de
5.8 parsecs away

Travel
| 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).