 ifThenElse :: Bool > t > t > t
 data Bool
 (&&) :: Bool > Bool > Bool
 () :: Bool > Bool > Bool
 not :: Bool > Bool
 otherwise :: Bool
 data Maybe a
 maybe :: b > (a > b) > Maybe a > b
 data Either a b
 either :: (a > c) > (b > c) > Either a b > c
 data Ordering
 data Char
 type String = [Char]
 fst :: (a, b) > a
 snd :: (a, b) > b
 curry :: ((a, b) > c) > a > b > c
 uncurry :: (a > b > c) > (a, b) > c
 (==), (/=) :: Integer > Integer > Bool
 compare :: Integer > Integer > Ordering
 (<), (>), (>=), (<=) :: Integer > Integer > Bool
 max, min :: Integer > Integer > Integer
 class Enum a where
 succ :: a > a
 pred :: a > a
 toEnum :: Int > a
 fromEnum :: a > Int
 enumFrom :: a > [a]
 enumFromThen :: a > a > [a]
 enumFromTo :: a > a > [a]
 enumFromThenTo :: a > a > a > [a]
 class Bounded a where
 data Integer
 (+), (*), () :: Integer > Integer > Integer
 negate, fromInteger, signum, abs :: Integer > Integer
 quot, mod, div, rem :: Integer > Integer > Integer
 quotRem, divMod :: Integer > Integer > (Integer, Integer)
 toInteger :: Integer > Integer
 subtract, (^), lcm, gcd :: Integer > Integer > Integer
 even, odd :: Integer > Bool
 fromIntegral :: (Integral a, Num b) => a > b
 class Monad m where
 class Functor f where
 fmap :: (a > b) > f a > f b
 mapM :: Monad m => (a > m b) > [a] > m [b]
 mapM_ :: Monad m => (a > m b) > [a] > m ()
 sequence :: Monad m => [m a] > m [a]
 sequence_ :: Monad m => [m a] > m ()
 (=<<) :: Monad m => (a > m b) > m a > m b
 id :: a > a
 const :: a > b > a
 (.) :: (b > c) > (a > b) > a > c
 flip :: (a > b > c) > b > a > c
 ($) :: (a > b) > a > b
 until :: (a > Bool) > (a > a) > a > a
 asTypeOf :: a > a > a
 error :: [Char] > a
 undefined :: a
 seq :: a > b > b
 ($!) :: (a > b) > a > b
 map :: (a > b) > [a] > [b]
 (++) :: [a] > [a] > [a]
 filter :: (a > Bool) > [a] > [a]
 head :: [a] > a
 last :: [a] > a
 tail :: [a] > [a]
 init :: [a] > [a]
 null :: [a] > Bool
 length :: [a] > Integer
 (!!) :: [a] > Integer > a
 reverse :: [a] > [a]
 foldl :: (a > b > a) > a > [b] > a
 foldl1 :: (a > a > a) > [a] > a
 foldr :: (a > b > b) > b > [a] > b
 foldr1 :: (a > a > a) > [a] > a
 and :: [Bool] > Bool
 or :: [Bool] > Bool
 any :: (a > Bool) > [a] > Bool
 all :: (a > Bool) > [a] > Bool
 sum, product :: [Integer] > Integer
 concat :: [[a]] > [a]
 concatMap :: (a > [b]) > [a] > [b]
 maximum :: Ord a => [a] > a
 minimum :: Ord a => [a] > a
 scanl :: (a > b > a) > a > [b] > [a]
 scanl1 :: (a > a > a) > [a] > [a]
 scanr :: (a > b > b) > b > [a] > [b]
 scanr1 :: (a > a > a) > [a] > [a]
 iterate :: (a > a) > a > [a]
 repeat :: a > [a]
 replicate :: Int > a > [a]
 cycle :: [a] > [a]
 take, drop :: Integer > [a] > [a]
 splitAt :: Int > [a] > ([a], [a])
 takeWhile :: (a > Bool) > [a] > [a]
 dropWhile :: (a > Bool) > [a] > [a]
 span :: (a > Bool) > [a] > ([a], [a])
 break :: (a > Bool) > [a] > ([a], [a])
 elem :: Eq a => a > [a] > Bool
 notElem :: Eq a => a > [a] > Bool
 lookup :: Eq a => a > [(a, b)] > Maybe b
 zip :: [a] > [b] > [(a, b)]
 zip3 :: [a] > [b] > [c] > [(a, b, c)]
 zipWith :: (a > b > c) > [a] > [b] > [c]
 zipWith3 :: (a > b > c > d) > [a] > [b] > [c] > [d]
 unzip :: [(a, b)] > ([a], [b])
 unzip3 :: [(a, b, c)] > ([a], [b], [c])
 lines :: String > [String]
 words :: String > [String]
 unlines :: [String] > String
 unwords :: [String] > String
 type ShowS = String > String
 class Show a where
 shows :: Show a => a > ShowS
 showChar :: Char > ShowS
 showString :: String > ShowS
 showParen :: Bool > ShowS > ShowS
 type ReadS a = String > [(a, String)]
 class Read a where
 reads :: Read a => ReadS a
 readParen :: Bool > ReadS a > ReadS a
 read :: Read a => String > a
 lex :: ReadS String
 data IO a
 putChar :: Char > IO ()
 putStr :: String > IO ()
 putStrLn :: String > IO ()
 print :: Show a => a > IO ()
 getChar :: IO Char
 getLine :: IO String
 getContents :: IO String
 interact :: (String > String) > IO ()
 type FilePath = String
 readFile :: FilePath > IO String
 writeFile :: FilePath > String > IO ()
 appendFile :: FilePath > String > IO ()
 readIO :: Read a => String > IO a
 readLn :: Read a => IO a
 type IOError = IOException
 ioError :: IOError > IO a
 userError :: String > IOError
 catch :: IO a > (IOError > IO a) > IO a
