The Other Prelude

module TheOtherPrelude where
 
import Prelude () -- hide everything
 
  -- The idea is to rename 'fmap'.
  -- Both map :: (a -> b) -> [a] -> [b]           (in []) 
  -- and  (.) :: (a -> b) -> (e -> a) -> (e -> b) (in (->) e)
  -- are good names, and are intuitively prefix and infix respectively.
class Functor f where
  map :: (a -> b) -> f a -> f b
 
(.) = map -- defined outside the class as an infix synonym for map.
 
-- The following has been shamelessly copied from the
-- Functor hierarchy proposal page (see links below).
class (Functor p) => Applicative p where
  -- Minimal complete definition: return and (<*>).
  return :: a -> p a                 -- value lifting
  (<*>)  :: p (a -> b) -> p a -> p b -- lifted application
  (>>)   :: p a -> p b -> p b        -- when the second is independent of the first
 
  -- Default definition:
  f >> g = (map (const id) f) <*> g
 
apply = (<*>) -- defined outside the class as a prefix synonym for (<*>).
 
class (Applicative m) => Monad m where
  -- Minimal complete definition: one of join or (>>=).
  (>>=) :: m a -> (a -> m b) -> m b -- bind
  join  :: m (m a) -> m a           -- combining levels of structure
 
  -- Default definitions:
  x >>= f = join (map f x)
  join x = x >>= id
 
-- We shamelessly copy from the MonadPlus reform proposal (link below) now.
-- 'zero' will be used when pattern matching against refutable patterns in
-- do-notation as well as to provide support for monad comprehensions.
-- Should satisfy 'left zero': zero >>= f = zero
class (Monad mz) => MonadZero mz where
  zero :: mz a
 
-- Should satisfy 'monoid':
--   zero ++ b = b;  b ++ zero = b;  (a ++ b) ++ c = a ++ (b ++ c)
-- and 'left distribution':
--   (a ++ b) >>= f = (a >>= f) ++ (b >>= f)
class (MonadZero mp) => MonadPlus mp where
  (++) :: mp a -> mp a -> mp a
 
-- Should satisfy 'monoid':
--   zero `orElse` b = b;  b `orElse` zero = b
--   (a `orElse` b) `orElse` c = a `orElse` (b `orElse` c)
-- and 'left catch':
--   (return a) `orElse` b = a
class (MonadZero mo) => MonadOr mo where
  orElse :: mo a -> mo a -> mo a

module TheOtherPrelude.Utilities where
import Prelude () -- hide everything
 
-- this is the if-then-else proposal
-- the name has been chosen to reflect the magic of Church booleans!
boolean True  x _ = x
boolean False _ y = y

-- ''The Other Prelude'' is an alternative, not a replacement.
-- So we need to hide everything from the Prelude
import Prelude ()
 
-- This is just an example assuming there is nothing to hide
import TheOtherPrelude
 
-- Hopefully, this module will contain lift,...
-- Standard convention is to use M.lift (instead of liftM)
import qualified TheOtherPrelude.Monad.Kleisli as M