Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Documentation
newtype TUT ct ct' cu t t' u a Source #
Instances
(Bindable ((->) :: Type -> Type -> Type) u, Monoidal (-->) (-->) (:*:) (:*:) u, Adjoint ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t' t) => Monoidal (-->) (-->) (:*:) (:*:) ((t <:<.>:> t') := u) Source # | |
(Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t, Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) u, Semimonoidal (<--) (:*:) (:*:) t, Semimonoidal (<--) (:*:) (:*:) t', Monoidal (<--) (-->) (:*:) (:*:) u, Adjoint ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t t') => Monoidal (<--) (-->) (:*:) (:*:) ((t <:<.>:> t') := u) Source # | |
(Semigroupoid m, Covariant m m t, Covariant (Betwixt (Betwixt m m) m) m t, Covariant (Betwixt m (Betwixt m m)) (Betwixt (Betwixt m m) m) u, Covariant m (Betwixt m (Betwixt m m)) t', Interpreted m ((t <:<.>:> t') := u)) => Covariant m m ((t <:<.>:> t') := u) Source # | |
Defined in Pandora.Paradigm.Schemes.TUT (<-|-) :: m a b -> m (((t <:<.>:> t') := u) a) (((t <:<.>:> t') := u) b) Source # (<-|--) :: m a b -> m (((t <:<.>:> t') := u) a) (((t <:<.>:> t') := u) b) Source # (<-|---) :: m a b -> m (((t <:<.>:> t') := u) a) (((t <:<.>:> t') := u) b) Source # (<-|----) :: m a b -> m (((t <:<.>:> t') := u) a) (((t <:<.>:> t') := u) b) Source # (<-|-----) :: m a b -> m (((t <:<.>:> t') := u) a) (((t <:<.>:> t') := u) b) Source # (<-|------) :: m a b -> m (((t <:<.>:> t') := u) a) (((t <:<.>:> t') := u) b) Source # (<-|-------) :: m a b -> m (((t <:<.>:> t') := u) a) (((t <:<.>:> t') := u) b) Source # (<-|--------) :: m a b -> m (((t <:<.>:> t') := u) a) (((t <:<.>:> t') := u) b) Source # (<-|-|-) :: (Covariant m (Betwixt m m) u0, Covariant (Betwixt m m) m ((t <:<.>:> t') := u)) => m a b -> m (((t <:<.>:> t') := u) (u0 a)) (((t <:<.>:> t') := u) (u0 b)) Source # (<-|-|-|-) :: (Covariant m (Betwixt m (Betwixt m m)) v, Covariant (Betwixt m (Betwixt m m)) (Betwixt (Betwixt m m) m) u0, Covariant (Betwixt (Betwixt m m) m) m ((t <:<.>:> t') := u)) => m a b -> m (((t <:<.>:> t') := u) (u0 (v a))) (((t <:<.>:> t') := u) (u0 (v b))) Source # | |
(Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) u, Semimonoidal (-->) (:*:) (:+:) u) => Semimonoidal (-->) (:*:) (:+:) ((((->) s :: Type -> Type) <:<.>:> (:*:) s) := u :: Type -> Type) Source # | |
(Adjoint ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t' t, Bindable ((->) :: Type -> Type -> Type) u) => Semimonoidal (-->) (:*:) (:*:) ((t <:<.>:> t') := u :: Type -> Type) Source # | |
(Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t, Semimonoidal (<--) (:*:) (:*:) t, Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) u, Semimonoidal (<--) (:*:) (:*:) u, Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t', Semimonoidal (<--) (:*:) (:*:) t') => Semimonoidal (<--) (:*:) (:*:) ((t <:<.>:> t') := u :: Type -> Type) Source # | |
(Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) ((t <:<.>:> u) t'), Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) ((v <:<.>:> w) v'), Adjoint ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t w, Adjoint ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t' v', Adjoint ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t v, Adjoint ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) u v, Adjoint ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) v' t') => Adjoint ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) ((t <:<.>:> u) t') ((v <:<.>:> w) v') Source # | |
Defined in Pandora.Paradigm.Schemes (-|) :: ((t <:<.>:> u) t' a -> b) -> a -> (v <:<.>:> w) v' b Source # (|-) :: (a -> (v <:<.>:> w) v' b) -> (t <:<.>:> u) t' a -> b Source # (|--) :: (a -> (v <:<.>:> w) v' b) -> (t <:<.>:> u) t' a -> b Source # (|---) :: (a -> (v <:<.>:> w) v' b) -> (t <:<.>:> u) t' a -> b Source # (|----) :: (a -> (v <:<.>:> w) v' b) -> (t <:<.>:> u) t' a -> b Source # (|-----) :: (a -> (v <:<.>:> w) v' b) -> (t <:<.>:> u) t' a -> b Source # (|------) :: (a -> (v <:<.>:> w) v' b) -> (t <:<.>:> u) t' a -> b Source # (|-------) :: (a -> (v <:<.>:> w) v' b) -> (t <:<.>:> u) t' a -> b Source # (|--------) :: (a -> (v <:<.>:> w) v' b) -> (t <:<.>:> u) t' a -> b Source # (|---------) :: (a -> (v <:<.>:> w) v' b) -> (t <:<.>:> u) t' a -> b Source # (--|) :: ((t <:<.>:> u) t' a -> b) -> a -> (v <:<.>:> w) v' b Source # (---|) :: ((t <:<.>:> u) t' a -> b) -> a -> (v <:<.>:> w) v' b Source # (----|) :: ((t <:<.>:> u) t' a -> b) -> a -> (v <:<.>:> w) v' b Source # (-----|) :: ((t <:<.>:> u) t' a -> b) -> a -> (v <:<.>:> w) v' b Source # (------|) :: ((t <:<.>:> u) t' a -> b) -> a -> (v <:<.>:> w) v' b Source # (-------|) :: ((t <:<.>:> u) t' a -> b) -> a -> (v <:<.>:> w) v' b Source # (--------|) :: ((t <:<.>:> u) t' a -> b) -> a -> (v <:<.>:> w) v' b Source # (---------|) :: ((t <:<.>:> u) t' a -> b) -> a -> (v <:<.>:> w) v' b Source # | |
(Adjoint ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t' t, Extendable ((->) :: Type -> Type -> Type) u) => Extendable ((->) :: Type -> Type -> Type) ((t' <:<.>:> t) := u) Source # | |
Defined in Pandora.Paradigm.Schemes.TUT (<<=) :: (((t' <:<.>:> t) := u) a -> b) -> ((t' <:<.>:> t) := u) a -> ((t' <:<.>:> t) := u) b Source # (<<==) :: (((t' <:<.>:> t) := u) a -> b) -> ((t' <:<.>:> t) := u) a -> ((t' <:<.>:> t) := u) b Source # (<<===) :: (((t' <:<.>:> t) := u) a -> b) -> ((t' <:<.>:> t) := u) a -> ((t' <:<.>:> t) := u) b Source # (<<====) :: (((t' <:<.>:> t) := u) a -> b) -> ((t' <:<.>:> t) := u) a -> ((t' <:<.>:> t) := u) b Source # (<<=====) :: (((t' <:<.>:> t) := u) a -> b) -> ((t' <:<.>:> t) := u) a -> ((t' <:<.>:> t) := u) b Source # (<<======) :: (((t' <:<.>:> t) := u) a -> b) -> ((t' <:<.>:> t) := u) a -> ((t' <:<.>:> t) := u) b Source # (<<=======) :: (((t' <:<.>:> t) := u) a -> b) -> ((t' <:<.>:> t) := u) a -> ((t' <:<.>:> t) := u) b Source # (<<========) :: (((t' <:<.>:> t) := u) a -> b) -> ((t' <:<.>:> t) := u) a -> ((t' <:<.>:> t) := u) b Source # (<<=========) :: (((t' <:<.>:> t) := u) a -> b) -> ((t' <:<.>:> t) := u) a -> ((t' <:<.>:> t) := u) b Source # | |
(Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t, Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t', Adjoint ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t' t, Bindable ((->) :: Type -> Type -> Type) u) => Bindable ((->) :: Type -> Type -> Type) ((t <:<.>:> t') := u) Source # | |
Defined in Pandora.Paradigm.Schemes.TUT (=<<) :: (a -> ((t <:<.>:> t') := u) b) -> ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) b Source # (==<<) :: (a -> ((t <:<.>:> t') := u) b) -> ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) b Source # (===<<) :: (a -> ((t <:<.>:> t') := u) b) -> ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) b Source # (====<<) :: (a -> ((t <:<.>:> t') := u) b) -> ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) b Source # (=====<<) :: (a -> ((t <:<.>:> t') := u) b) -> ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) b Source # (======<<) :: (a -> ((t <:<.>:> t') := u) b) -> ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) b Source # (=======<<) :: (a -> ((t <:<.>:> t') := u) b) -> ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) b Source # (========<<) :: (a -> ((t <:<.>:> t') := u) b) -> ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) b Source # (=========<<) :: (a -> ((t <:<.>:> t') := u) b) -> ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) b Source # | |
(Adjoint ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t' t, Distributive ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t) => Liftable ((->) :: Type -> Type -> Type) (t <:<.>:> t') Source # | |
(Adjoint ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t t', Distributive ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t') => Lowerable ((->) :: Type -> Type -> Type) (t <:<.>:> t') Source # | |
Interpreted ((->) :: Type -> Type -> Type) (TUT ct ct' cu t t' u) Source # | |
Defined in Pandora.Paradigm.Schemes.TUT run :: TUT ct ct' cu t t' u a -> Primary (TUT ct ct' cu t t' u) a Source # unite :: Primary (TUT ct ct' cu t t' u) a -> TUT ct ct' cu t t' u a Source # (!) :: TUT ct ct' cu t t' u a -> Primary (TUT ct ct' cu t t' u) a Source # (=#-) :: (Semigroupoid (->), Interpreted (->) u0) => (Primary (TUT ct ct' cu t t' u) a -> Primary u0 b) -> TUT ct ct' cu t t' u a -> u0 b Source # (-#=) :: (Semigroupoid (->), Interpreted (->) u0) => (TUT ct ct' cu t t' u a -> u0 b) -> Primary (TUT ct ct' cu t t' u) a -> Primary u0 b Source # (<$=#-) :: (Semigroupoid (->), Covariant (->) (->) j, Interpreted (->) u0) => (Primary (TUT ct ct' cu t t' u) a -> Primary u0 b) -> (j := TUT ct ct' cu t t' u a) -> (j := u0 b) Source # (-#=$>) :: (Covariant (->) (->) j, Interpreted (->) u0) => (TUT ct ct' cu t t' u a -> u0 b) -> (j := Primary (TUT ct ct' cu t t' u) a) -> (j := Primary u0 b) Source # | |
type Primary (TUT ct ct' cu t t' u) a Source # | |
type (>:<.>:<) = TUT Contravariant Covariant Contravariant infix 3 Source #
type (>:>.<:>) = TUT Contravariant Contravariant Covariant infix 3 Source #
type (<:>.<:<) = TUT Covariant Contravariant Contravariant infix 3 Source #
type (>:>.<:<) = TUT Contravariant Contravariant Contravariant infix 3 Source #