Standard types, classes and related functions
ifThenElse :: Bool > t > t > tSource
Basic data types
data Maybe a
The Maybe
type encapsulates an optional value. A value of type
either contains a value of type Maybe
aa
(represented as
),
or it is empty (represented as Just
aNothing
). Using Maybe
is a good way to
deal with errors or exceptional cases without resorting to drastic
measures such as error
.
The Maybe
type is also a monad. It is a simple kind of error
monad, where all errors are represented by Nothing
. A richer
error monad can be built using the Data.Either.Either
type.
data Either a b
The Either
type represents values with two possibilities: a value of
type
is either Either
a b
or Left
a
.
Right
b
The Either
type is sometimes used to represent a value which is
either correct or an error; by convention, the Left
constructor is
used to hold an error value and the Right
constructor is used to
hold a correct value (mnemonic: "right" also means "correct").
data Ordering
data Char
The character type Char
is an enumeration whose values represent
Unicode (or equivalently ISO/IEC 10646) characters
(see http://www.unicode.org/ for details).
This set extends the ISO 88591 (Latin1) character set
(the first 256 charachers), which is itself an extension of the ASCII
character set (the first 128 characters).
A character literal in Haskell has type Char
.
To convert a Char
to or from the corresponding Int
value defined
by Unicode, use Prelude.toEnum
and Prelude.fromEnum
from the
Prelude.Enum
class respectively (or equivalently ord
and chr
).
Tuples
fst :: (a, b) > a
Extract the first component of a pair.
snd :: (a, b) > b
Extract the second component of a pair.
Basic type classes
class Enum a where
Class Enum
defines operations on sequentially ordered types.
The enumFrom
... methods are used in Haskell's translation of
arithmetic sequences.
Instances of Enum
may be derived for any enumeration type (types
whose constructors have no fields). The nullary constructors are
assumed to be numbered lefttoright by fromEnum
from 0
through n1
.
See Chapter 10 of the Haskell Report for more details.
For any type that is an instance of class Bounded
as well as Enum
,
the following should hold:
 The calls
andsucc
maxBound
should result in a runtime error.pred
minBound

fromEnum
andtoEnum
should give a runtime error if the result value is not representable in the result type. For example,
is an error.toEnum
7 ::Bool

enumFrom
andenumFromThen
should be defined with an implicit bound, thus:
enumFrom x = enumFromTo x maxBound enumFromThen x y = enumFromThenTo x y bound where bound  fromEnum y >= fromEnum x = maxBound  otherwise = minBound
succ :: a > a
the successor of a value. For numeric types, succ
adds 1.
pred :: a > a
the predecessor of a value. For numeric types, pred
subtracts 1.
Convert from an Int
.
Convert to an Int
.
It is implementationdependent what fromEnum
returns when
applied to a value that is too large to fit in an Int
.
enumFrom :: a > [a]
Used in Haskell's translation of [n..]
.
enumFromThen :: a > a > [a]
Used in Haskell's translation of [n,n'..]
.
enumFromTo :: a > a > [a]
Used in Haskell's translation of [n..m]
.
enumFromThenTo :: a > a > a > [a]
Used in Haskell's translation of [n,n'..m]
.
class Bounded a where
The Bounded
class is used to name the upper and lower limits of a
type. Ord
is not a superclass of Bounded
since types that are not
totally ordered may also have upper and lower bounds.
The Bounded
class may be derived for any enumeration type;
minBound
is the first constructor listed in the data
declaration
and maxBound
is the last.
Bounded
may also be derived for singleconstructor datatypes whose
constituent types are in Bounded
.
Numbers
Numeric types
data Integer
Arbitraryprecision integers.
Numeric type classes
Numeric functions
fromIntegral :: (Integral a, Num b) => a > b
general coercion from integral types
Monads and functors
class Monad m where
The Monad
class defines the basic operations over a monad,
a concept from a branch of mathematics known as category theory.
From the perspective of a Haskell programmer, however, it is best to
think of a monad as an abstract datatype of actions.
Haskell's do
expressions provide a convenient syntax for writing
monadic expressions.
Minimal complete definition: >>=
and return
.
Instances of Monad
should satisfy the following laws:
return a >>= k == k a m >>= return == m m >>= (\x > k x >>= h) == (m >>= k) >>= h
Instances of both Monad
and Functor
should additionally satisfy the law:
fmap f xs == xs >>= return . f
The instances of Monad
for lists, Data.Maybe.Maybe
and System.IO.IO
defined in the Prelude satisfy these laws.
(>>=) :: m a > (a > m b) > m b
Sequentially compose two actions, passing any value produced by the first as an argument to the second.
(>>) :: m a > m b > m b
Sequentially compose two actions, discarding any value produced by the first, like sequencing operators (such as the semicolon) in imperative languages.
return :: a > m a
Inject a value into the monadic type.
Fail with a message. This operation is not part of the
mathematical definition of a monad, but is invoked on patternmatch
failure in a do
expression.
class Functor f where
The Functor
class is used for types that can be mapped over.
Instances of Functor
should satisfy the following laws:
fmap id == id fmap (f . g) == fmap f . fmap g
The instances of Functor
for lists, Data.Maybe.Maybe
and System.IO.IO
satisfy these laws.
fmap :: (a > b) > f a > f b
sequence :: Monad m => [m a] > m [a]
Evaluate each action in the sequence from left to right, and collect the results.
sequence_ :: Monad m => [m a] > m ()
Evaluate each action in the sequence from left to right, and ignore the results.
Miscellaneous functions
id :: a > a
Identity function.
const :: a > b > a
Constant function.
(.) :: (b > c) > (a > b) > a > c
Function composition.
flip :: (a > b > c) > b > a > c
takes its (first) two arguments in the reverse order of flip
ff
.
($) :: (a > b) > a > b
Application operator. This operator is redundant, since ordinary
application (f x)
means the same as (f
. However, $
x)$
has
low, rightassociative binding precedence, so it sometimes allows
parentheses to be omitted; for example:
f $ g $ h x = f (g (h x))
It is also useful in higherorder situations, such as
,
or map
($
0) xs
.
Data.List.zipWith
($
) fs xs
asTypeOf :: a > a > a
undefined :: a
seq :: a > b > b
Evaluates its first argument to head normal form, and then returns its second argument as the result.
List operations
map :: (a > b) > [a] > [b]
map
f xs
is the list obtained by applying f
to each element
of xs
, i.e.,
map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn] map f [x1, x2, ...] == [f x1, f x2, ...]
(++) :: [a] > [a] > [a]
Append two lists, i.e.,
[x1, ..., xm] ++ [y1, ..., yn] == [x1, ..., xm, y1, ..., yn] [x1, ..., xm] ++ [y1, ...] == [x1, ..., xm, y1, ...]
If the first list is not finite, the result is the first list.
filter :: (a > Bool) > [a] > [a]
filter
, applied to a predicate and a list, returns the list of
those elements that satisfy the predicate; i.e.,
filter p xs = [ x  x < xs, p x]
head :: [a] > a
Extract the first element of a list, which must be nonempty.
last :: [a] > a
Extract the last element of a list, which must be finite and nonempty.
tail :: [a] > [a]
Extract the elements after the head of a list, which must be nonempty.
init :: [a] > [a]
Return all the elements of a list except the last one. The list must be nonempty.
Reducing lists (folds)
foldl :: (a > b > a) > a > [b] > a
foldl
, applied to a binary operator, a starting value (typically
the leftidentity of the operator), and a list, reduces the list
using the binary operator, from left to right:
foldl f z [x1, x2, ..., xn] == (...((z `f` x1) `f` x2) `f`...) `f` xn
The list must be finite.
foldl1 :: (a > a > a) > [a] > a
foldr :: (a > b > b) > b > [a] > b
foldr
, applied to a binary operator, a starting value (typically
the rightidentity of the operator), and a list, reduces the list
using the binary operator, from right to left:
foldr f z [x1, x2, ..., xn] == x1 `f` (x2 `f` ... (xn `f` z)...)
foldr1 :: (a > a > a) > [a] > a
Special folds
concat :: [[a]] > [a]
Concatenate a list of lists.
concatMap :: (a > [b]) > [a] > [b]
Map a function over a list and concatenate the results.
Building lists
Scans
scanl :: (a > b > a) > a > [b] > [a]
scanl1 :: (a > a > a) > [a] > [a]
scanr :: (a > b > b) > b > [a] > [b]
scanr1 :: (a > a > a) > [a] > [a]
Infinite lists
iterate :: (a > a) > a > [a]
iterate
f x
returns an infinite list of repeated applications
of f
to x
:
iterate f x == [x, f x, f (f x), ...]
replicate
n x
is a list of length n
with x
the value of
every element.
It is an instance of the more general Data.List.genericReplicate
,
in which n
may be of any integral type.
cycle :: [a] > [a]
cycle
ties a finite list into a circular one, or equivalently,
the infinite repetition of the original list. It is the identity
on infinite lists.
Sublists
splitAt :: Int > [a] > ([a], [a])
splitAt
n xs
returns a tuple where first element is xs
prefix of
length n
and second element is the remainder of the list:
splitAt 6 "Hello World!" == ("Hello ","World!") splitAt 3 [1,2,3,4,5] == ([1,2,3],[4,5]) splitAt 1 [1,2,3] == ([1],[2,3]) splitAt 3 [1,2,3] == ([1,2,3],[]) splitAt 4 [1,2,3] == ([1,2,3],[]) splitAt 0 [1,2,3] == ([],[1,2,3]) splitAt (1) [1,2,3] == ([],[1,2,3])
It is equivalent to (
when take
n xs, drop
n xs)n
is not __
(splitAt __ xs = __
).
splitAt
is an instance of the more general Data.List.genericSplitAt
,
in which n
may be of any integral type.
takeWhile :: (a > Bool) > [a] > [a]
takeWhile
, applied to a predicate p
and a list xs
, returns the
longest prefix (possibly empty) of xs
of elements that satisfy p
:
takeWhile (< 3) [1,2,3,4,1,2,3,4] == [1,2] takeWhile (< 9) [1,2,3] == [1,2,3] takeWhile (< 0) [1,2,3] == []
span :: (a > Bool) > [a] > ([a], [a])
span
, applied to a predicate p
and a list xs
, returns a tuple where
first element is longest prefix (possibly empty) of xs
of elements that
satisfy p
and second element is the remainder of the list:
span (< 3) [1,2,3,4,1,2,3,4] == ([1,2],[3,4,1,2,3,4]) span (< 9) [1,2,3] == ([1,2,3],[]) span (< 0) [1,2,3] == ([],[1,2,3])
break :: (a > Bool) > [a] > ([a], [a])
break
, applied to a predicate p
and a list xs
, returns a tuple where
first element is longest prefix (possibly empty) of xs
of elements that
do not satisfy p
and second element is the remainder of the list:
break (> 3) [1,2,3,4,1,2,3,4] == ([1,2,3],[4,1,2,3,4]) break (< 9) [1,2,3] == ([],[1,2,3]) break (> 9) [1,2,3] == ([1,2,3],[])
Searching lists
Zipping and unzipping lists
zip :: [a] > [b] > [(a, b)]
zip
takes two lists and returns a list of corresponding pairs.
If one input list is short, excess elements of the longer list are
discarded.
zip3 :: [a] > [b] > [c] > [(a, b, c)]
zipWith :: (a > b > c) > [a] > [b] > [c]
zipWith3 :: (a > b > c > d) > [a] > [b] > [c] > [d]
unzip :: [(a, b)] > ([a], [b])
unzip
transforms a list of pairs into a list of first components
and a list of second components.
unzip3 :: [(a, b, c)] > ([a], [b], [c])
Functions on strings
lines
breaks a string up into a list of strings at newline
characters. The resulting strings do not contain newlines.
words
breaks a string up into a list of words, which were delimited
by white space.
Converting to and from String
Converting to String
class Show a where
Conversion of values to readable String
s.
Minimal complete definition: showsPrec
or show
.
Derived instances of Show
have the following properties, which
are compatible with derived instances of Text.Read.Read
:
 The result of
