Reply to https://twitter.com/Iceland_jack/status/1527130468499456000

Folds.hs

import Data.Coerce
import Data.Monoid

-- This combinator is based on ala' from Conor McBride's work on Epigram.
alaf :: (Coercible n o, Coercible n' o')
     => (o -> n) -> ((a -> n) -> b -> n') -> (a -> o) -> b -> o'
alaf _ = coerce

myfoldl :: Foldable t => (b -> a -> b) -> b -> t a -> b
myfoldl f z xs = alaf (Dual . Endo) foldMap (flip f) xs z

--
-- >>> myreverse "keep it simple"
-- "elpmis ti peek"
-- 
myreverse :: [a] -> [a]
myreverse = myfoldl (flip (:)) []