A set of curated examples meant to show Haskell's expressiveness, wherein we write a sum function many times:
As you may have read in one of my past posts or elsewhere, performance across languages can be complicated, and it's not always as obvious as you'd expect.
I came across the idea to use \(F\)-(co)algebras to encode general constructors and destructors when reading Martin Erwig's paper on synchromorphisms.
The modern theory of continued fractions comes from Christiaan Huygens, a Dutch physicist who invented the pendulum clock. Continued fractions turn out to be an especially elegant way of finding rational approximations of a number; this enabled him to design clocks with small gears that nonetheless provided the desired degree of accuracy.
Inspired by Tufts' gerrymandering school, I decided to take a stab at some of the math on my own. It turned out to be largely programming instead, but that ended up being interesting on its own.
prev