show
is a syntactically correct Haskell expression containing only constants, given the fixity declarations in force at the point where the type is declared. It contains only the constructor names defined in the data type, parentheses, and spaces. When labelled constructor fields are used, braces, commas, field names, and equal signs are also used.  If the constructor is defined to be an infix operator, then
showsPrec
will produce infix applications of the constructor.  the representation will be enclosed in parentheses if the
precedence of the toplevel constructor in
x
is less thand
(associativity is ignored). Thus, ifd
is0
then the result is never surrounded in parentheses; ifd
is11
it is always surrounded in parentheses, unless it is an atomic expression.  If the constructor is defined using record syntax, then
show
will produce the recordsyntax form, with the fields given in the same order as the original declaration.
For example, given the declarations
infixr 5 :^: data Tree a = Leaf a  Tree a :^: Tree a
the derived instance of Show
is equivalent to
instance (Show a) => Show (Tree a) where showsPrec d (Leaf m) = showParen (d > app_prec) $ showString "Leaf " . showsPrec (app_prec+1) m where app_prec = 10 showsPrec d (u :^: v) = showParen (d > up_prec) $ showsPrec (up_prec+1) u . showString " :^: " . showsPrec (up_prec+1) v where up_prec = 5
Note that rightassociativity of :^:
is ignored. For example,

