/explore
|
You are here 
|
mvanier.livejournal.com | ||
| | | | |
johnazariah.github.io
|
|
| | | | | The Y-Combinator. How to derive recursion in a purely functional context. | |
| | | | |
lucasfcosta.com
|
|
| | | | | In this post, we will talk about one of the most beautiful ideas in computer science: the Y-Combinator. And no, I'm not talking about the VC firm in Silicon ... | |
| | | | |
www.oranlooney.com
|
|
| | | | | I recently wrote an article which was ostensibly about the Fibonacci series but was really about optimization techniques. I wanted to follow up on its (extremely moderate) success by going in the exact opposite direction: by writing a Fibonacci function which is as slow as possible. This is not as easy as it sounds: any program can trivially be made slower, but this is boring. How can we make it slow in a fair and interesting way? | |
| | | | |
www.observationalhazard.com
|
|
| | | David Kopec's blog. | ||
