/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 volgarev.me
Tail Recursion And Trampolining In C# - Pavel Volgarev
| | alexn.org
Tail Recursive Functions (in Scala) - Alexandru Nedelcu
2.2 parsecs away

Travel
| |
| | abdulapopoola.com
Understanding Tail Recursion - CodeKraft
1.9 parsecs away

Travel
| | The biggest advantage of using tail calls is that they allow you to do extensive operations without exceeding the call stack. This makes it possible to do a lot of work in constant space without running into out of memory exceptions; this happens because the frame for the currently executing function is re-used by the...
| | abhinavomprakash.com
Recursion is recursion is recursion is... | Abhinav Omprakash
2.0 parsecs away

Travel
| | 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).
| | aartaka.me
Making Sense of Lambda Calculus 0: Abstration, Reduction, Substitution?
20.1 parsecs away

Travel
| 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.