Prelude

Synopsis

• data Char
• type String = [Char]
• data Double
• data Int
• data Integer
• data Bool
  • = False
  • | True
• class Read a
• class Show a
• class Eq a where
  • (==) :: a -> a -> Bool
  • (/=) :: a -> a -> Bool
• (==) :: Eq a => a -> a -> Bool
• (/=) :: Eq a => a -> a -> Bool
• data Maybe a
  • = Nothing
  • | Just a
• maybe :: t -> (t1 -> t) -> Maybe t1 -> t
• (>>=) :: Ptr (Fay a) -> Ptr (a -> Fay b) -> Ptr (Fay b)
• (>>) :: Ptr (Fay a) -> Ptr (Fay b) -> Ptr (Fay b)
• return :: a -> Fay a
• fail :: String -> Fay a
• when :: Bool -> Fay a -> Fay ()
• unless :: Bool -> Fay a -> Fay ()
• forM :: [a] -> (a -> Fay b) -> Fay [b]
• forM_ :: [a] -> (a -> Fay b) -> Fay ()
• mapM :: (a -> Fay b) -> [a] -> Fay [b]
• mapM_ :: (a -> Fay b) -> [a] -> Fay ()
• (=<<) :: (a -> Fay b) -> Fay a -> Fay b
• sequence :: [Fay a] -> Fay [a]
• sequence_ :: [Fay a] -> Fay ()
• void :: Fay a -> Fay ()
• (>=>) :: (a -> Fay b) -> (b -> Fay c) -> a -> Fay c
• (<=<) :: (b -> Fay c) -> (a -> Fay b) -> a -> Fay c
• (*) :: Num a => a -> a -> a
• (+) :: Num a => a -> a -> a
• (-) :: Num a => a -> a -> a
• class Eq a => Ord a where
  • (<) :: a -> a -> Bool
  • (<=) :: a -> a -> Bool
  • (>) :: a -> a -> Bool
  • (>=) :: a -> a -> Bool
• data Ordering
  • = LT
  • | EQ
  • | GT
• compare :: Ord a => a -> a -> Ordering
• succ :: Num a => a -> a
• pred :: Num a => a -> a
• enumFrom :: Num a => a -> [a]
• enumFromTo :: (Ord t, Num t) => t -> t -> [t]
• enumFromBy :: Num t => t -> t -> [t]
• enumFromThen :: Num t => t -> t -> [t]
• enumFromByTo :: (Ord t, Num t) => t -> t -> t -> [t]
• enumFromThenTo :: (Ord t, Num t) => t -> t -> t -> [t]
• (/) :: Fractional a => a -> a -> a
• fromIntegral :: (Num a, Num b) => Ptr a -> Ptr b
• fromInteger :: Num a => Ptr Integer -> Ptr a
• (&&) :: Bool -> Bool -> Bool
• (||) :: Bool -> Bool -> Bool
• not :: Bool -> Bool
• otherwise :: Bool
• show :: Automatic a -> String
• error :: String -> a
• undefined :: a
• data Either a b
  • = Left a
  • | Right b
