Conclude Predicate Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
Conclude Comparison Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
Conclude Equivalence Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
FreeOf Conclude Dec Source # | Since: 0.3.0.0 |
Instance detailsDefined in Data.HFunctor.Final |
Conclude (U1 :: Type -> Type) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
Conclude (Op r) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
Conclude (Proxy :: Type -> Type) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
(Divisible m, Divise m) => Conclude (MaybeT m) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
(Divisible m, Divise m) => Conclude (ListT m) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
Conclude (Dec f) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Divisible.Free |
Conclude f => Conclude (Rec1 f) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
Conclude f => Conclude (Alt f) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
Conclude f => Conclude (IdentityT f) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
Conclude m => Conclude (ReaderT r m) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
Conclude m => Conclude (StateT s m) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
Conclude m => Conclude (StateT s m) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
Conclude m => Conclude (WriterT w m) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
Conclude m => Conclude (WriterT w m) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
Conclude f => Conclude (Reverse f) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
Conclude f => Conclude (Backwards f) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
Decidable f => Conclude (WrappedDivisible f) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
Conclude f => Conclude (Step f) Source # | Since: 0.3.0.0 |
Instance detailsDefined in Control.Applicative.Step |
Conclude f => Conclude (ListF f) Source # | Since: 0.3.0.0 |
Instance detailsDefined in Control.Applicative.ListF |
Conclude f => Conclude (MaybeF f) Source # | Since: 0.3.3.0 |
Instance detailsDefined in Control.Applicative.ListF |
Monoid w => Conclude (AltConst w :: Type -> Type) Source # | Unlike for Const , this is possible because there is no Decidable
instance to complicate things. |
Instance detailsDefined in Data.HFunctor.Interpret |
Contravariant (Final Conclude f) Source # | Since: 0.3.0.0 |
Instance detailsDefined in Data.HFunctor.Final |
Decide (Final Conclude f) Source # | Since: 0.3.0.0 |
Instance detailsDefined in Data.HFunctor.Final |
(Conclude f, Conclude g) => Conclude (f :*: g) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
(Conclude f, Conclude g) => Conclude (Product f g) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
Conclude (ProxyF f :: Type -> Type) Source # | Since: 0.3.0.0 |
Instance detailsDefined in Data.HFunctor |
Conclude (Final Decidable f) Source # | Since: 0.3.0.0 |
Instance detailsDefined in Data.HFunctor.Final |
Conclude (Final Conclude f) Source # | Since: 0.3.0.0 |
Instance detailsDefined in Data.HFunctor.Final |
Conclude f => Conclude (M1 i c f) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
(Apply f, Applicative f, Conclude g) => Conclude (f :.: g) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
(Apply f, Applicative f, Conclude g) => Conclude (Compose f g) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
Conclude m => Conclude (RWST r w s m) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
Conclude m => Conclude (RWST r w s m) Source # | |
Instance detailsDefined in Data.Functor.Contravariant.Conclude |
Conclude (Chain Night Not f) Source # | Chain Night Refutec is the free "monoid in the monoidal
category of endofunctors enriched by Night " --- aka, the free
Conclude .
Since: 0.3.0.0 |
Instance detailsDefined in Data.HFunctor.Chain |