Copyright | Copyright (C) 2015 Kyle Carter |
---|---|
License | BSD3 |
Maintainer | Kyle Carter <kylcarte@indiana.edu> |
Stability | experimental |
Portability | RankNTypes |
Safe Haskell | None |
Language | Haskell2010 |
A type combinator for type-level Maybe
s,
lifting (f :: k -> *)
to (Option f :: Maybe k -> *)
.
Documentation
data Option f :: Maybe k -> * where Source
(Witness p q (f a), (~) (Maybe k) x (Just k a)) => Witness p q (Option k f x) Source | |
Traversable1 k (Maybe k) (Option k) Source | |
Foldable1 k (Maybe k) (Option k) Source | |
Functor1 k (Maybe k) (Option k) Source | We can take a natural transformation of |
Known (Maybe k) (Option k f) (Nothing k) Source | |
Known k f a => Known (Maybe k) (Option k f) (Just k a) Source | |
type WitnessC p q (Option k f x) = Witness p q (f (FromJust k x)) Source | |
type KnownC (Maybe k) (Option k f) (Nothing k) = ØC | |
type KnownC (Maybe k) (Option k f) (Just k a) = Known k f a Source |