Explore >> Select a destination
|
You are here 
|
jao.io | ||
| | | | |
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). | |
| | | | |
danilafe.com
|
|
| | | | | [AI summary] The blog post explores lambda calculus, its role in computation, and how Church-encoded integers are used to represent natural numbers through abstraction and function application. | |
| | | | |
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: | |
| | | | |
blog.klipse.tech
|
|
| | | Recursions without names. The y combinator in clojure. Lambda Calculus. | ||
