Because isUpper- this is a function Char -> Bool, "1" ‘isInfixOf‘and isUpper . head- [Char] -> Boolfunctions
"1" `isInfixOf` xxx
can be rewritten as
isInfixOf "1" xxx
, isInfixOf [a] -> [a] -> Bool 1. isInfixOf "1", [Char], a Char:
isInfixOf :: [a] -> [a] -> Bool
"1" :: [Char]
isInfixOf "1" :: [a] -> Bool
= [Char] -> Bool
, isInfixOf "1" [Char] -> Bool.
any - (a -> Bool) -> [a] -> Bool. ,
any :: (a -> Bool) -> [a] -> Bool
isInfixOf "1" :: ([Char] -> Bool)
//∴ a = [Char] and
any (isInfixOf "1" ):: [a] → Bool = [[ Char]] → Bool
any (isInfixOf "1"), .
isUpper. isUpper - Char -> Bool. :
any :: (a -> Bool) -> [a] -> Bool
isUpper :: (Char -> Bool)
//∴ a = Char and
any isUpper :: [a] -> Bool
= [Char] -> Bool
, any isUpper , .
, isUpper . head. Haskell :
filter :: (a -> Bool) -> [a] -> [a]
head :: [a] -> a
isUpper :: Char -> Bool
(.) :: (b -> c) -> (a -> b) -> a -> c
, filter isUpper, a = Char [Char] -> [Char], .. .
2
(.) :: (b -> c ) -> (a -> b) -> a -> c
isUpper :: (Char -> Bool)
head :: ([b] -> b)
//∴ c = Bool, b = Char, a = [b] = [Char], and
isUpper . head :: a -> c
= [Char] -> Bool
, filter (isUpper . head) a = [Char] [[Char]] -> [[Char]], .. .
:
isInfixOf (Eq a) => [a] -> [a] -> Bool, a, .a b head, .