Explore >> Select a destination
|
You are here 
|
julesh.com | ||
| | | | |
kndrck.co
|
|
| | | | | Prelude State monads, introduced to me during the data61 functional programming course was one of my most memorable encounter with a monad. This was mainly because things only started to clicked and made a tiny bit of sense after a couple of weeks of frustration. This article is my attempt to explain the underlying mechanics of the State Monad to try and relief the frustration of whomever who was in my position. | |
| | | | |
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? | |
| | | | |
www.sevangelatos.com
|
|
| | | So, this is an mirror of a post from John Carmack. Recently I learned that his articles on #AltDevBlog are no longer acessible. So, in order to archive them, I am re-posting them here. These articles are definitely good reads and worth to be preserved. Probably everyone reading this has | ||
