/explore
|
You are here 
|
sookocheff.com | ||
| | | | |
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). |
|
| | | | | ||
| | | | |
blog.klipse.tech
Recursions without names. The y combinator in clojure. Lambda Calculus. |
|
| | | | | ||
| | | | |
jao.io
[AI summary] The author explores the Y combinator and fixed-point combinators in lambda calculus, demonstrating how to implement recursive functions like list-length in Scheme using beta abstraction to manage a strict evaluation strategy. |
|
| | | | | ||
| | | | |
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. |
|
| | | |||
