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? | |
| | | | |
thehousecarpenter.wordpress.com
|
|
| | | | | A natural transformation is an operation on a category, or more precisely a family of operations, one for each object in the category, which is preserved by morphisms in the category. Each operation in the family is associated with a specific object $latex A$ in the category, which it is said to be on. The... | |
| | | | |
sphinxsearch.com
|
|
| | | In this short and sweet announcement, we're going to list the bugs that have been fixed in the latest release of the 2.1 series (which is now available here). Take a look. | ||
