Explore >> Select a destination
|
You are here 
|
nguyenhuythanh.com | ||
| | | | |
deniskyashif.com
|
|
| | | | | How to define a recursive function in a language which doesn't support recursion using the Y combinator. | |
| | | | |
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. | |
| | | | |
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. | |
| | | | |
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). | ||
