/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

 matthew.brecknell.net
Difference lists - Matthew Brecknell
| | mjoldfield.com
Martin's Atelier: Monoids in Haskell
2.1 parsecs away

Travel
| |
| | eli.thegreenplace.net
Right and left folds, primitive recursion patterns in Python and Haskell - Eli Bendersky's website
2.2 parsecs away

Travel
| |
| | danilafe.com
Generalizing Folds in Haskell
2.1 parsecs away

Travel
| | [AI summary] The blog post explains how to generalize Haskell's foldr function to any recursive data type using the concept of base functors and catamorphisms.
| | lucatrevisan.wordpress.com
The spectrum of the infinite tree | in theory
33.4 parsecs away

Travel
| The spectral norm of the infinite $latex {d}&fg=000000$-regular tree is $latex {2 \sqrt {d-1}}&fg=000000$. We will see what this means and how to prove it. When talking about the expansion of random graphs, abobut the construction of Ramanujan expanders, as well as about sparsifiers, community detection, and several other problems, the number $latex {2 \sqrt{d-1}}&fg=000000$...