produces the stringshow
(Leaf 1 :^: Leaf 2 :^: Leaf 3)"Leaf 1 :^: (Leaf 2 :^: Leaf 3)"
.
:: Int  the operator precedence of the enclosing
context (a number from 
> a  the value to be converted to a 
> ShowS 
Convert a value to a readable String
.
showsPrec
should satisfy the law
showsPrec d x r ++ s == showsPrec d x (r ++ s)
Derived instances of Text.Read.Read
and Show
satisfy the following:

(x,"")
is an element of(
.Text.Read.readsPrec
d (showsPrec
d x ""))
That is, Text.Read.readsPrec
parses the string produced by
showsPrec
, and delivers the value that showsPrec
started with.
Show Bool  
Show Char  
Show Double  
Show Float  
Show Int  
Show Integer  
Show Ordering  
Show ()  
Show BlockedIndefinitelyOnMVar  
Show BlockedIndefinitelyOnSTM  
Show Deadlock  
Show AssertionFailed  
Show AsyncException  
Show ArrayException  
Show ExitCode  
Show IOErrorType  
Show MaskingState  
Show IOException  
Show Arity  
Show Fixity  
Show Associativity  
Show a => Show [a]  
Integral a => Show (Ratio a)  
Show a => Show (Maybe a)  
(Show a, Show b) => Show (Either a b)  
(Show a, Show b) => Show (a, b)  
(Show a, Show b, Show c) => Show (a, b, c)  
(Show a, Show b, Show c, Show d) => Show (a, b, c, d)  
(Show a, Show b, Show c, Show d, Show e) => Show (a, b, c, d, e)  
(Show a, Show b, Show c, Show d, Show e, Show f) => Show (a, b, c, d, e, f)  
(Show a, Show b, Show c, Show d, Show e, Show f, Show g) => Show (a, b, c, d, e, f, g)  
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h) => Show (a, b, c, d, e, f, g, h)  
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i) => Show (a, b, c, d, e, f, g, h, i)  
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j) => Show (a, b, c, d, e, f, g, h, i, j)  
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k) => Show (a, b, c, d, e, f, g, h, i, j, k)  
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l) => Show (a, b, c, d, e, f, g, h, i, j, k, l)  
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m)  
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n)  
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n, Show o) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) 
utility function converting a Char
to a show function that
simply prepends the character unchanged.
showString :: String > ShowS
utility function converting a String
to a show function that
simply prepends the string unchanged.
Converting from String
class Read a where
Parsing of String
s, producing values.
Minimal complete definition: readsPrec
(or, for GHC only, readPrec
)
Derived instances of Read
make the following assumptions, which
derived instances of Text.Show.Show
obey:
 If the constructor is defined to be an infix operator, then the
