Explore >> Select a destination
|
You are here 
|
johnbender.us | ||
| | | | |
bartoszmilewski.com
|
|
| | | | | Abstract: I derive a free monoidal (applicative) functor as an initial algebra of a higher-order functor using Day convolution. I thought I was done with monoids for a while, after writing my Monoids on Steroids post, but I keep bumping into them. This time I read a paper by Capriotti and Kaposi about Free Applicative... | |
| | | | |
www.jeremykun.com
|
|
| | | | | A lot of people who like functional programming often give the reason that the functional style is simply more elegant than the imperative style. When compelled or inspired to explain (as I did in my old post, How I Learned to Love Functional Programming), they often point to the three "higher-order" functions map, fold, and filter, as providing a unifying framework for writing and reasoning about programs. But how unifying are they, really? | |
| | | | |
cronokirby.com
|
|
| | | | | - Read more: https://cronokirby.com/posts/2020/10/categorical-graphs/ | |
| | | | |
www.jeremykun.com
|
|
| | | Last time we defined and gave some examples of rings. Recapping, a ring is a special kind of group with an additional multiplication operation that "plays nicely" with addition. The important thing to remember is that a ring is intended to remind us arithmetic with integers (though not too much: multiplication in a ring need not be commutative). We proved some basic properties, like zero being unique and negation being well-behaved. | ||
