Explore >> Select a destination
|
You are here 
|
blog.klipse.tech | ||
| | | | |
afnan.io
|
|
| | | | | [AI summary] The author explains the basics of lambda calculus, a theoretical model of computation invented by Alonzo Church that serves as the foundation for functional programming languages. | |
| | | | |
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). | |
| | | | |
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: | |
| | | | |
aartaka.me
|
|
| | | Lambda Calculus is a fascinating idea, but it's not immediately obvious. In this post, I'm trying to understand and explain the basic terms used in Lambda Calculus. | ||
