/explore
|
You are here 
|
blog.moertel.com | ||
| | | | |
abhinavomprakash.com
|
|
| | | | | Defining recursion in terms of itself is an old joke among programmers. Despite the fact that it frustrates a lot of new-comers, we don't change it. I like to define recursion as "Iteration for the cool kids". I don't mean this in a snobbish, let-us-exclude-the-for-loopers kinda way, but rather in a tone of appreciation. Recursion is an elegant way of doing things. Recursive alogrithms are concise, have less noise and have immutability baked in (always a plus). | |
| | | | |
paulbutler.org
|
|
| | | | | [AI summary] A tutorial on implementing a generic tail recursion decorator in Python to overcome the language's recursion depth limitations, inspired by Scheme. | |
| | | | |
chrispenner.ca
|
|
| | | | | The Personal blog and musings of Chris Penner, a designer, developer and future opsimath. | |
| | | | |
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). | ||
