/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

web.cecs.pdx.edu
| | perfdynamics.blogspot.com
2.0 parsecs away

Travel
| | Functional equation question seen on Twitter : This is my general solution, computed in Mathematica: a functional programming language. S...
| | cukic.co
1.8 parsecs away

Travel
| | Posts that don't belong to any other category
| | dozheiny.net
1.4 parsecs away

Travel
| | [AI summary] A review of the technical book 'Grokking Functional Programming' praising its clear explanations of functional programming concepts and practical examples.
| | abhinavomprakash.com
16.8 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).