haskell exercise

ghci-progress.hs

import Data.Char

-- toUpperCase() --
map isUpper "abcDEF"

-- compute the number of containing lower/upper chars --

length (filter isLower "xxxXXXX")
-- will return 3

length (filter isUpper "xxxXXXX")
-- will return 4

-- choose the maximum value from a list by using `foldr` or `foldl`
foldr max 0 [1, 20, 3]

-- access like [(5,’b’),(1,’c’),(6,’a’)] returns 1 --
fst (head (tail [(5,'b'),(1,'c'),(6,'a')]))

GHCI