A Tour of the Haskell Prelude
Authors: Bernie Pope (original content),
Arjan van IJzendoorn (HTMLisation and updates)
This webpage is a HTML version of most of Bernie Pope's paper "A Tour of the Haskell Prelude":
https://www.cs.mu.oz.au/~bjpop/papers.html.
To make searching easy I've included a list of all functions below. Otherwise, when you look
for "map" using your browser, you'll not only find the definition but all its uses, too.
You can send remarks, updates, and corrections to [email protected]
11 feb 2001: announced on Haskell mailing list
15 feb 2001: added types of operators
abs,
all,
and,
any,
atan,
break,
ceiling,
chr,
compare,
concat,
concatMap,
const,
cos,
digitToInt,
div,
drop,
dropWhile,
elem,
error,
even,
exp,
filter,
flip,
floor,
foldl,
foldl1,
foldr,
foldr1,
fromInt,
fromInteger,
fst,
gcd,
head,
id,
init,
isAlpha,
isDigit,
isLower,
isSpace,
isUpper,
iterate,
last,
lcm,
length,
lines,
log,
map,
max,
maximum,
min,
minimum,
mod,
not,
notElem,
null,
odd,
or,
ord,
pi,
pred,
putStr,
product,
quot,
rem,
repeat,
replicate,
reverse,
round,
show,
sin,
snd,
sort,
span,
splitAt,
sqrt,
subtract,
succ,
sum,
tail,
take,
takeWhile,
tan,
toLower,
toUpper,
truncate,
undefined,
unlines,
until,
unwords,
words,
zip,
zipWith,
(!!),
(.),
(**),
(^),
(^^),
(%),
(*),
(/),
(+),
(),
(:),
(++),
(/=),
(==),
(<),
(<=),
(>),
(>=),
(&&),
()
abs :: Num a => a > a 
returns the absolute value of a number.

abs x
 x >= 0 = x
 otherwise = x

Prelude> abs (3)
3

all
all :: (a > Bool) > [a] > Bool 
applied to a predicate and a list, returns True
if all elements of the list satisfy the predicate, and False
otherwise. Similar to the function any.

all p xs = and (map p xs)

Prelude> all (<11) [1..10]
True
Prelude> all isDigit "123abc"
False

