Dear Haskell Devs ^_^,<br><br>1) what is the most performant lookup table/hashtable/dictionary solution for Haskell?<br>1.1) should I use size-balanced binary trees for that or is there a more common way?<br><br>2) are there any established style guidelines for haskell code?<br>
<br>Best Regards,<br>Cetin Sert<br><br>