This is an interesting question and relates to the mathematical line of monads.
Of course, we could create a type class Monadishthat looks exactly like Monadtypeclass:
class Monadish m where
returnish :: a -> ma
bindish :: m a -> (a -> m b) -> m b
, ; , . , ""; , .
? : - , , . , (check), (check), (... nope). , , , , - .
- . : typeclass . , "" , , . , , , , . - : , , , .