and
and :: [Bool] > Bool 
takes the logical conjunction of a list of boolean values
(see also `or').

and xs = foldr (&&) True xs

Prelude> and [True, True, False, True]
False
Prelude> and [True, True, True, True]
True
Prelude> and []
True

any
any :: (a > Bool) > [a] > Bool 
applied to a predicate and a list, returns True
if any of the elements of the list satisfy the predicate, and False
otherwise. Similar to the function all.

any p xs = or (map p xs)

Prelude> any (<11) [1..10]
True
Prelude> any isDigit "123abc"
True
Prelude> any isDigit "alphabetics"
False

atan
atan :: Floating a => a > a 
the trigonometric function inverse tan.

defined internally.

Prelude> atan pi
1.26263

break
break :: (a > Bool) > [a] > ([a],[a]) 
given a predicate and a list, breaks the list into two lists
(returned as a tuple) at the point where the predicate is first satisfied.
If the predicate is never satisfied then the first element of the
resulting tuple is the entire list and the second element is the empty
list ([]).

break p xs
= span p' xs
where
p' x = not (p x)

Prelude> break isSpace "hello there fred"
("hello", " there fred")
Prelude> break isDigit "no digits here"
("no digits here","")

ceiling
ceiling :: (RealFrac a, Integral b) => a > b 
returns the smallest integer not less than its argument.

Prelude> ceiling 3.8
4
Prelude> ceiling (3.8)
3

floor 
chr
chr :: Int > Char 
applied to an integer in the range 0  255, returns the
character whose ascii code is that integer. It is the converse of the
function ord. An error will result if chr is applied to
an integer outside the correct range.

defined internally.

Prelude> chr 65
'A'
Prelude> (ord (chr 65)) == 65
True

ord 
compare
compare :: Ord a => a > a > Ordering 
applied to to values of the same type which have an
ordering defined on them, returns a value of type Ordering which
will be: EQ if the two values are equal; GT if the
first value is strictly greater than the second; and LT if the
first value is less than or equal to the second value.

compare x y
 x == y = EQ
 x < y = LT
 otherwise = GT

Prelude> compare "aadvark" "zebra"
LT

concat
concat :: [[a]] > [a] 
applied to a list of lists, joins them together using
the ++ operator.

concat xs = foldr (++) [] xs

Prelude> concat [[1,2,3], [4], [], [5,6,7,8]]
[1, 2, 3, 4, 5, 6, 7, 8]

concatMap
concatMap :: (a > [b]) > [a] > [b] 
given a function which maps a value to a list, and
a list of elements of the same type as the value, applies the function to
the list and then concatenates the result (thus flattening the resulting list).

concatMap f = concat . map f

Prelude> concatMap show [1,2,3,4]
"1234"

const
const :: const :: a > b > a 
creates a constant valued function which always has the
value of its first argument, regardless of the value of its second argument.

const k _ = k

Prelude> const 12 "lucky"
12

cos
cos :: Floating a => a > a 
the trigonometric cosine function, arguments are
interpreted to be in radians.

defined internally.

Prelude> cos pi
1.0
Prelude> cos (pi/2)
4.37114e08

digitToInt
digitToInt :: Char > Int 
converts a digit character into the corresponding integer
value of the digit.

digitToInt :: Char > Int
digitToInt c
 isDigit c = fromEnum c  fromEnum '0'
 c >= 'a' && c <= 'f' = fromEnum c  fromEnum 'a' + 10
 c >= 'A' && c <= 'F' = fromEnum c  fromEnum 'A' + 10
 otherwise = error "Char.digitToInt: not a digit"

Prelude> digitToInt '3'
3

div
div :: Integral a => a > a > a 
computes the integer division of its integral arguments.

defined internally.

Prelude> 16 `div` 9
1
Prelude> (12) `div` 5
3

`div` is integer division such that the result is
truncated towards negative infinity.

drop
drop :: Int > [a] > [a] 
applied to a number and a list, returns the list with
the specified number of elements removed from the front of the list. If the
list has less than the required number of elements then it returns [].

drop 0 xs = xs
drop _ [] = []
drop n (_:xs)  n>0 = drop (n1) xs
drop _ _ = error "PreludeList.drop: negative argument"

Prelude> drop 3 [1..10]
[4, 5, 6, 7, 8, 9, 10]
Prelude> drop 4 "abc"
""

dropWhile
dropWhile :: (a > Bool) > [a] > [a] 
applied to a predicate and a list, removes elements from the
front of the list while the predicate is satisfied.

dropWhile p [] = []
dropWhile p (x:xs)
 p x = dropWhile p xs
 otherwise = (x:xs)

Prelude> dropWhile (<5) [1..10]
[5, 6, 7, 8, 9, 10]

elem
elem :: Eq a => a > [a] > Bool 
applied to a value and a list returns True if the
value is in the list and False otherwise. The elements of the
list must be of the same type as the value.

elem x xs = any (== x) xs

Prelude> elem 5 [1..10]
True
Prelude> elem "rat" ["fat", "cat", "sat", "flat"]
False

error
error :: String > a 
applied to a string creates an error value with an
associated message. Error values are equivalent to the undefined
value (undefined), any attempt to access the value causes the program
to terminate and print the string as a diagnostic.

defined internally.

error "this is an error message"

even
even :: Integral a => a > Bool 
applied to an integral argument, returns True if
the argument is even, and False otherwise.

even n = n `rem` 2 == 0

Prelude> even 2
True
Prelude> even (11 * 3)
False

exp
exp :: Floating a => a > a 
the exponential function (exp n is equivalent
to e^{n}).

defined internally.

Prelude> exp 1
2.71828

filter
filter :: (a > Bool) > [a] > [a] 
applied to a predicate and a list, returns a list containing
all the elements from the argument list that satisfy the predicate.

filter p xs = [k  k < xs, p k]

Prelude> filter isDigit "fat123cat456"
"123456"

flip
flip :: (a > b > c) > b > a > c 
applied to a binary function, returns the same
function with the order of the arguments reversed.

flip f x y = f y x

Prelude> flip elem [1..10] 5
True

floor
floor :: (RealFrac a, Integral b) => a > b 
returns the largest integer not greater than its argument.

Prelude> floor 3.8
3
Prelude> floor (3.8)
4

ceiling 
foldl
foldl :: (a > b > a) > a > [b] > a 
folds up a list, using a given binary operator and
a given start value, in a left associative manner.
foldl op r [a, b, c] → ((r `op` a) `op` b) `op` c

foldl f z [] = z
foldl f z (x:xs) = foldl f (f z x) xs

Prelude> foldl (+) 0 [1..10]
55
Prelude> foldl (flip (:)) [] [1..10]
[10, 9, 8, 7, 6, 5, 4, 3, 2, 1]

foldl1
foldl1 :: (a > a > a) > [a] > a 
folds left over nonempty lists.

foldl1 f (x:xs) = foldl f x xs

Prelude> foldl1 max [1, 10, 5, 2, 1]
10

foldr
foldr :: (a > b > b) > b > [a] > b 
folds up a list, using a given binary operator and a
given start value, in a right associative manner.
foldr op r [a, b, c] → a `op` (b `op` (c `op` r))

foldr f z [] = z
foldr f z (x:xs) = f x (foldr f z xs)

Prelude> foldr (++) [] ["con", "cat", "en", "ate"]
"concatenate"

foldr1
foldr1 :: (a > a > a) > [a] > a 
folds right over nonempty lists.

foldr1 f [x] = x
foldr1 f (x:xs) = f x (foldr1 f xs)

Prelude> foldr1 (*) [1..10]
3628800

fromInt
fromInt :: Num a => Int > a 
Converts from an Int to a numeric type which is in
the class Num.

Prelude> (fromInt 3)::Float
3.0

fromInteger
fromInteger :: Num a => Integer > a 
Converts from an Integer to a numeric type which
is in the class Num.

Prelude> (fromInteger 10000000000)::Float
1.0e+10

fst
fst :: (a, b) > a 
returns the first element of a two element tuple.

fst (x, _) = x

Prelude> fst ("harry", 3)
"harry"

gcd
gcd :: Integral a => a > a > a 
returns the greatest common divisor between its two
integral arguments.

gcd 0 0 = error "Prelude.gcd: gcd 0 0 is undefined"
gcd x y = gcd' (abs x) (abs y)
where
gcd' x 0 = x
gcd' x y = gcd' y (x `rem` y)

Prelude> gcd 2 10
2
Prelude> gcd (7) 13
1

head
head :: [a] > a 
returns the first element of a nonempty list. If applied
to an empty list an error results.

head (x:_) = x

Prelude> head [1..10]
1
Prelude> head ["this", "and", "that"]
"this"

id
id :: a > a 
the identity function, returns the value of its
argument.

id x = x

Prelude> id 12
12
Prelude> id (id "fred")
"fred"
Prelude> (map id [1..10]) == [1..10]
True

init
init :: [a] > [a] 
returns all but the last element of its argument list.
The argument list must have at least one element. If init is
applied to an empty list an error occurs.

init [x] = []
init (x:xs) = x : init xs

Prelude> init [1..10]
[1, 2, 3, 4, 5, 6, 7, 8, 9]

isAlpha
isAlpha :: Char > Bool 
applied to a character argument, returns True
if the character is alphabetic, and False otherwise.

isAlpha c = isUpper c  isLower c

Prelude> isAlpha 'a'
True
Prelude> isAlpha '1'
False

isDigit
isDigit :: Char > Bool 
applied to a character argument, returns True
if the character is a numeral, and False otherwise.

isDigit c = c >= '0' && c <= '9'

Prelude> isDigit '1'
True
Prelude> isDigit 'a'
False

isLower
isLower :: Char > Bool 
applied to a character argument, returns True
if the character is a lower case alphabetic, and False otherwise.

isLower c = c >= 'a' && c <= 'z'

Prelude> isLower 'a'
True
Prelude> isLower 'A'
False
Prelude> isLower '1'
False

isSpace
isSpace :: Char > Bool 
returns True if its character argument is
a whitespace character and False otherwise.

isSpace c = c == ' '  c == '\t'  c == '\n' 
c == '\r'  c == '\f'  c == '\v'

Prelude> dropWhile isSpace " \nhello \n"
"hello \n"

isUpper
isUpper :: Char > Bool 
applied to a character argument, returns True
if the character is an upper case alphabetic, and False otherwise.

isUpper c = c >= 'A' && c <= 'Z'

Prelude> isUpper 'A'
True
Prelude> isUpper 'a'
False
Prelude> isUpper '1'
False

iterate
iterate :: (a > a) > a > [a] 
iterate f x returns the infinite list
[x,f(x),f(f(x)),...].

iterate f x = x : iterate f (f x)

Prelude> iterate (+1) 1
[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, .....

last
last :: [a] > a 
applied to a nonempty list, returns the last element of
the list.

last [x] = x
last (_:xs) = last xs

Prelude> last [1..10]
10

lcm
lcm :: Integral a => a > a > a 
returns the least common multiple of its two integral
arguments.

lcm _ 0 = 0
lcm 0 _ = 0
lcm x y = abs ((x `quot` gcd x y) * y)

Prelude> lcm 2 10
10
Prelude> lcm 2 11
22

length
length :: [a] > Int 
returns the number of elements in a finite list.

length [] = 0
length (x:xs) = 1 + length xs

Prelude> length [1..10]
10

lines
lines :: String > [String] 
applied to a list of characters containing newlines,
returns a list of lists by breaking the original list into lines using
the newline character as a delimiter. The newline characters are
removed from the result.

lines [] = []
lines (x:xs)
= l : ls
where
(l, xs') = break (== '\n') (x:xs)
ls
 xs' == [] = []
 otherwise = lines (tail xs')

Prelude> lines "hello world\nit's me,\neric\n"
["hello world", "it's me,", "eric"]

log
log :: Floating a => a > a 
returns the natural logarithm of its argument.

defined internally.

Prelude> log 1
0.0
Prelude> log 3.2
1.16315

map
map :: (a > b) > [a] > [b] 
given a function, and a list of any type, returns a
list where each element is the result of applying the function to the
corresponding element in the input list.

map f xs = [f x  x < xs]

Prelude> map sqrt [1..5]
[1.0, 1.41421, 1.73205, 2.0, 2.23607]

max
max :: Ord a => a > a > a 
applied to two values of the same type
which have an ordering defined upon them, returns the maximum of the two
elements according to the operator >=.

max x y
 x >= y = x
 otherwise = y

Prelude> max 1 2
2

maximum
maximum :: Ord a => [a] > a 
applied to a nonempty list whose elements have an ordering
defined upon them, returns the maximum element
of the list.

maximum xs = foldl1 max xs

Prelude> maximum [10, 0 , 5, 22, 13]
22

min
min :: Ord a => a > a > a 
applied to two values of the same type
which have an ordering defined upon them, returns the minimum of the two
elements according to the operator <=.

min x y
 x <= y = x
 otherwise = y

Prelude> min 1 2
1

minimum
minimum :: Ord a => [a] > a 
applied to a nonempty list whose elements have an ordering
defined upon them, returns the minimum element
of the list.

minimum xs = foldl1 min xs

Prelude> minimum [10, 0 , 5, 22, 13]
10

mod
mod :: Integral a => a > a > a 
returns the modulus of its two arguments.

defined internally.

Prelude> 16 `mod` 9
7

not
not :: Bool > Bool 
returns the logical negation of its boolean argument.

not True = False
not False = True

Prelude> not (3 == 4)
True
Prelude> not (10 > 2)
False

notElem
returns True if its first argument is not an
element of the list as its second argument.

Prelude> 3 `notElem` [1,2,3]
False
Prelude> 4 `notElem` [1,2,3]
True

null
null :: [a] > Bool 
returns True if its argument is the empty list
([]) and False otherwise.

null [] = True
null (_:_) = False

Prelude> null []
True
Prelude> null (take 3 [1..10])
False

odd
odd :: Integral a => a > Bool 
applied to an integral argument, returns True if
the argument is odd, and False otherwise.

odd = not . even

Prelude> odd 1
True
Prelude> odd (2 * 12)
False

or
or :: [Bool] > Bool 
applied to a list of boolean values, returns their logical
disjunction (see also `and').

or xs = foldr () False xs

Prelude> or [False, False, True, False]
True
Prelude> or [False, False, False, False]
False
Prelude> or []
False

ord
ord :: Char > Int 
applied to a character, returns its ascii code as an
integer.

defined internally.

Prelude> ord 'A'
65
Prelude> (chr (ord 'A')) == 'A'
True

chr 
pi
pi :: Floating a => a 
the ratio of the circumference of a circle to its diameter.

defined internally.

Prelude> pi
3.14159
Prelude> cos pi
1.0

pred
pred :: Enum a => a > a 
applied to a value of an enumerated type returns the
predecessor (previous value in the enumeration) of its argument. If its
argument is the first value in an enumeration an error will occur.

Prelude> pred 1
0
Prelude> pred True
False

putStr
putStr :: String > IO () 
takes a string as an argument and returns an I/O action as
a result. A sideeffect of applying putStr is that it
causes its argument string to be printed to the screen.

defined internally.

Prelude> putStr "Hello World\nI'm here!"
Hello World
I'm here!

product
product :: Num a => [a] > a 
applied to a list of numbers, returns their product.

product xs = foldl (*) 1 xs

Prelude> product [1..10]
3628800

quot
quot :: Integral a => a > a > a 
returns the quotient after dividing the its first
integral argument by its second integral argument.

defined internally.

Prelude> 16 `quot` 8
2
Prelude> quot 16 9
1

rem
rem :: Integral a => a > a > a 
returns the remainder after dividing its first
integral argument by its second integral argument.

defined internally.

Prelude> 16 `rem` 8
0
Prelude> rem 16 9
7

The following equality holds:
(x `quot` y)*y + (x `rem` y) == x

repeat
repeat :: a > [a] 
given a value, returns an infinite list of elements the
same as the value.

repeat x
= xs
where xs = x:xs

Prelude> repeat 12
[12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12 ....

replicate
replicate :: Int > a > [a] 
given an integer (positive or zero) and a value, returns a
list containing the specified number of instances of that value.

replicate n x = take n (repeat x)

Prelude> replicate 3 "apples"
["apples", "apples", "apples"]

reverse
reverse :: [a] > [a] 
applied to a finite list of any type, returns a list of the
same elements in reverse order.

reverse = foldl (flip (:)) []

Prelude> reverse [1..10]
[10, 9, 8, 7, 6, 5, 4, 3, 2, 1]

round
round :: (RealFrac a, Integral b) => a > b 
rounds its argument to the nearest integer.

Prelude> round 3.2
3
Prelude> round 3.5
4
Prelude> round (3.2)
3

show
show :: Show a => a > String 
converts a value (which must be a member of the Show
class), to its string representation.

defined internally.

Prelude> "six plus two equals " ++ (show (6 + 2))
"six plus two equals 8"

sin
sin :: Floating a => a > a 
the trigonometric sine function, arguments are
interpreted to be in radians.

defined internally.

Prelude> sin (pi/2)
1.0
Prelude> ((sin pi)^2) + ((cos pi)^2)
1.0

snd
snd :: (a, b) > b 
returns the second element of a two element tuple.

snd (_, y) = y

Prelude> snd ("harry", 3)
3

sort
sort :: Ord a => [a] > [a] 
sorts its argument list in ascending order. The items in the
list must be in the class Ord.

List> sort [1, 4, 2, 8, 11, 0]
[2,0,1,4,8,11]

This is not defined within the Prelude. You must
import the List.hs module to use this function.

span
span :: (a > Bool) > [a] > ([a],[a]) 
given a predicate and a list, splits the list into
two lists (returned as a tuple) such that elements in the first list are
taken from the head of the list while the predicate is satisfied, and
elements in the second list are the remaining elements from the list
once the predicate is not satisfied.

span p [] = ([],[])
span p [email protected](x:xs')
 p x = (x:ys, zs)
 otherwise = ([],xs)
where (ys,zs) = span p xs'

Prelude> span isDigit "123abc456"
("123", "abc456")

splitAt
splitAt :: Int > [a] > ([a],[a]) 
given an integer (positive or zero) and a list, splits
the list into two lists (returned as a tuple) at the position corresponding to
the given integer.
If the integer is greater than the length of the list, it returns a tuple
containing the entire list as its first element and the empty list as its
second element.

splitAt 0 xs = ([],xs)
splitAt _ [] = ([],[])
splitAt n (x:xs)
 n > 0 = (x:xs',xs'')
where
(xs',xs'') = splitAt (n1) xs
splitAt _ _ = error "PreludeList.splitAt: negative argument"

Prelude> splitAt 3 [1..10]
([1, 2, 3], [4, 5, 6, 7, 8, 9, 10])
Prelude> splitAt 5 "abc"
("abc", "")

sqrt
sqrt :: Floating a => a > a 
returns the square root of a number.

sqrt x = x ** 0.5

Prelude> sqrt 16
4.0

subtract
subtract :: Num a => a > a > a 
subtracts its first argument from its second argument.

subtract = flip ()

Prelude> subtract 7 10
3

succ
succ :: Enum a => a > a 
applied to a value of an enumerated type returns the
successor (next value in the enumeration) of its argument. If its argument
is the last value in an enumeration an error will occur.

defined internally.

Prelude> succ 'a'
'b'
Prelude> succ False
True

sum
sum :: Num a => [a] > a 
computes the sum of a finite list of numbers.

sum xs = foldl (+) 0 xs

Prelude> sum [1..10]
55

tail
tail :: [a] > [a] 
applied to a nonempty list, returns the list without its
first element.

tail (_:xs) = xs

Prelude> tail [1,2,3]
[2,3]
Prelude> tail "hugs"
"ugs"

take
take :: Int > [a] > [a] 
applied to an integer (positive or zero)
and a list, returns the specified
number of elements from the front of the list. If the list has less than the
required number of elements, take returns the entire list.

take 0 _ = []
take _ []= []
take n (x:xs)
 n > 0 = x : take (n1) xs
take _ _ = error "PreludeList.take: negative argument"

Prelude> take 4 "goodbye"
"good"
Prelude> take 10 [1,2,3]
[1,2,3]

takeWhile
takeWhile :: (a > Bool) > [a] > [a] 
applied to a predicate and a list, returns a list
containing elements from the front of the list while the predicate is
satisfied.

takeWhile p [] = []
takeWhile p (x:xs)
 p x = x : takeWhile p xs
 otherwise = []

Prelude> takeWhile (<5) [1, 2, 3, 10, 4, 2]
[1, 2, 3]

tan
tan :: Floating a => a > a 
the trigonometric function tan, arguments are interpreted
to be in radians.

defined internally.

Prelude> tan (pi/4)
1.0

toLower
toLower :: Char > Char 
converts an uppercase alphabetic character to a lowercase
alphabetic character. If this function is applied to an argument which is not
uppercase the result will be the same as the argument unchanged.

toLower c
 isUpper c = toEnum (fromEnum c  fromEnum 'A' + fromEnum 'a')
 otherwise = c

Prelude> toLower 'A'
'a'
Prelude> toLower '3'
'3'

toUpper
toUpper :: Char > Char 
converts a lowercase alphabetic character to an uppercase
alphabetic character. If this function is applied to an argument which is not
lowercase the result will be the same as the argument unchanged.

toUpper c
 isLower c = toEnum (fromEnum c  fromEnum 'a' + fromEnum 'A')
 otherwise = c

Prelude> toUpper 'a'
'A'
Prelude> toUpper '3'
'3'

truncate
truncate :: (RealFrac a, Integral b) => a > b 
drops the fractional part of a floating point number,
returning only the integral part.

Prelude> truncate 3.2
3
Prelude> truncate (3.2)
3

undefined
undefined :: a 
an undefined value. It is a member of every type.

undefined
 False = undefined

unlines
unlines :: [String] > String 
converts a list of strings into a single string,
placing a newline character between each of them. It is the
converse of the function lines.

unlines xs
= concat (map addNewLine xs)
where
addNewLine l = l ++ "\n"

Prelude> unlines ["hello world", "it's me,", "eric"]
"hello world\nit's me,\neric\n"

until
until :: (a > Bool) > (a > a) > a > a 
given a predicate, a unary function and a value,
it recursively reapplies the function to the value until the
predicate is satisfied. If the predicate is never satisfied until
will not terminate.

until p f x
 p x = x
 otheriwise = until p f (f x)

Prelude> until (>1000) (*2) 1
1024

unwords
unwords :: [String] > String 
concatenates a list of strings into a single string,
placing a single space between each of them.

unwords [] = []
unwords ws
= foldr1 addSpace ws
where
addSpace w s = w ++ (' ':s)

Prelude> unwords ["the", "quick", "brown", "fox"]
"the quick brown fox"

words
words :: String > [String] 
breaks its argument string into a list of words such that
each word is delimited by one or more whitespace characters.

words s
 findSpace == [] = []
 otherwise = w : words s''
where
(w, s'') = break isSpace findSpace
findSpace = dropWhile isSpace s

Prelude> words "the quick brown\n\nfox"
["the", "quick", "brown", "fox"]

zip
zip :: [a] > [b] > [(a,b)] 
applied to two lists, returns a list of pairs which are
formed by tupling together corresponding elements of the given lists. If
the two lists are of different length, the length of the resulting list is
that of the shortest.

zip xs ys
= zipWith pair xs ys
where
pair x y = (x, y)

Prelude> zip [1..6] "abcd"
[(1, 'a'), (2, 'b'), (3, 'c'), (4, 'd')]

zipWith
zipWith :: (a > b > c) > [a] > [b] > [c] 
applied to a binary function and two lists, returns a
list containing elements formed be applying the function to corresponding
elements in the lists.

zipWith z (a:as) (b:bs) = z a b : zipWith z as bs
zipWith _ _ _ = []

Prelude> zipWith (+) [1..5] [6..10]
[7, 9, 11, 13, 15]

(!!)
(!!) :: [a] > Int > a 
given a list and a number, returns the element of the
list whose position is the same as the number.

Prelude> [1..10] !! 0
1
Prelude> "a string" !! 3
't'

the valid subscripts for a list l are: 0 .. (length l)  1.
Therefore,
negative subscripts are not allowed, nor are subsripts greater
than one less than the length of the list argument. Subscripts out of this
range will result in a program error.

(.)
(.) :: (b > c) > (a > b) > a > c 
composes two functions into a single function.

Prelude> (sqrt . sum ) [1,2,3,4,5]
3.87298

(f.g.h) x is equivalent to f (g (h x)).

(**)
(**) :: Floating a => a > a > a 
raises its first argument to the power of its second
argument. The arguments must be in the Floating numerical type class,
and the result will also be in that class.

Prelude> 3.2**pi
38.6345

(^)
(^) :: (Num a, Integral b) => a > b > a 
raises its first argument to the power of its second
argument. The first argument must be a member of the Num type class,
and the second argument must be a member of the Integral
type class. The result will be of the same type as the first argument.

Prelude> 3.2^4
104.858

(^^)
(^^) :: (Fractional a, Integral b) => a > b > a 
raises its first argument to the power of its second
argument. The first argument must be a member of the Fractional
type class, and the second argument must be a member of the Integral
type class. The result will be of the same type as the first argument.

Prelude> 3.142^^4
97.4596

(%)
(%) :: Integral a => a > a > Ratio a 
takes two numbers in the Integral type class and
returns the most simple ratio of the two.

Prelude> 20 % 4
5 % 1
Prelude> (5 % 4)^2
25 % 16

(*)
(*) :: Num a => a > a > a 
returns the multiple of its two arguments.

Prelude> 6 * 2.0
12.0

(/)
(/) :: Fractional a => a > a > a 
returns the result of dividing its first argument by its
second. Both arguments must in the type class Fractional.

Prelude> 12.0 / 2
6.0

(+)
(+) :: Num a => a > a > a 
returns the addition of its arguments.

Prelude> 3 + 4
7
Prelude> (4 % 5) + (1 % 5)
1 % 1

()
() :: Num a => a > a > a 
returns the substraction of its second argument from
its first.

Prelude> 4  3
1
Prelude> 4  (3)
7

(:)
(:) :: a > [a] > [a] 
prefixes an element onto the front of a list.

Prelude> 1:[2,3]
[1,2,3]
Prelude> True:[]
[True]
Prelude> 'h':"askell"
"haskell"

(++)
(++) :: [a] > [a] > [a] 
appends its second list argument onto the end of its
first list argument.

Prelude> [1,2,3] ++ [4,5,6]
[1,2,3,4,5,6]
Prelude> "foo " ++ "was" ++ " here"
"foo was here"

(/=)
(/=) :: Eq a => a > a > Bool 
is True if its first argument is not equal
to its second argument, and False otherwise. Equality is defined by
the == operator. Both of its arguments must be in the Eq
type class.

Prelude> 3 /= 4
True
Prelude> [1,2,3] /= [1,2,3]
False

(==)
(==) :: Eq a => a > a > Bool 
is True if its first argument is equal
to its second argument, and False otherwise. Equality is defined by
the == operator. Both of its arguments must be in the Eq

Prelude> 3 == 4
False
Prelude> [1,2,3] == [1,2,3]
True

(<)
(<) :: Ord a => a > a > Bool 
returns True if its first argument is
strictly less than its second argument, and False
otherwise. Both arguments must be in the type class Ord.

Prelude> 1 < 2
True
Prelude> 'a' < 'z'
True
Prelude> True < False
False

(<=)
(<=) :: Ord a => a > a > Bool 
returns True if its first argument is less than
or equal to its second argument, and False otherwise. Both
arguments must be in the type class Ord.

Prelude> 3 <= 4
True
Prelude> 4 <= 4
True
Prelude> 5 <= 4
False

(>)
(>) :: Ord a => a > a > Bool 
returns True if its first argument is
strictly greater than its second argument, and False
otherwise. Both arguments must be in the type class Ord. 
Prelude> 2 > 1
True
Prelude> 'a' > 'z'
False
Prelude> True > False
True

(>=)
(>=) :: Ord a => a > a > Bool 
returns True if its first argument is greater than
or equal to its second argument, and False otherwise. Both
arguments must be in the type class Ord. 
Prelude> 4 >= 3
True
Prelude> 4 >= 4
True
Prelude> 4 >= 5
False

(&&)
(&&) :: Bool > Bool > Bool 
returns the logical conjunction of its two boolean arguments.

Prelude> True && True
True
Prelude> (3 < 4) && (4 < 5) && False
False

()
() :: Bool > Bool > Bool 
returns the logical disjunction of its two boolean arguments.

Prelude> True  False
True
Prelude> (3 < 4)  (4 > 5)  False
True
