Explore >> Select a destination
|
You are here 
|
sookocheff.com | ||
| | | | |
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. | |
| | | | |
johnazariah.github.io
|
|
| | | | | The Y-Combinator. How to derive recursion in a purely functional context. | |
| | | | |
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). | |
| | | | |
nikita-volkov.github.io
|
|
| | | Recently a question by Chris Done on Reddit has spawned yet another debate on the subject of whether Haskell's laziness is actually a good thing. | ||
