[Haskell-cafe] lookup tables & style guidelines

Don Stewart dons at galois.com
Wed Apr 23 16:36:34 EDT 2008

>    Dear Haskell Devs ^_^,
>    1) what is the most performant lookup table/hashtable/dictionary solution
>    for Haskell?

Data.IntMap is awfully good.

>    1.1) should I use size-balanced binary trees for that or is there a more
>    common way?

I would. Data.Map/Data.IntMap

>    2) are there any established style guidelines for haskell code?


Or pick an author you like, and look at their code on

-- Don

More information about the Haskell-Cafe mailing list