In the paper attached to my last post, I proved that any data store is a monad. Then I proved that if the data was a monoid (so it has a zero and addition) then the store is a monoid too. And then I asserted that if the data is a monad, then so is the …
Tag Archives: Storage systems
Distributed storage in Haskell
As a part of my general programme of developing a distributed monadic MapReduce implementation in Haskell (as described here), I have been working slowly on the distributed infrastructure required to do this, using CloudHaskell. I have now succeeded in producing a very general proof-of-concept for distributed storage. This introduces some interesting challenges, as we want …