startRow <- randomRIO (0 :: Int, rows - 1)
    startColumn <- randomRIO (0 :: Int, columns - 1)
    seeds <- replicateM (rows * columns) (randomRIO (0 :: Int, (max rows columns)))
...

module Main where
import Data.IORef
import Data.List
...

module Currency where

import Text.Regex.Posix
...

module Currency where

import Text.Regex.Posix
...

module Currency where

import Text.Regex.Posix
...

import Data.Map (Map)
import qualified Data.Map as Map

...

import Data.Map

type Frequencies = Map Char (Map Char (Map Char Int))
...

Haskell On Frequencies of trigrams in ...

by andreas, November 17, 2010 14:35

As sargon suggested you mig...

type Trigram a = (a,a,a)

allTrigrams :: [a] -> [Trigram  a]
...

handleFirstPing :: IRCHandle -> ChannelName -> IO ()
handleFirstPing nh channel = handleFirstPing' nh channel 0
 where handleFirstPing' :: IRCHandle -> ChannelName -> Int -> IO ()
...

Haskell On Don't like that explicit 0 ...

by sargon, September 25, 2010 13:51

You could also reduce code ...

handleFirstPing :: IRCHandle -> ChannelName -> IO ()
handleFirstPing nh channel = handleFirstPing' nh channel 0
   where handleFirstPing' :: IRCHandle -> ChannelName -> Int -> IO ()
...

Haskell On Don't like that explicit 0 ...

by bob, September 24, 2010 06:56

When you have a recursive f...

-- Your second example is completely contrived, seeing as the user has to annotate a type anyway, you could just write:
is_complex_simple = False
is_complex_complex = True
...

data Simple = Myint Int | Mydouble Double | Mystring String deriving (Eq, Show)
data Complex = Struct String [(String,Simple)] deriving (Eq, Show)

...

import qualified Data.IntSet as IS

radixSort = IS.toList . IS.fromList

# Imports [haskell]
import Data.List (groupBy)
import Control.Arrow ((&&&))
...