derived
Read
instance will parse only infix applications of the constructor (not the prefix form).  Associativity is not used to reduce the occurrence of parentheses, although precedence may be.
 If the constructor is defined using record syntax, the derived
Read
will parse only the recordsyntax form, and furthermore, the fields must be given in the same order as the original declaration.  The derived
Read
instance allows arbitrary Haskell whitespace between tokens of the input string. Extra parentheses are also allowed.
For example, given the declarations
infixr 5 :^: data Tree a = Leaf a  Tree a :^: Tree a
the derived instance of Read
in Haskell 98 is equivalent to
instance (Read a) => Read (Tree a) where readsPrec d r = readParen (d > app_prec) (\r > [(Leaf m,t)  ("Leaf",s) < lex r, (m,t) < readsPrec (app_prec+1) s]) r ++ readParen (d > up_prec) (\r > [(u:^:v,w)  (u,s) < readsPrec (up_prec+1) r, (":^:",t) < lex s, (v,w) < readsPrec (up_prec+1) t]) r where app_prec = 10 up_prec = 5
Note that rightassociativity of :^:
is unused.
The derived instance in GHC is equivalent to
instance (Read a) => Read (Tree a) where readPrec = parens $ (prec app_prec $ do Ident "Leaf" < lexP m < step readPrec return (Leaf m)) +++ (prec up_prec $ do u < step readPrec Symbol ":^:" < lexP v < step readPrec return (u :^: v)) where app_prec = 10 up_prec = 5 readListPrec = readListPrecDefault
:: Int  the operator precedence of the enclosing
context (a number from 
> ReadS a 
attempts to parse a value from the front of the string, returning a list of (parsed value, remaining string) pairs. If there is no successful parse, the returned list is empty.
Derived instances of Read
and Text.Show.Show
satisfy the following:

(x,"")
is an element of(
.readsPrec
d (Text.Show.showsPrec
d x ""))
That is, readsPrec
parses the string produced by
Text.Show.showsPrec
, and delivers the value that
Text.Show.showsPrec
started with.
Read Bool  
Read Char  
Read Double  
Read Float  
Read Int  
Read Integer  
Read Ordering  
Read ()  
Read ExitCode  
Read Lexeme  
Read Arity  
Read Fixity  
Read Associativity  
Read a => Read [a]  
(Integral a, Read a) => Read (Ratio a)  
Read a => Read (Maybe a)  
(Read a, Read b) => Read (Either a b)  
(Read a, Read b) => Read (a, b)  
(Ix a, Read a, Read b) => Read (Array a b)  
(Read a, Read b, Read c) => Read (a, b, c)  
(Read a, Read b, Read c, Read d) => Read (a, b, c, d)  
(Read a, Read b, Read c, Read d, Read e) => Read (a, b, c, d, e)  
(Read a, Read b, Read c, Read d, Read e, Read f) => Read (a, b, c, d, e, f)  
(Read a, Read b, Read c, Read d, Read e, Read f, Read g) => Read (a, b, c, d, e, f, g)  
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h) => Read (a, b, c, d, e, f, g, h)  
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i) => Read (a, b, c, d, e, f, g, h, i)  
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j) => Read (a, b, c, d, e, f, g, h, i, j)  
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k) => Read (a, b, c, d, e, f, g, h, i, j, k)  
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l) => Read (a, b, c, d, e, f, g, h, i, j, k, l)  
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m)  
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m, n)  
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n, Read o) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) 
The read
function reads input from a string, which must be
completely consumed by the input process.
The lex
function reads a single lexeme from the input, discarding
initial white space, and returning the characters that constitute the
lexeme. If the input string contains only white space, lex
returns a
single successful `lexeme' consisting of the empty string. (Thus
.) If there is no legal lexeme at the
beginning of the input string, lex
"" = [("","")]lex
fails (i.e. returns []
).
This lexer is not completely faithful to the Haskell lexical syntax in the following respects:
 Qualified names are not handled properly
 Octal and hexadecimal numerics are not recognized as a single token
 Comments are not treated properly
Basic Input and output
data IO a
A value of type
is a computation which, when performed,
does some I/O before returning a value of type IO
aa
.
There is really only one way to "perform" an I/O action: bind it to
Main.main
in your program. When your program is run, the I/O will
be performed. It isn't possible to perform I/O from an arbitrary
function, unless that function is itself in the IO
monad and called
at some point, directly or indirectly, from Main.main
.
IO
is a monad, so IO
actions can be combined using either the donotation
or the >>
and >>=
operations from the Monad
class.
Simple I/O operations
Output functions
The print
function outputs a value of any printable type to the
standard output device.
Printable types are those that are instances of class Show
; print
converts values to strings for output using the show
operation and
adds a newline.
For example, a program to print the first 20 integers and their powers of 2 could be written as:
main = print ([(n, 2^n)  n < [0..19]])
Input functions
getContents :: IO String
The getContents
operation returns all user input as a single string,
which is read lazily as it is needed
(same as hGetContents
stdin
).
interact :: (String > String) > IO ()
The interact
function takes a function of type String>String
as its argument. The entire input from the standard input device is
passed to this function as its argument, and the resulting string is
output on the standard output device.
Files
File and directory names are values of type String
, whose precise
meaning is operating system dependent. Files can be opened, yielding a
handle which can then be used to operate on the contents of that file.
readFile :: FilePath > IO String
The readFile
function reads a file and
returns the contents of the file as a string.
The file is read lazily, on demand, as with getContents
.
writeFile :: FilePath > String > IO ()
The computation writeFile
file str
function writes the string str
,
to the file file
.
appendFile :: FilePath > String > IO ()
The computation appendFile
file str
function appends the string str
,
to the file file
.
Note that writeFile
and appendFile
write a literal string
to a file. To write a value of any printable type, as with print
,
use the show
function to convert the value to a string first.
main = appendFile "squares" (show [(x,x*x)  x < [0,0.1..2]])
Exception handling in the I/O monad
type IOError = IOException
The Haskell 98 type for exceptions in the IO
monad.
Any I/O operation may raise an IOError
instead of returning a result.
For a more general type of exception, including also those that arise
in pure code, see Control.Exception.Exception.
In Haskell 98, this is an opaque type.