1. 14
  1.  

  2. 6

    Only thing I might add to this list is Chris Okasiki’s seminal Purely Functional Data Structures. If you don’t want to buy a dead-tree book, his thesis covers much the same subject.

    I’d open up a pull request but it’s primarily in SML, though there is a small appendix of Haskell code. I still think it’s a must read for serious Haskellers or FP users in general.

    1. 1

      Aren’t the appendices in Haskell in a newer edition of PFDS? Could’ve sworn there was a version that was all Haskell, but I must’ve been mis-remembering.

      1. 2

        In my copy there’s an appendix of Haskell sources, but without much explanation so SML literacy is still somewhat required. Then again, for a Haskell programmer it takes about 30 minutes to learn SML syntax..

        I have no idea about newer versions.. if they have an all Haskell version that’d be perfect!

        1. 1

          I tried to find an all-Haskell version that I thought I remembered but could only mentions of the appendices.

          A rewrite would be gloriously useful for learners but laborious and not well rewarded.

        2. 2

          I just bought a copy and it’s copyrighted in 1998, transferred to digital format in 2003. I don’t think there are newer editions of it.

          Also of note: SML looks very strange to me, I kind of wish it was in Haskell or OCaml just for the familiarity factor. His SML code looks nothing like the OCaml that I know (though I’m coming from F#, not OCaml).