MagicHaskeller-0.9.6.7: Automatic inductive functional programmer by systematic search

Synopsis

# Documentation

last' :: a -> [a] -> a Source #

ppExcel replaces uncommon functions like catamorphisms with well-known functions.

mkIF :: Exp -> Exp -> Exp -> Exp Source #

nrnds :: Num a => [a] Source #

(<>) :: Eq a => a -> a -> Bool Source #

totalGCD :: Integral t => t -> t -> t Source #

curry2 :: ((a, b) -> c) -> a -> b -> c Source #

curry3 :: ((a, b, c) -> d) -> a -> b -> c -> d Source #

curry4 :: ((a, b, c, d) -> e) -> a -> b -> c -> d -> e Source #

curry5 :: ((a, b, c, d, e) -> f) -> a -> b -> c -> d -> e -> f Source #

curry6 :: ((a, b, c, d, e, f) -> g) -> a -> b -> c -> d -> e -> f -> g Source #

iF :: (Bool, a, a) -> a Source #

upper :: [Char] -> [Char] Source #

lower :: [Char] -> [Char] Source #

proper :: [Char] -> [Char] Source #

right :: ([b], Int) -> [b] Source #

left :: ([b], Int) -> [b] Source #

left1 :: [a] -> [a] Source #

right1 :: [b] -> [b] Source #

dropLeft :: [Char] -> Int -> [Char] Source #

mid :: ([a], Int, Int) -> [a] Source #

len :: Num a => String -> a Source #

concatenate :: ([a], [a]) -> [a] Source #

concatenatE :: ([a], [a], [a]) -> [a] Source #

concatenaTE :: ([a], [a], [a], [a]) -> [a] Source #

concatenATE :: ([a], [a], [a], [a], [a]) -> [a] Source #

concateNATE :: ([a], [a], [a], [a], [a], [a]) -> [a] Source #

fLOOR0 :: RealFrac t => t -> t -> t Source #

fIND :: Num b => (String, String, Int) -> Maybe b Source #

ifERROR :: (Maybe a, a) -> a Source #

oR :: (Bool, Bool) -> Bool Source #

sign :: Num a => a -> a Source #

power :: RealFloat a => (a, a) -> Maybe a Source #

sQRT :: (Floating a, Ord a) => a -> Maybe a Source #

lOG :: (Floating a, Ord a) => (a, a) -> Maybe a Source #

ln :: (Floating a, Ord a) => a -> Maybe a Source #

pI :: Floating a => () -> a Source #

aTAN2 :: RealFloat a => (a, a) -> a Source #

fact :: (Enum a, Num a, Ord a) => a -> Maybe a Source #

combin :: Integral a => (a, a) -> Maybe a Source #

gCD :: (RealFrac a, RealFrac a1, Integral t) => (a1, a) -> t Source #

findIx :: Num a => [Char] -> [Char] -> Int -> a Source #

finD :: Num b => (String, String) -> b Source #

char :: Int -> [Char] Source #

sUB :: (Num a, Ord a) => [Char] -> [Char] -> [Char] -> a -> [Char] Source #

countStr :: Num a => String -> String -> a Source #

ifERROR'2 :: Maybe c -> c -> c Source #

concatenate'2 :: [a] -> [a] -> [a] Source #

right'2 :: [b] -> Int -> [b] Source #

left'2 :: [b] -> Int -> [b] Source #

concatenatE'3 :: [a] -> [a] -> [a] -> [a] Source #

mid'3 :: [a] -> Int -> Int -> [a] Source #

iF'3 :: Bool -> d -> d -> d Source #

concatenaTE'4 :: [a] -> [a] -> [a] -> [a] -> [a] Source #

concatenATE'5 :: [a] -> [a] -> [a] -> [a] -> [a] -> [a] Source #

concateNATE'6 :: [a] -> [a] -> [a] -> [a] -> [a] -> [a] -> [a] Source #