Explore >> Select a destination
|
You are here 
|
julesh.com | ||
| | | | |
tomcircle.wordpress.com
|
|
| | | | | Lens = {get, set} w = whole tuple, p = a field get :: w -> p set :: w -> p -> w Example: take a pair (tuple) get1 (x, y) = x get1 :: (a, b) -> a set1 (x, y) x' = (x',y) set1 :: (a, b) -> a -> (a,b) Polymorphic... | |
| | | | |
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? | |
| | | | |
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... | |
| | | | |
johnbender.us
|
|
| | | Writings on computer stuff. | ||
