1
2
3
4

-- 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
...

1
2
3
4

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

...

1
2
3

import qualified Data.IntSet as IS

radixSort = IS.toList . IS.fromList

1
2
3
4

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

1
2
3
4

import Data.List (group, mapAccumL)

compress :: [Int] -> [[Int]]
...

1
2
3

compress :: [Int] -> [(Int,Int)]
compress (l:ls) = reverse $ foldl (\ o@((c,i):cs) x -> if x == c + i then (c,i+1):cs else (x,1):o) [(l,1)] ls
compress [] = []

1
2
3
4

import Data.List (group)

compress :: [Int] -> [[Int]]
...

1
2
3
4

data Tag = Tag {
 tagType  :: String,
 tagAttrs :: [Attr]
...

1
2
3
4

import Data.List (transpose)

main = putStr . unlines . reverse . rotate . lines =<< getContents
...

1
2
3

pivot ps = minimum ps
-- Or in the so-called point-free style:
-- pivot = minimum

1
2
3
4

main = do s <- getContents
          putStr $ unlines $ reverse $ rotate $ lines s

...