Haskell, Freer monads 

Currently running an NIH'd implementation of final-encoded freer monads in this toy project. I'm not even using extensible effects, but it's still a pretty convenient way of having multiple interpreters without a bunch of typeclass constraints in the signature. Maybe a bit overkill?


I wish IO exceptions in didn't feel so bolted on and unergonomic.


I always say my ideal language is with strict, but one nice thing about laziness is that you can use thunk vectors to get constant time memoization without using IO/ST

A lot of effort in goes toward trying to make a pandas-like column data store, and it always tends to be a bit heavy on the template Haskell and typelevel tricks. I feel emulating Python is probably the wrong way to look at the problem.

The final encoding of freer monads is both faster and more intuitive than the initial encoding. As a ReaderT IO person, I'm convinced final freer is a good alternative for most use cases


Welcome to your niu world ! We are a cute and loving international community O(≧▽≦)O !