Tag Archives: infinite recursion

QuickCheck rocks my socks

Over the past few days I’ve been hacking on a Data.List.Split module, to be used when you just want to quickly split up a list without going to the trouble of using a real parsing or regular expression library — … Continue reading

Posted in haskell, projects | Tagged , | 2 Comments