/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

 blog.klipse.tech
Lambda Calculus: The Y combinator in clojure | Yehonathan Sharvit
| | sookocheff.com
Recursive Lambda Functions the Y-Combinator | Kevin Sookocheff
2.2 parsecs away

Travel
| | 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:
| | deniskyashif.com
On Recursive Functions ยท Denis Kyashif's Blog
1.2 parsecs away

Travel
| | How to define a recursive function in a language which doesn't support recursion using the Y combinator.
| | text.marvinborner.de
Variadic Fixed-Point Combinators
2.1 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).
| | afnan.io
Lambda Calculus - afnan.io
5.3 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.