Some freaky point free stuff of chapter 10 of the haskell book

Chapter10.hs

module Chapter10 where

-- from Mark & Amr

myOr :: [Bool] -> Bool
myOr = foldr (||) False


myAny :: (a -> Bool) -> [a] -> Bool
myAny = (myOr .) . map

myReverse :: [a] -> [a]
myReverse = foldl (flip (:)) []

myMap :: (a -> b) -> [a] -> [b]
myMap f = foldr ((:) . f) []
myMap' :: (a -> b) -> [a] -> [b]
myMap' = flip foldr [] . ((:) .)

Not sure that's how a point-free myAny should look like. From what I understand, you'd map through the entire list and then call myOr on the elements which would not be optimal? I think the point of the exercise is that it needs to be point-free but still take advantage of fold capabilities to stop early.

Btw, I have found a point-free version for myAny that uses foldr.