The Maybe type is defined as follows:
data Maybe a = Just a | Nothing deriving (Eq, Ord)
It allows the programmer to specify something may not be there.
Maybe satisfies the type equation , where the functor takes a set to a point plus that set.
Comparison to imperative languages
Imperative languages may support this by rewriting as a union or allow one to use / return NULL (defined in some manner) to specify a value might not be there.
As one can see from the type definition, Maybe will be an instance of Eq and Ord when the base type is. As well, instances of Functor and Monad are defined for Maybe.
For Functor, the
fmap function moves inside the Just constructor and is identity on the Nothing constructor.
For Monad, the bind operation passes through Just, while Nothing will force the result to always be Nothing.
Maybe as a Monad
Using the Monad class definition can lead to much more compact code. For example:
f :: Int -> Maybe Int f 0 = Nothing f x = Just x g :: Int -> Maybe Int g 100 = Nothing g x = Just x h :: Int -> Maybe Int h x = case f x of Just n -> g n Nothing -> Nothing h' :: Int -> Maybe Int h' x = do n <- f x g n
h' will give the same results. (). In this case the savings in code size is quite modest, stringing together multiple functions like
g will be more noticeable.
When the module is imported, it supplies a variety of useful functions including:
maybe :: b->(a->b) -> Maybe a -> b
- Applies the second argument to the third, when it is Just x, otherwise returns the first argument.
- Test the argument, returing a Bool based on the constructor.
- Convert to/from a one element or empty list.
- A different way to filter a list.
See the documentation for Data.Maybe for more explanation and other functions.