• either :: (a -> c) -> (b -> c) -> Either a b -> c
• until :: (a -> Bool) -> (a -> a) -> a -> a
• ($!) :: (a -> b) -> a -> b
• seq :: a -> b -> b
• const :: a -> b -> a
• id :: a -> a
• (.) :: (t1 -> t) -> (t2 -> t1) -> t2 -> t
• ($) :: (t1 -> t) -> t1 -> t
• flip :: (t1 -> t2 -> t) -> t2 -> t1 -> t
• curry :: ((a, b) -> c) -> a -> b -> c
• uncurry :: (a -> b -> c) -> (a, b) -> c
• snd :: (t, t1) -> t1
• fst :: (t, t1) -> t
• div :: Int -> Int -> Int
• mod :: Int -> Int -> Int
• divMod :: Int -> Int -> (Int, Int)
• min :: Num a => a -> a -> a
• max :: Num a => a -> a -> a
• recip :: Double -> Double
• negate :: Num a => a -> a
• abs :: (Num a, Ord a) => a -> a
• signum :: (Num a, Ord a) => a -> a
• pi :: Double
• exp :: Double -> Double
• sqrt :: Double -> Double
• log :: Double -> Double
• (**) :: Double -> Double -> Double
• (^^) :: Double -> Int -> Double
• unsafePow :: (Num a, Num b) => a -> b -> a
• (^) :: Num a => a -> Int -> a
• logBase :: Double -> Double -> Double
• sin :: Double -> Double
• tan :: Double -> Double
• cos :: Double -> Double
• asin :: Double -> Double
• atan :: Double -> Double
• acos :: Double -> Double
• sinh :: Double -> Double
• tanh :: Double -> Double
• cosh :: Double -> Double
• asinh :: Double -> Double
• atanh :: Double -> Double
• acosh :: Double -> Double
• properFraction :: Double -> (Int, Double)
• truncate :: Double -> Int
• round :: Double -> Int
• ceiling :: Double -> Int
• floor :: Double -> Int
• subtract :: Num a => a -> a -> a
• even :: Int -> Bool
• odd :: Int -> Bool
• gcd :: Int -> Int -> Int
• quot :: Int -> Int -> Int
• quot' :: Int -> Int -> Int
• quotRem :: Int -> Int -> (Int, Int)
• rem :: Int -> Int -> Int
• rem' :: Int -> Int -> Int
• lcm :: Int -> Int -> Int
• find :: (a -> Bool) -> [a] -> Maybe a
• filter :: (a -> Bool) -> [a] -> [a]
• null :: [t] -> Bool
• map :: (a -> b) -> [a] -> [b]
• nub :: Eq a => [a] -> [a]
• nub' :: Eq a => [a] -> [a] -> [a]
• elem :: Eq a => a -> [a] -> Bool
• notElem :: Eq a => a -> [a] -> Bool
• sort :: Ord a => [a] -> [a]
• sortBy :: (t -> t -> Ordering) -> [t] -> [t]
• insertBy :: (a -> a -> Ordering) -> a -> [a] -> [a]
• conc :: [a] -> [a] -> [a]
• concat :: [[a]] -> [a]
• concatMap :: (a -> [b]) -> [a] -> [b]
• foldr :: (t -> t1 -> t1) -> t1 -> [t] -> t1
• foldr1 :: (a -> a -> a) -> [a] -> a
• foldl :: (t1 -> t -> t1) -> t1 -> [t] -> t1
• foldl1 :: (a -> a -> a) -> [a] -> a
• (++) :: [a] -> [a] -> [a]
• (!!) :: [a] -> Int -> a
• head :: [a] -> a
• tail :: [a] -> [a]
• init :: [a] -> [a]
• last :: [a] -> a
• iterate :: (a -> a) -> a -> [a]
• repeat :: a -> [a]
• replicate :: Int -> a -> [a]
• cycle :: [a] -> [a]
• take :: Int -> [a] -> [a]
• drop :: Int -> [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])
• zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]
• zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]
• zip :: [a] -> [b] -> [(a, b)]
• zip3 :: [a] -> [b] -> [c] -> [(a, b, c)]
• unzip :: [(a, b)] -> ([a], [b])
• unzip3 :: [(a, b, c)] -> ([a], [b], [c])
• lines :: String -> [String]
• unlines :: [String] -> String
• words :: String -> [String]
• unwords :: [String] -> String
• and :: [Bool] -> Bool
• or :: [Bool] -> Bool
• any :: (a -> Bool) -> [a] -> Bool
• all :: (a -> Bool) -> [a] -> Bool
• intersperse :: a -> [a] -> [a]
• prependToAll :: a -> [a] -> [a]
• intercalate :: [a] -> [[a]] -> [a]
• maximum :: Num a => [a] -> a
• minimum :: Num a => [a] -> a
• product :: Num a => [a] -> a
• sum :: Num 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]
• lookup :: Eq a1 => a1 -> [(a1, a)] -> Maybe a
• length :: [a] -> Int
• length' :: Int -> [a] -> Int
• reverse :: [a] -> [a]
• print :: Automatic a -> Fay ()
• putStrLn :: String -> Fay ()
• ifThenElse :: Bool -> t -> t -> t
• data Fay a

Documentation