I know what I’m going to get for christmas

I believe I have found a truly marvelous implementation of FRP which this blog post is too short to contain.
Fortunately this is the internet, so it all fits in these three words.
It’s a very, very rough sketch. A plan for an implementation, with many questionable data structures. However I believe it to be [...]

FRP Rant

FRP is eating my life away!
Here’s the thing. I love FRP. I love the concept, so much so that I am having a very hard time writing anything without it. I want to make games, servers, UI libraries, with it. I want to make things! But I am stuck in [...]

data-memocombinators

Well, it’s not perfect, but it is filling a hole that has been mostly absent for far too long: I just uploaded the data-memocombinators library to hackage. The idea is to abstract away the manual memoization everybody keeps doing and pack them away in tidy little combinators.
For those out of loop of [...]

Laziness and the monad laws

Recently on haskell-cafe, the rather trivial module OneTuple was announced. I looked over the source and saw something that bugged me.

data OneTuple a = OneTuple { only :: a }

instance Functor OneTuple where
fmap f (OneTuple x) = OneTuple (f x)

I never write functor instances this way. This is too strict; I [...]