| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Chapter20
Synopsis
- fib :: Integer -> Integer
- fac :: Integer -> Integer
- iSort :: Ord a => [a] -> [a]
- ins :: Ord a => a -> [a] -> [a]
- qSort :: Ord a => [a] -> [a]
- rev1 :: [a] -> [a]
- rev2 :: [a] -> [a]
- shunt :: [a] -> [a] -> [a]
- mult :: (Eq t, Num t, Num a) => a -> t -> a
- russ :: forall {t} {a}. (Num a, Integral t) => a -> t -> a
- mSort :: Ord a => [a] -> [a]
- mer :: Ord a => [a] -> [a] -> [a]
- exam1 :: (Num a, Enum a) => a -> [a]
- exam2 :: (Num a, Enum a) => a -> [a]
- exam3 :: (Num a, Enum a) => a -> [a]
- exam4 :: (Num a, Enum a) => a -> [a]
- newFac :: Integer -> Integer
- aFac :: Integer -> Integer -> Integer
- sumSquares :: Integer -> Integer
- sumList :: [Integer] -> Integer
- sq :: Num a => a -> a
- map :: Foldable t => (a -> b) -> t a -> [b]
- facFold :: (Num b, Enum b) => b -> b
- foldEx1 :: (Eq a, Num a, Enum a) => a -> Bool
- fibP :: Integer -> (Integer, Integer)
- fibs :: [Integer]
- mLen :: Eq a => [a] -> [a] -> Integer
- maxLen :: Eq a => [a] -> [a] -> Int -> Int -> Int
- maxTab :: Eq a => [a] -> [a] -> [[Int]]
Documentation
sumSquares :: Integer -> Integer Source #