/explore
|
You are here 
|
blog.sigfpe.com | ||
| | | | |
bartoszmilewski.com
|
|
| | | | | This is part 31 of Categories for Programmers. Previously: Lawvere Theories. See the Table of Contents. There is no good place to end a book on category theory. There's always more to learn. Category theory is a vast subject. At the same time, it's obvious that the same themes, concepts, and patterns keep showing up... | |
| | | | |
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? | |
| | | | |
thebreakfastpost.com
|
|
| | | In a bid to expand my programming brain by learning something about "dependent types", I recently bought the Idris book. (Idris is a pure functional programming language that is mostly known for supporting dependent types. Not knowing what that really meant, and seeing that this recently-published book written by the author of the language was... | ||
