Pandora.Pattern.Functor.Covariant

Documentation

class Covariant (t :: * -> *) where

When providing a new instance, you should ensure it satisfies:
* Identity morphism: comap identity ≡ identity
* Interpreted of morphisms: comap (f . g) ≡ comap f . comap g

Minimal complete definition

(<$>)

Methods

(<$>) :: (a -> b) -> t a -> t b infixl 4

Infix version of comap

comap :: (a -> b) -> t a -> t b

Prefix version of <$>

(<$) :: a -> t b -> t a infixl 4

Replace all locations in the input with the same value

($>) :: t a -> b -> t b infixl 4

Flipped version of <$

void :: t a -> t ()

Discards the result of evaluation

loeb :: t (a <:= t) -> t a

Computing a value from a structure of values

(<&>) :: t a -> (a -> b) -> t b infixl 1

Flipped infix version of comap

(<$$>) :: Covariant u => (a -> b) -> ((t :. u) := a) -> (t :. u) := b infixl 3

Infix versions of comap with various nesting levels

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((t :. (u :. v)) := a) -> (t :. (u :. v)) := b infixl 2

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((t :. (u :. (v :. w))) := a) -> (t :. (u :. (v :. w))) := b infixl 1

(<&&>) :: Covariant u => ((t :. u) := a) -> (a -> b) -> (t :. u) := b infixl 2

Infix flipped versions of comap with various nesting levels

(<&&&>) :: (Covariant u, Covariant v) => ((t :. (u :. v)) := a) -> (a -> b) -> (t :. (u :. v)) := b infixl 3

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((t :. (u :. (v :. w))) := a) -> (a -> b) -> (t :. (u :. (v :. w))) := b infixl 4

(.#..) :: (t ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d infixr 7

(.#...) :: (t ~ v a, t ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e infixr 7

(.#....) :: (t ~ v a, t ~ v b, t ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f infixr 7

(<$$) :: Covariant u => b -> ((t :. u) := a) -> (t :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((t :. (u :. v)) := a) -> (t :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((t :. (u :. (v :. w))) := a) -> (t :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((t :. u) := a) -> b -> (t :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((t :. (u :. v)) := a) -> b -> (t :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((t :. (u :. (v :. w))) := a) -> b -> (t :. (u :. (v :. w))) := b

Instances

Covariant Wye

Defined in Pandora.Paradigm.Primary.Functor.Wye

Methods

(<$>) :: (a -> b) -> Wye a -> Wye b

comap :: (a -> b) -> Wye a -> Wye b

(<$) :: a -> Wye b -> Wye a

($>) :: Wye a -> b -> Wye b

void :: Wye a -> Wye ()

loeb :: Wye (a <:= Wye) -> Wye a

(<&>) :: Wye a -> (a -> b) -> Wye b

(<$$>) :: Covariant u => (a -> b) -> ((Wye :. u) := a) -> (Wye :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Wye :. (u :. v)) := a) -> (Wye :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Wye :. (u :. (v :. w))) := a) -> (Wye :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Wye :. u) := a) -> (a -> b) -> (Wye :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Wye :. (u :. v)) := a) -> (a -> b) -> (Wye :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Wye :. (u :. (v :. w))) := a) -> (a -> b) -> (Wye :. (u :. (v :. w))) := b

(.#..) :: (Wye ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Wye ~ v a, Wye ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Wye ~ v a, Wye ~ v b, Wye ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Wye :. u) := a) -> (Wye :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Wye :. (u :. v)) := a) -> (Wye :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Wye :. (u :. (v :. w))) := a) -> (Wye :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Wye :. u) := a) -> b -> (Wye :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Wye :. (u :. v)) := a) -> b -> (Wye :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Wye :. (u :. (v :. w))) := a) -> b -> (Wye :. (u :. (v :. w))) := b

Covariant Edges

Defined in Pandora.Paradigm.Primary.Functor.Edges

Methods

(<$>) :: (a -> b) -> Edges a -> Edges b

comap :: (a -> b) -> Edges a -> Edges b

(<$) :: a -> Edges b -> Edges a

($>) :: Edges a -> b -> Edges b

void :: Edges a -> Edges ()

loeb :: Edges (a <:= Edges) -> Edges a

(<&>) :: Edges a -> (a -> b) -> Edges b

(<$$>) :: Covariant u => (a -> b) -> ((Edges :. u) := a) -> (Edges :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Edges :. (u :. v)) := a) -> (Edges :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Edges :. (u :. (v :. w))) := a) -> (Edges :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Edges :. u) := a) -> (a -> b) -> (Edges :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Edges :. (u :. v)) := a) -> (a -> b) -> (Edges :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Edges :. (u :. (v :. w))) := a) -> (a -> b) -> (Edges :. (u :. (v :. w))) := b

(.#..) :: (Edges ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Edges ~ v a, Edges ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Edges ~ v a, Edges ~ v b, Edges ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Edges :. u) := a) -> (Edges :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Edges :. (u :. v)) := a) -> (Edges :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Edges :. (u :. (v :. w))) := a) -> (Edges :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Edges :. u) := a) -> b -> (Edges :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Edges :. (u :. v)) := a) -> b -> (Edges :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Edges :. (u :. (v :. w))) := a) -> b -> (Edges :. (u :. (v :. w))) := b

Covariant Identity

Defined in Pandora.Paradigm.Primary.Functor.Identity

Methods

(<$>) :: (a -> b) -> Identity a -> Identity b

comap :: (a -> b) -> Identity a -> Identity b

(<$) :: a -> Identity b -> Identity a

($>) :: Identity a -> b -> Identity b

void :: Identity a -> Identity ()

loeb :: Identity (a <:= Identity) -> Identity a

(<&>) :: Identity a -> (a -> b) -> Identity b

(<$$>) :: Covariant u => (a -> b) -> ((Identity :. u) := a) -> (Identity :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Identity :. (u :. v)) := a) -> (Identity :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Identity :. (u :. (v :. w))) := a) -> (Identity :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Identity :. u) := a) -> (a -> b) -> (Identity :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Identity :. (u :. v)) := a) -> (a -> b) -> (Identity :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Identity :. (u :. (v :. w))) := a) -> (a -> b) -> (Identity :. (u :. (v :. w))) := b

(.#..) :: (Identity ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Identity ~ v a, Identity ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Identity ~ v a, Identity ~ v b, Identity ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Identity :. u) := a) -> (Identity :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Identity :. (u :. v)) := a) -> (Identity :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Identity :. (u :. (v :. w))) := a) -> (Identity :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Identity :. u) := a) -> b -> (Identity :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Identity :. (u :. v)) := a) -> b -> (Identity :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Identity :. (u :. (v :. w))) := a) -> b -> (Identity :. (u :. (v :. w))) := b

Covariant Maybe

Defined in Pandora.Paradigm.Primary.Functor.Maybe

Methods

(<$>) :: (a -> b) -> Maybe a -> Maybe b

comap :: (a -> b) -> Maybe a -> Maybe b

(<$) :: a -> Maybe b -> Maybe a

($>) :: Maybe a -> b -> Maybe b

void :: Maybe a -> Maybe ()

loeb :: Maybe (a <:= Maybe) -> Maybe a

(<&>) :: Maybe a -> (a -> b) -> Maybe b

(<$$>) :: Covariant u => (a -> b) -> ((Maybe :. u) := a) -> (Maybe :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Maybe :. (u :. v)) := a) -> (Maybe :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Maybe :. (u :. (v :. w))) := a) -> (Maybe :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Maybe :. u) := a) -> (a -> b) -> (Maybe :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Maybe :. (u :. v)) := a) -> (a -> b) -> (Maybe :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Maybe :. (u :. (v :. w))) := a) -> (a -> b) -> (Maybe :. (u :. (v :. w))) := b

(.#..) :: (Maybe ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Maybe ~ v a, Maybe ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Maybe ~ v a, Maybe ~ v b, Maybe ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Maybe :. u) := a) -> (Maybe :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Maybe :. (u :. v)) := a) -> (Maybe :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Maybe :. (u :. (v :. w))) := a) -> (Maybe :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Maybe :. u) := a) -> b -> (Maybe :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Maybe :. (u :. v)) := a) -> b -> (Maybe :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Maybe :. (u :. (v :. w))) := a) -> b -> (Maybe :. (u :. (v :. w))) := b

Covariant Biforked

Defined in Pandora.Paradigm.Structure.Some.Binary

Methods

(<$>) :: (a -> b) -> Biforked a -> Biforked b

comap :: (a -> b) -> Biforked a -> Biforked b

(<$) :: a -> Biforked b -> Biforked a

($>) :: Biforked a -> b -> Biforked b

void :: Biforked a -> Biforked ()

loeb :: Biforked (a <:= Biforked) -> Biforked a

(<&>) :: Biforked a -> (a -> b) -> Biforked b

(<$$>) :: Covariant u => (a -> b) -> ((Biforked :. u) := a) -> (Biforked :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Biforked :. (u :. v)) := a) -> (Biforked :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Biforked :. (u :. (v :. w))) := a) -> (Biforked :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Biforked :. u) := a) -> (a -> b) -> (Biforked :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Biforked :. (u :. v)) := a) -> (a -> b) -> (Biforked :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Biforked :. (u :. (v :. w))) := a) -> (a -> b) -> (Biforked :. (u :. (v :. w))) := b

(.#..) :: (Biforked ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Biforked ~ v a, Biforked ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Biforked ~ v a, Biforked ~ v b, Biforked ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Biforked :. u) := a) -> (Biforked :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Biforked :. (u :. v)) := a) -> (Biforked :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Biforked :. (u :. (v :. w))) := a) -> (Biforked :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Biforked :. u) := a) -> b -> (Biforked :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Biforked :. (u :. v)) := a) -> b -> (Biforked :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Biforked :. (u :. (v :. w))) := a) -> b -> (Biforked :. (u :. (v :. w))) := b

Stack List

Defined in Pandora.Paradigm.Structure.Some.List

Measurable 'Length List

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Measural 'Length List a

Methods

measurement :: Tagged 'Length (List a) -> Measural 'Length List a

Measurable 'Heighth Binary

Defined in Pandora.Paradigm.Structure.Some.Binary

Associated Types

type Measural 'Heighth Binary a

Methods

measurement :: Tagged 'Heighth (Binary a) -> Measural 'Heighth Binary a

Monotonic a ((t :. Construction t) := a) => Monotonic a ((t <:.> Construction t) := a)

Defined in Pandora.Paradigm.Primary.Transformer.Construction

Methods

reduce :: (a -> r -> r) -> r -> ((t <:.> Construction t) := a) -> r

resolve :: (a -> r) -> r -> ((t <:.> Construction t) := a) -> r

Covariant (Proxy :: Type -> Type)

Defined in Pandora.Paradigm.Primary.Functor.Proxy

Methods

(<$>) :: (a -> b) -> Proxy a -> Proxy b

comap :: (a -> b) -> Proxy a -> Proxy b

(<$) :: a -> Proxy b -> Proxy a

($>) :: Proxy a -> b -> Proxy b

void :: Proxy a -> Proxy ()

loeb :: Proxy (a <:= Proxy) -> Proxy a

(<&>) :: Proxy a -> (a -> b) -> Proxy b

(<$$>) :: Covariant u => (a -> b) -> ((Proxy :. u) := a) -> (Proxy :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Proxy :. (u :. v)) := a) -> (Proxy :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Proxy :. (u :. (v :. w))) := a) -> (Proxy :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Proxy :. u) := a) -> (a -> b) -> (Proxy :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Proxy :. (u :. v)) := a) -> (a -> b) -> (Proxy :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Proxy :. (u :. (v :. w))) := a) -> (a -> b) -> (Proxy :. (u :. (v :. w))) := b

(.#..) :: (Proxy ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Proxy ~ v a, Proxy ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Proxy ~ v a, Proxy ~ v b, Proxy ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Proxy :. u) := a) -> (Proxy :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Proxy :. (u :. v)) := a) -> (Proxy :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Proxy :. (u :. (v :. w))) := a) -> (Proxy :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Proxy :. u) := a) -> b -> (Proxy :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Proxy :. (u :. v)) := a) -> b -> (Proxy :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Proxy :. (u :. (v :. w))) := a) -> b -> (Proxy :. (u :. (v :. w))) := b

Covariant t => Covariant (Jet t)

Defined in Pandora.Paradigm.Primary.Transformer.Jet

Methods

(<$>) :: (a -> b) -> Jet t a -> Jet t b

comap :: (a -> b) -> Jet t a -> Jet t b

(<$) :: a -> Jet t b -> Jet t a

($>) :: Jet t a -> b -> Jet t b

void :: Jet t a -> Jet t ()

loeb :: Jet t (a <:= Jet t) -> Jet t a

(<&>) :: Jet t a -> (a -> b) -> Jet t b

(<$$>) :: Covariant u => (a -> b) -> ((Jet t :. u) := a) -> (Jet t :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Jet t :. (u :. v)) := a) -> (Jet t :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Jet t :. (u :. (v :. w))) := a) -> (Jet t :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Jet t :. u) := a) -> (a -> b) -> (Jet t :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Jet t :. (u :. v)) := a) -> (a -> b) -> (Jet t :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Jet t :. (u :. (v :. w))) := a) -> (a -> b) -> (Jet t :. (u :. (v :. w))) := b

(.#..) :: (Jet t ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Jet t ~ v a, Jet t ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Jet t ~ v a, Jet t ~ v b, Jet t ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Jet t :. u) := a) -> (Jet t :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Jet t :. (u :. v)) := a) -> (Jet t :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Jet t :. (u :. (v :. w))) := a) -> (Jet t :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Jet t :. u) := a) -> b -> (Jet t :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Jet t :. (u :. v)) := a) -> b -> (Jet t :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Jet t :. (u :. (v :. w))) := a) -> b -> (Jet t :. (u :. (v :. w))) := b

Covariant (Wedge e)

Defined in Pandora.Paradigm.Primary.Functor.Wedge

Methods

(<$>) :: (a -> b) -> Wedge e a -> Wedge e b

comap :: (a -> b) -> Wedge e a -> Wedge e b

(<$) :: a -> Wedge e b -> Wedge e a

($>) :: Wedge e a -> b -> Wedge e b

void :: Wedge e a -> Wedge e ()

loeb :: Wedge e (a <:= Wedge e) -> Wedge e a

(<&>) :: Wedge e a -> (a -> b) -> Wedge e b

(<$$>) :: Covariant u => (a -> b) -> ((Wedge e :. u) := a) -> (Wedge e :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Wedge e :. (u :. v)) := a) -> (Wedge e :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Wedge e :. (u :. (v :. w))) := a) -> (Wedge e :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Wedge e :. u) := a) -> (a -> b) -> (Wedge e :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Wedge e :. (u :. v)) := a) -> (a -> b) -> (Wedge e :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Wedge e :. (u :. (v :. w))) := a) -> (a -> b) -> (Wedge e :. (u :. (v :. w))) := b

(.#..) :: (Wedge e ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Wedge e ~ v a, Wedge e ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e0 -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e0

(.#....) :: (Wedge e ~ v a, Wedge e ~ v b, Wedge e ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e0 f -> ((v a :. (v b :. (v c :. v d))) := e0) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Wedge e :. u) := a) -> (Wedge e :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Wedge e :. (u :. v)) := a) -> (Wedge e :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Wedge e :. (u :. (v :. w))) := a) -> (Wedge e :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Wedge e :. u) := a) -> b -> (Wedge e :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Wedge e :. (u :. v)) := a) -> b -> (Wedge e :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Wedge e :. (u :. (v :. w))) := a) -> b -> (Wedge e :. (u :. (v :. w))) := b

Covariant (These e)

Defined in Pandora.Paradigm.Primary.Functor.These

Methods

(<$>) :: (a -> b) -> These e a -> These e b

comap :: (a -> b) -> These e a -> These e b

(<$) :: a -> These e b -> These e a

($>) :: These e a -> b -> These e b

void :: These e a -> These e ()

loeb :: These e (a <:= These e) -> These e a

(<&>) :: These e a -> (a -> b) -> These e b

(<$$>) :: Covariant u => (a -> b) -> ((These e :. u) := a) -> (These e :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((These e :. (u :. v)) := a) -> (These e :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((These e :. (u :. (v :. w))) := a) -> (These e :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((These e :. u) := a) -> (a -> b) -> (These e :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((These e :. (u :. v)) := a) -> (a -> b) -> (These e :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((These e :. (u :. (v :. w))) := a) -> (a -> b) -> (These e :. (u :. (v :. w))) := b

(.#..) :: (These e ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (These e ~ v a, These e ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e0 -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e0

(.#....) :: (These e ~ v a, These e ~ v b, These e ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e0 f -> ((v a :. (v b :. (v c :. v d))) := e0) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((These e :. u) := a) -> (These e :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((These e :. (u :. v)) := a) -> (These e :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((These e :. (u :. (v :. w))) := a) -> (These e :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((These e :. u) := a) -> b -> (These e :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((These e :. (u :. v)) := a) -> b -> (These e :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((These e :. (u :. (v :. w))) := a) -> b -> (These e :. (u :. (v :. w))) := b

Covariant (Validation e)

Defined in Pandora.Paradigm.Primary.Functor.Validation

Methods

(<$>) :: (a -> b) -> Validation e a -> Validation e b

comap :: (a -> b) -> Validation e a -> Validation e b

(<$) :: a -> Validation e b -> Validation e a

($>) :: Validation e a -> b -> Validation e b

void :: Validation e a -> Validation e ()

loeb :: Validation e (a <:= Validation e) -> Validation e a

(<&>) :: Validation e a -> (a -> b) -> Validation e b

(<$$>) :: Covariant u => (a -> b) -> ((Validation e :. u) := a) -> (Validation e :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Validation e :. (u :. v)) := a) -> (Validation e :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Validation e :. (u :. (v :. w))) := a) -> (Validation e :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Validation e :. u) := a) -> (a -> b) -> (Validation e :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Validation e :. (u :. v)) := a) -> (a -> b) -> (Validation e :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Validation e :. (u :. (v :. w))) := a) -> (a -> b) -> (Validation e :. (u :. (v :. w))) := b

(.#..) :: (Validation e ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Validation e ~ v a, Validation e ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e0 -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e0

(.#....) :: (Validation e ~ v a, Validation e ~ v b, Validation e ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e0 f -> ((v a :. (v b :. (v c :. v d))) := e0) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Validation e :. u) := a) -> (Validation e :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Validation e :. (u :. v)) := a) -> (Validation e :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Validation e :. (u :. (v :. w))) := a) -> (Validation e :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Validation e :. u) := a) -> b -> (Validation e :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Validation e :. (u :. v)) := a) -> b -> (Validation e :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Validation e :. (u :. (v :. w))) := a) -> b -> (Validation e :. (u :. (v :. w))) := b

Covariant (Yoneda t)

Defined in Pandora.Paradigm.Primary.Transformer.Yoneda

Methods

(<$>) :: (a -> b) -> Yoneda t a -> Yoneda t b

comap :: (a -> b) -> Yoneda t a -> Yoneda t b

(<$) :: a -> Yoneda t b -> Yoneda t a

($>) :: Yoneda t a -> b -> Yoneda t b

void :: Yoneda t a -> Yoneda t ()

loeb :: Yoneda t (a <:= Yoneda t) -> Yoneda t a

(<&>) :: Yoneda t a -> (a -> b) -> Yoneda t b

(<$$>) :: Covariant u => (a -> b) -> ((Yoneda t :. u) := a) -> (Yoneda t :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Yoneda t :. (u :. v)) := a) -> (Yoneda t :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Yoneda t :. (u :. (v :. w))) := a) -> (Yoneda t :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Yoneda t :. u) := a) -> (a -> b) -> (Yoneda t :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Yoneda t :. (u :. v)) := a) -> (a -> b) -> (Yoneda t :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Yoneda t :. (u :. (v :. w))) := a) -> (a -> b) -> (Yoneda t :. (u :. (v :. w))) := b

(.#..) :: (Yoneda t ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Yoneda t ~ v a, Yoneda t ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Yoneda t ~ v a, Yoneda t ~ v b, Yoneda t ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Yoneda t :. u) := a) -> (Yoneda t :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Yoneda t :. (u :. v)) := a) -> (Yoneda t :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Yoneda t :. (u :. (v :. w))) := a) -> (Yoneda t :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Yoneda t :. u) := a) -> b -> (Yoneda t :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Yoneda t :. (u :. v)) := a) -> b -> (Yoneda t :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Yoneda t :. (u :. (v :. w))) := a) -> b -> (Yoneda t :. (u :. (v :. w))) := b

Covariant t => Covariant (Jack t)

Defined in Pandora.Paradigm.Primary.Transformer.Jack

Methods

(<$>) :: (a -> b) -> Jack t a -> Jack t b

comap :: (a -> b) -> Jack t a -> Jack t b

(<$) :: a -> Jack t b -> Jack t a

($>) :: Jack t a -> b -> Jack t b

void :: Jack t a -> Jack t ()

loeb :: Jack t (a <:= Jack t) -> Jack t a

(<&>) :: Jack t a -> (a -> b) -> Jack t b

(<$$>) :: Covariant u => (a -> b) -> ((Jack t :. u) := a) -> (Jack t :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Jack t :. (u :. v)) := a) -> (Jack t :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Jack t :. (u :. (v :. w))) := a) -> (Jack t :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Jack t :. u) := a) -> (a -> b) -> (Jack t :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Jack t :. (u :. v)) := a) -> (a -> b) -> (Jack t :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Jack t :. (u :. (v :. w))) := a) -> (a -> b) -> (Jack t :. (u :. (v :. w))) := b

(.#..) :: (Jack t ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Jack t ~ v a, Jack t ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Jack t ~ v a, Jack t ~ v b, Jack t ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Jack t :. u) := a) -> (Jack t :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Jack t :. (u :. v)) := a) -> (Jack t :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Jack t :. (u :. (v :. w))) := a) -> (Jack t :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Jack t :. u) := a) -> b -> (Jack t :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Jack t :. (u :. v)) := a) -> b -> (Jack t :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Jack t :. (u :. (v :. w))) := a) -> b -> (Jack t :. (u :. (v :. w))) := b

Covariant (Product s)

Defined in Pandora.Paradigm.Primary.Functor.Product

Methods

(<$>) :: (a -> b) -> Product s a -> Product s b

comap :: (a -> b) -> Product s a -> Product s b

(<$) :: a -> Product s b -> Product s a

($>) :: Product s a -> b -> Product s b

void :: Product s a -> Product s ()

loeb :: Product s (a <:= Product s) -> Product s a

(<&>) :: Product s a -> (a -> b) -> Product s b

(<$$>) :: Covariant u => (a -> b) -> ((Product s :. u) := a) -> (Product s :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Product s :. (u :. v)) := a) -> (Product s :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Product s :. (u :. (v :. w))) := a) -> (Product s :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Product s :. u) := a) -> (a -> b) -> (Product s :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Product s :. (u :. v)) := a) -> (a -> b) -> (Product s :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Product s :. (u :. (v :. w))) := a) -> (a -> b) -> (Product s :. (u :. (v :. w))) := b

(.#..) :: (Product s ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Product s ~ v a, Product s ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Product s ~ v a, Product s ~ v b, Product s ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Product s :. u) := a) -> (Product s :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Product s :. (u :. v)) := a) -> (Product s :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Product s :. (u :. (v :. w))) := a) -> (Product s :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Product s :. u) := a) -> b -> (Product s :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Product s :. (u :. v)) := a) -> b -> (Product s :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Product s :. (u :. (v :. w))) := a) -> b -> (Product s :. (u :. (v :. w))) := b

Covariant (Outline t)

Defined in Pandora.Paradigm.Primary.Transformer.Outline

Methods

(<$>) :: (a -> b) -> Outline t a -> Outline t b

comap :: (a -> b) -> Outline t a -> Outline t b

(<$) :: a -> Outline t b -> Outline t a

($>) :: Outline t a -> b -> Outline t b

void :: Outline t a -> Outline t ()

loeb :: Outline t (a <:= Outline t) -> Outline t a

(<&>) :: Outline t a -> (a -> b) -> Outline t b

(<$$>) :: Covariant u => (a -> b) -> ((Outline t :. u) := a) -> (Outline t :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Outline t :. (u :. v)) := a) -> (Outline t :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Outline t :. (u :. (v :. w))) := a) -> (Outline t :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Outline t :. u) := a) -> (a -> b) -> (Outline t :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Outline t :. (u :. v)) := a) -> (a -> b) -> (Outline t :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Outline t :. (u :. (v :. w))) := a) -> (a -> b) -> (Outline t :. (u :. (v :. w))) := b

(.#..) :: (Outline t ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Outline t ~ v a, Outline t ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Outline t ~ v a, Outline t ~ v b, Outline t ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Outline t :. u) := a) -> (Outline t :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Outline t :. (u :. v)) := a) -> (Outline t :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Outline t :. (u :. (v :. w))) := a) -> (Outline t :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Outline t :. u) := a) -> b -> (Outline t :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Outline t :. (u :. v)) := a) -> b -> (Outline t :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Outline t :. (u :. (v :. w))) := a) -> b -> (Outline t :. (u :. (v :. w))) := b

Covariant t => Covariant (Tap t)

Defined in Pandora.Paradigm.Primary.Transformer.Tap

Methods

(<$>) :: (a -> b) -> Tap t a -> Tap t b

comap :: (a -> b) -> Tap t a -> Tap t b

(<$) :: a -> Tap t b -> Tap t a

($>) :: Tap t a -> b -> Tap t b

void :: Tap t a -> Tap t ()

loeb :: Tap t (a <:= Tap t) -> Tap t a

(<&>) :: Tap t a -> (a -> b) -> Tap t b

(<$$>) :: Covariant u => (a -> b) -> ((Tap t :. u) := a) -> (Tap t :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Tap t :. (u :. v)) := a) -> (Tap t :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Tap t :. (u :. (v :. w))) := a) -> (Tap t :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Tap t :. u) := a) -> (a -> b) -> (Tap t :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Tap t :. (u :. v)) := a) -> (a -> b) -> (Tap t :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Tap t :. (u :. (v :. w))) := a) -> (a -> b) -> (Tap t :. (u :. (v :. w))) := b

(.#..) :: (Tap t ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Tap t ~ v a, Tap t ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Tap t ~ v a, Tap t ~ v b, Tap t ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Tap t :. u) := a) -> (Tap t :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Tap t :. (u :. v)) := a) -> (Tap t :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Tap t :. (u :. (v :. w))) := a) -> (Tap t :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Tap t :. u) := a) -> b -> (Tap t :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Tap t :. (u :. v)) := a) -> b -> (Tap t :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Tap t :. (u :. (v :. w))) := a) -> b -> (Tap t :. (u :. (v :. w))) := b

Covariant t => Covariant (Instruction t)

Defined in Pandora.Paradigm.Primary.Transformer.Instruction

Methods

(<$>) :: (a -> b) -> Instruction t a -> Instruction t b

comap :: (a -> b) -> Instruction t a -> Instruction t b

(<$) :: a -> Instruction t b -> Instruction t a

($>) :: Instruction t a -> b -> Instruction t b

void :: Instruction t a -> Instruction t ()

loeb :: Instruction t (a <:= Instruction t) -> Instruction t a

(<&>) :: Instruction t a -> (a -> b) -> Instruction t b

(<$$>) :: Covariant u => (a -> b) -> ((Instruction t :. u) := a) -> (Instruction t :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Instruction t :. (u :. v)) := a) -> (Instruction t :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Instruction t :. (u :. (v :. w))) := a) -> (Instruction t :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Instruction t :. u) := a) -> (a -> b) -> (Instruction t :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Instruction t :. (u :. v)) := a) -> (a -> b) -> (Instruction t :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Instruction t :. (u :. (v :. w))) := a) -> (a -> b) -> (Instruction t :. (u :. (v :. w))) := b

(.#..) :: (Instruction t ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Instruction t ~ v a, Instruction t ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Instruction t ~ v a, Instruction t ~ v b, Instruction t ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Instruction t :. u) := a) -> (Instruction t :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Instruction t :. (u :. v)) := a) -> (Instruction t :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Instruction t :. (u :. (v :. w))) := a) -> (Instruction t :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Instruction t :. u) := a) -> b -> (Instruction t :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Instruction t :. (u :. v)) := a) -> b -> (Instruction t :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Instruction t :. (u :. (v :. w))) := a) -> b -> (Instruction t :. (u :. (v :. w))) := b

Covariant t => Covariant (Construction t)

Defined in Pandora.Paradigm.Primary.Transformer.Construction

Methods

(<$>) :: (a -> b) -> Construction t a -> Construction t b

comap :: (a -> b) -> Construction t a -> Construction t b

(<$) :: a -> Construction t b -> Construction t a

($>) :: Construction t a -> b -> Construction t b

void :: Construction t a -> Construction t ()

loeb :: Construction t (a <:= Construction t) -> Construction t a

(<&>) :: Construction t a -> (a -> b) -> Construction t b

(<$$>) :: Covariant u => (a -> b) -> ((Construction t :. u) := a) -> (Construction t :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Construction t :. (u :. v)) := a) -> (Construction t :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Construction t :. (u :. (v :. w))) := a) -> (Construction t :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Construction t :. u) := a) -> (a -> b) -> (Construction t :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Construction t :. (u :. v)) := a) -> (a -> b) -> (Construction t :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Construction t :. (u :. (v :. w))) := a) -> (a -> b) -> (Construction t :. (u :. (v :. w))) := b

(.#..) :: (Construction t ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Construction t ~ v a, Construction t ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Construction t ~ v a, Construction t ~ v b, Construction t ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Construction t :. u) := a) -> (Construction t :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Construction t :. (u :. v)) := a) -> (Construction t :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Construction t :. (u :. (v :. w))) := a) -> (Construction t :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Construction t :. u) := a) -> b -> (Construction t :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Construction t :. (u :. v)) := a) -> b -> (Construction t :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Construction t :. (u :. (v :. w))) := a) -> b -> (Construction t :. (u :. (v :. w))) := b

Covariant (Conclusion e)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

(<$>) :: (a -> b) -> Conclusion e a -> Conclusion e b

comap :: (a -> b) -> Conclusion e a -> Conclusion e b

(<$) :: a -> Conclusion e b -> Conclusion e a

($>) :: Conclusion e a -> b -> Conclusion e b

void :: Conclusion e a -> Conclusion e ()

loeb :: Conclusion e (a <:= Conclusion e) -> Conclusion e a

(<&>) :: Conclusion e a -> (a -> b) -> Conclusion e b

(<$$>) :: Covariant u => (a -> b) -> ((Conclusion e :. u) := a) -> (Conclusion e :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Conclusion e :. (u :. v)) := a) -> (Conclusion e :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Conclusion e :. (u :. (v :. w))) := a) -> (Conclusion e :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Conclusion e :. u) := a) -> (a -> b) -> (Conclusion e :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Conclusion e :. (u :. v)) := a) -> (a -> b) -> (Conclusion e :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Conclusion e :. (u :. (v :. w))) := a) -> (a -> b) -> (Conclusion e :. (u :. (v :. w))) := b

(.#..) :: (Conclusion e ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Conclusion e ~ v a, Conclusion e ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e0 -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e0

(.#....) :: (Conclusion e ~ v a, Conclusion e ~ v b, Conclusion e ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e0 f -> ((v a :. (v b :. (v c :. v d))) := e0) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Conclusion e :. u) := a) -> (Conclusion e :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Conclusion e :. (u :. v)) := a) -> (Conclusion e :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Conclusion e :. (u :. (v :. w))) := a) -> (Conclusion e :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Conclusion e :. u) := a) -> b -> (Conclusion e :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Conclusion e :. (u :. v)) := a) -> b -> (Conclusion e :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Conclusion e :. (u :. (v :. w))) := a) -> b -> (Conclusion e :. (u :. (v :. w))) := b

Covariant (t <:.> Construction t) => Covariant (Comprehension t)

Defined in Pandora.Paradigm.Structure.Modification.Comprehension

Methods

(<$>) :: (a -> b) -> Comprehension t a -> Comprehension t b

comap :: (a -> b) -> Comprehension t a -> Comprehension t b

(<$) :: a -> Comprehension t b -> Comprehension t a

($>) :: Comprehension t a -> b -> Comprehension t b

void :: Comprehension t a -> Comprehension t ()

loeb :: Comprehension t (a <:= Comprehension t) -> Comprehension t a

(<&>) :: Comprehension t a -> (a -> b) -> Comprehension t b

(<$$>) :: Covariant u => (a -> b) -> ((Comprehension t :. u) := a) -> (Comprehension t :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Comprehension t :. (u :. v)) := a) -> (Comprehension t :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Comprehension t :. (u :. (v :. w))) := a) -> (Comprehension t :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Comprehension t :. u) := a) -> (a -> b) -> (Comprehension t :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Comprehension t :. (u :. v)) := a) -> (a -> b) -> (Comprehension t :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Comprehension t :. (u :. (v :. w))) := a) -> (a -> b) -> (Comprehension t :. (u :. (v :. w))) := b

(.#..) :: (Comprehension t ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Comprehension t ~ v a, Comprehension t ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Comprehension t ~ v a, Comprehension t ~ v b, Comprehension t ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Comprehension t :. u) := a) -> (Comprehension t :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Comprehension t :. (u :. v)) := a) -> (Comprehension t :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Comprehension t :. (u :. (v :. w))) := a) -> (Comprehension t :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Comprehension t :. u) := a) -> b -> (Comprehension t :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Comprehension t :. (u :. v)) := a) -> b -> (Comprehension t :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Comprehension t :. (u :. (v :. w))) := a) -> b -> (Comprehension t :. (u :. (v :. w))) := b

Covariant (Store s)

Defined in Pandora.Paradigm.Inventory.Store

Methods

(<$>) :: (a -> b) -> Store s a -> Store s b

comap :: (a -> b) -> Store s a -> Store s b

(<$) :: a -> Store s b -> Store s a

($>) :: Store s a -> b -> Store s b

void :: Store s a -> Store s ()

loeb :: Store s (a <:= Store s) -> Store s a

(<&>) :: Store s a -> (a -> b) -> Store s b

(<$$>) :: Covariant u => (a -> b) -> ((Store s :. u) := a) -> (Store s :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Store s :. (u :. v)) := a) -> (Store s :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Store s :. (u :. (v :. w))) := a) -> (Store s :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Store s :. u) := a) -> (a -> b) -> (Store s :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Store s :. (u :. v)) := a) -> (a -> b) -> (Store s :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Store s :. (u :. (v :. w))) := a) -> (a -> b) -> (Store s :. (u :. (v :. w))) := b

(.#..) :: (Store s ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Store s ~ v a, Store s ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Store s ~ v a, Store s ~ v b, Store s ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Store s :. u) := a) -> (Store s :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Store s :. (u :. v)) := a) -> (Store s :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Store s :. (u :. (v :. w))) := a) -> (Store s :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Store s :. u) := a) -> b -> (Store s :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Store s :. (u :. v)) := a) -> b -> (Store s :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Store s :. (u :. (v :. w))) := a) -> b -> (Store s :. (u :. (v :. w))) := b

Covariant (State s)

Defined in Pandora.Paradigm.Inventory.State

Methods

(<$>) :: (a -> b) -> State s a -> State s b

comap :: (a -> b) -> State s a -> State s b

(<$) :: a -> State s b -> State s a

($>) :: State s a -> b -> State s b

void :: State s a -> State s ()

loeb :: State s (a <:= State s) -> State s a

(<&>) :: State s a -> (a -> b) -> State s b

(<$$>) :: Covariant u => (a -> b) -> ((State s :. u) := a) -> (State s :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((State s :. (u :. v)) := a) -> (State s :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((State s :. (u :. (v :. w))) := a) -> (State s :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((State s :. u) := a) -> (a -> b) -> (State s :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((State s :. (u :. v)) := a) -> (a -> b) -> (State s :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((State s :. (u :. (v :. w))) := a) -> (a -> b) -> (State s :. (u :. (v :. w))) := b

(.#..) :: (State s ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (State s ~ v a, State s ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (State s ~ v a, State s ~ v b, State s ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((State s :. u) := a) -> (State s :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((State s :. (u :. v)) := a) -> (State s :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((State s :. (u :. (v :. w))) := a) -> (State s :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((State s :. u) := a) -> b -> (State s :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((State s :. (u :. v)) := a) -> b -> (State s :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((State s :. (u :. (v :. w))) := a) -> b -> (State s :. (u :. (v :. w))) := b

Covariant (Imprint e)

Defined in Pandora.Paradigm.Inventory.Imprint

Methods

(<$>) :: (a -> b) -> Imprint e a -> Imprint e b

comap :: (a -> b) -> Imprint e a -> Imprint e b

(<$) :: a -> Imprint e b -> Imprint e a

($>) :: Imprint e a -> b -> Imprint e b

void :: Imprint e a -> Imprint e ()

loeb :: Imprint e (a <:= Imprint e) -> Imprint e a

(<&>) :: Imprint e a -> (a -> b) -> Imprint e b

(<$$>) :: Covariant u => (a -> b) -> ((Imprint e :. u) := a) -> (Imprint e :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Imprint e :. (u :. v)) := a) -> (Imprint e :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Imprint e :. (u :. (v :. w))) := a) -> (Imprint e :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Imprint e :. u) := a) -> (a -> b) -> (Imprint e :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Imprint e :. (u :. v)) := a) -> (a -> b) -> (Imprint e :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Imprint e :. (u :. (v :. w))) := a) -> (a -> b) -> (Imprint e :. (u :. (v :. w))) := b

(.#..) :: (Imprint e ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Imprint e ~ v a, Imprint e ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e0 -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e0

(.#....) :: (Imprint e ~ v a, Imprint e ~ v b, Imprint e ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e0 f -> ((v a :. (v b :. (v c :. v d))) := e0) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Imprint e :. u) := a) -> (Imprint e :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Imprint e :. (u :. v)) := a) -> (Imprint e :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Imprint e :. (u :. (v :. w))) := a) -> (Imprint e :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Imprint e :. u) := a) -> b -> (Imprint e :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Imprint e :. (u :. v)) := a) -> b -> (Imprint e :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Imprint e :. (u :. (v :. w))) := a) -> b -> (Imprint e :. (u :. (v :. w))) := b

Covariant (Equipment e)

Defined in Pandora.Paradigm.Inventory.Equipment

Methods

(<$>) :: (a -> b) -> Equipment e a -> Equipment e b

comap :: (a -> b) -> Equipment e a -> Equipment e b

(<$) :: a -> Equipment e b -> Equipment e a

($>) :: Equipment e a -> b -> Equipment e b

void :: Equipment e a -> Equipment e ()

loeb :: Equipment e (a <:= Equipment e) -> Equipment e a

(<&>) :: Equipment e a -> (a -> b) -> Equipment e b

(<$$>) :: Covariant u => (a -> b) -> ((Equipment e :. u) := a) -> (Equipment e :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Equipment e :. (u :. v)) := a) -> (Equipment e :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Equipment e :. (u :. (v :. w))) := a) -> (Equipment e :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Equipment e :. u) := a) -> (a -> b) -> (Equipment e :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Equipment e :. (u :. v)) := a) -> (a -> b) -> (Equipment e :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Equipment e :. (u :. (v :. w))) := a) -> (a -> b) -> (Equipment e :. (u :. (v :. w))) := b

(.#..) :: (Equipment e ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Equipment e ~ v a, Equipment e ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e0 -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e0

(.#....) :: (Equipment e ~ v a, Equipment e ~ v b, Equipment e ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e0 f -> ((v a :. (v b :. (v c :. v d))) := e0) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Equipment e :. u) := a) -> (Equipment e :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Equipment e :. (u :. v)) := a) -> (Equipment e :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Equipment e :. (u :. (v :. w))) := a) -> (Equipment e :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Equipment e :. u) := a) -> b -> (Equipment e :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Equipment e :. (u :. v)) := a) -> b -> (Equipment e :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Equipment e :. (u :. (v :. w))) := a) -> b -> (Equipment e :. (u :. (v :. w))) := b

Covariant (Environment e)

Defined in Pandora.Paradigm.Inventory.Environment

Methods

(<$>) :: (a -> b) -> Environment e a -> Environment e b

comap :: (a -> b) -> Environment e a -> Environment e b

(<$) :: a -> Environment e b -> Environment e a

($>) :: Environment e a -> b -> Environment e b

void :: Environment e a -> Environment e ()

loeb :: Environment e (a <:= Environment e) -> Environment e a

(<&>) :: Environment e a -> (a -> b) -> Environment e b

(<$$>) :: Covariant u => (a -> b) -> ((Environment e :. u) := a) -> (Environment e :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Environment e :. (u :. v)) := a) -> (Environment e :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Environment e :. (u :. (v :. w))) := a) -> (Environment e :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Environment e :. u) := a) -> (a -> b) -> (Environment e :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Environment e :. (u :. v)) := a) -> (a -> b) -> (Environment e :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Environment e :. (u :. (v :. w))) := a) -> (a -> b) -> (Environment e :. (u :. (v :. w))) := b

(.#..) :: (Environment e ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Environment e ~ v a, Environment e ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e0 -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e0

(.#....) :: (Environment e ~ v a, Environment e ~ v b, Environment e ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e0 f -> ((v a :. (v b :. (v c :. v d))) := e0) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Environment e :. u) := a) -> (Environment e :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Environment e :. (u :. v)) := a) -> (Environment e :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Environment e :. (u :. (v :. w))) := a) -> (Environment e :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Environment e :. u) := a) -> b -> (Environment e :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Environment e :. (u :. v)) := a) -> b -> (Environment e :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Environment e :. (u :. (v :. w))) := a) -> b -> (Environment e :. (u :. (v :. w))) := b

Covariant (Accumulator e)

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

(<$>) :: (a -> b) -> Accumulator e a -> Accumulator e b

comap :: (a -> b) -> Accumulator e a -> Accumulator e b

(<$) :: a -> Accumulator e b -> Accumulator e a

($>) :: Accumulator e a -> b -> Accumulator e b

void :: Accumulator e a -> Accumulator e ()

loeb :: Accumulator e (a <:= Accumulator e) -> Accumulator e a

(<&>) :: Accumulator e a -> (a -> b) -> Accumulator e b

(<$$>) :: Covariant u => (a -> b) -> ((Accumulator e :. u) := a) -> (Accumulator e :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Accumulator e :. (u :. v)) := a) -> (Accumulator e :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Accumulator e :. (u :. (v :. w))) := a) -> (Accumulator e :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Accumulator e :. u) := a) -> (a -> b) -> (Accumulator e :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Accumulator e :. (u :. v)) := a) -> (a -> b) -> (Accumulator e :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Accumulator e :. (u :. (v :. w))) := a) -> (a -> b) -> (Accumulator e :. (u :. (v :. w))) := b

(.#..) :: (Accumulator e ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Accumulator e ~ v a, Accumulator e ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e0 -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e0

(.#....) :: (Accumulator e ~ v a, Accumulator e ~ v b, Accumulator e ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e0 f -> ((v a :. (v b :. (v c :. v d))) := e0) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Accumulator e :. u) := a) -> (Accumulator e :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Accumulator e :. (u :. v)) := a) -> (Accumulator e :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Accumulator e :. (u :. (v :. w))) := a) -> (Accumulator e :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Accumulator e :. u) := a) -> b -> (Accumulator e :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Accumulator e :. (u :. v)) := a) -> b -> (Accumulator e :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Accumulator e :. (u :. (v :. w))) := a) -> b -> (Accumulator e :. (u :. (v :. w))) := b

Applicative (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Methods

(<*>) :: Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) (a -> b) -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) a -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) b

apply :: Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) (a -> b) -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) a -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) b

(*>) :: Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) a -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) b -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) b

(<*) :: Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) a -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) b -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) a

forever :: Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) a -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) b

(<%>) :: Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) a -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) (a -> b) -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) b

(<**>) :: Applicative u => ((Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) :. u) := (a -> b)) -> ((Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) :. u) := a) -> (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) :. u) := b

(<***>) :: (Applicative u, Applicative v) => ((Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) :. (u :. v)) := (a -> b)) -> ((Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) :. (u :. v)) := a) -> (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) :. (u :. (v :. w))) := (a -> b)) -> ((Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) :. (u :. (v :. w))) := a) -> (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) :. (u :. (v :. w))) := b

Applicative (Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Methods

(<*>) :: Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) (a -> b) -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) a -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) b

apply :: Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) (a -> b) -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) a -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) b

(*>) :: Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) a -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) b -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) b

(<*) :: Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) a -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) b -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) a

forever :: Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) a -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) b

(<%>) :: Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) a -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) (a -> b) -> Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) b

(<**>) :: Applicative u => ((Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) :. u) := (a -> b)) -> ((Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) :. u) := a) -> (Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) :. u) := b

(<***>) :: (Applicative u, Applicative v) => ((Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) :. (u :. v)) := (a -> b)) -> ((Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) :. (u :. v)) := a) -> (Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) :. (u :. (v :. w))) := (a -> b)) -> ((Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) :. (u :. (v :. w))) := a) -> (Tap ((Comprehension Maybe <:.:> Comprehension Maybe) := (:*:)) :. (u :. (v :. w))) := b

Applicative (Tap ((List <:.:> List) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Methods

(<*>) :: Tap ((List <:.:> List) := (:*:)) (a -> b) -> Tap ((List <:.:> List) := (:*:)) a -> Tap ((List <:.:> List) := (:*:)) b

apply :: Tap ((List <:.:> List) := (:*:)) (a -> b) -> Tap ((List <:.:> List) := (:*:)) a -> Tap ((List <:.:> List) := (:*:)) b

(*>) :: Tap ((List <:.:> List) := (:*:)) a -> Tap ((List <:.:> List) := (:*:)) b -> Tap ((List <:.:> List) := (:*:)) b

(<*) :: Tap ((List <:.:> List) := (:*:)) a -> Tap ((List <:.:> List) := (:*:)) b -> Tap ((List <:.:> List) := (:*:)) a

forever :: Tap ((List <:.:> List) := (:*:)) a -> Tap ((List <:.:> List) := (:*:)) b

(<%>) :: Tap ((List <:.:> List) := (:*:)) a -> Tap ((List <:.:> List) := (:*:)) (a -> b) -> Tap ((List <:.:> List) := (:*:)) b

(<**>) :: Applicative u => ((Tap ((List <:.:> List) := (:*:)) :. u) := (a -> b)) -> ((Tap ((List <:.:> List) := (:*:)) :. u) := a) -> (Tap ((List <:.:> List) := (:*:)) :. u) := b

(<***>) :: (Applicative u, Applicative v) => ((Tap ((List <:.:> List) := (:*:)) :. (u :. v)) := (a -> b)) -> ((Tap ((List <:.:> List) := (:*:)) :. (u :. v)) := a) -> (Tap ((List <:.:> List) := (:*:)) :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((Tap ((List <:.:> List) := (:*:)) :. (u :. (v :. w))) := (a -> b)) -> ((Tap ((List <:.:> List) := (:*:)) :. (u :. (v :. w))) := a) -> (Tap ((List <:.:> List) := (:*:)) :. (u :. (v :. w))) := b

Extendable (Tap ((Stream <:.:> Stream) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.Stream

Methods

(=>>) :: Tap ((Stream <:.:> Stream) := (:*:)) a -> (Tap ((Stream <:.:> Stream) := (:*:)) a -> b) -> Tap ((Stream <:.:> Stream) := (:*:)) b

(<<=) :: (Tap ((Stream <:.:> Stream) := (:*:)) a -> b) -> Tap ((Stream <:.:> Stream) := (:*:)) a -> Tap ((Stream <:.:> Stream) := (:*:)) b

extend :: (Tap ((Stream <:.:> Stream) := (:*:)) a -> b) -> Tap ((Stream <:.:> Stream) := (:*:)) a -> Tap ((Stream <:.:> Stream) := (:*:)) b

duplicate :: Tap ((Stream <:.:> Stream) := (:*:)) a -> (Tap ((Stream <:.:> Stream) := (:*:)) :. Tap ((Stream <:.:> Stream) := (:*:))) := a

(=<=) :: (Tap ((Stream <:.:> Stream) := (:*:)) b -> c) -> (Tap ((Stream <:.:> Stream) := (:*:)) a -> b) -> Tap ((Stream <:.:> Stream) := (:*:)) a -> c

(=>=) :: (Tap ((Stream <:.:> Stream) := (:*:)) a -> b) -> (Tap ((Stream <:.:> Stream) := (:*:)) b -> c) -> Tap ((Stream <:.:> Stream) := (:*:)) a -> c

($=>>) :: Covariant u => ((u :. Tap ((Stream <:.:> Stream) := (:*:))) := a) -> (Tap ((Stream <:.:> Stream) := (:*:)) a -> b) -> (u :. Tap ((Stream <:.:> Stream) := (:*:))) := b

(<<=$) :: Covariant u => ((u :. Tap ((Stream <:.:> Stream) := (:*:))) := a) -> (Tap ((Stream <:.:> Stream) := (:*:)) a -> b) -> (u :. Tap ((Stream <:.:> Stream) := (:*:))) := b

Extendable (Tap ((List <:.:> List) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Methods

(=>>) :: Tap ((List <:.:> List) := (:*:)) a -> (Tap ((List <:.:> List) := (:*:)) a -> b) -> Tap ((List <:.:> List) := (:*:)) b

(<<=) :: (Tap ((List <:.:> List) := (:*:)) a -> b) -> Tap ((List <:.:> List) := (:*:)) a -> Tap ((List <:.:> List) := (:*:)) b

extend :: (Tap ((List <:.:> List) := (:*:)) a -> b) -> Tap ((List <:.:> List) := (:*:)) a -> Tap ((List <:.:> List) := (:*:)) b

duplicate :: Tap ((List <:.:> List) := (:*:)) a -> (Tap ((List <:.:> List) := (:*:)) :. Tap ((List <:.:> List) := (:*:))) := a

(=<=) :: (Tap ((List <:.:> List) := (:*:)) b -> c) -> (Tap ((List <:.:> List) := (:*:)) a -> b) -> Tap ((List <:.:> List) := (:*:)) a -> c

(=>=) :: (Tap ((List <:.:> List) := (:*:)) a -> b) -> (Tap ((List <:.:> List) := (:*:)) b -> c) -> Tap ((List <:.:> List) := (:*:)) a -> c

($=>>) :: Covariant u => ((u :. Tap ((List <:.:> List) := (:*:))) := a) -> (Tap ((List <:.:> List) := (:*:)) a -> b) -> (u :. Tap ((List <:.:> List) := (:*:))) := b

(<<=$) :: Covariant u => ((u :. Tap ((List <:.:> List) := (:*:))) := a) -> (Tap ((List <:.:> List) := (:*:)) a -> b) -> (u :. Tap ((List <:.:> List) := (:*:))) := b

Traversable (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Methods

(->>) :: (Pointable u, Applicative u) => Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) a -> (a -> u b) -> (u :. Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) := b

traverse :: (Pointable u, Applicative u) => (a -> u b) -> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) a -> (u :. Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) := b

sequence :: (Pointable u, Applicative u) => ((Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) :. u) := a) -> (u :. Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) := a

(->>>) :: (Pointable u, Applicative u, Traversable v) => ((v :. Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) := a) -> (a -> u b) -> (u :. (v :. Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))) := b

(->>>>) :: (Pointable u, Applicative u, Traversable v, Traversable w) => ((w :. (v :. Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))) := a) -> (a -> u b) -> (u :. (w :. (v :. Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))))) := b

(->>>>>) :: (Pointable u, Applicative u, Traversable v, Traversable w, Traversable j) => ((j :. (w :. (v :. Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))))) := a) -> (a -> u b) -> (u :. (j :. (w :. (v :. Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))))) := b

Traversable (Tap ((List <:.:> List) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Methods

(->>) :: (Pointable u, Applicative u) => Tap ((List <:.:> List) := (:*:)) a -> (a -> u b) -> (u :. Tap ((List <:.:> List) := (:*:))) := b

traverse :: (Pointable u, Applicative u) => (a -> u b) -> Tap ((List <:.:> List) := (:*:)) a -> (u :. Tap ((List <:.:> List) := (:*:))) := b

sequence :: (Pointable u, Applicative u) => ((Tap ((List <:.:> List) := (:*:)) :. u) := a) -> (u :. Tap ((List <:.:> List) := (:*:))) := a

(->>>) :: (Pointable u, Applicative u, Traversable v) => ((v :. Tap ((List <:.:> List) := (:*:))) := a) -> (a -> u b) -> (u :. (v :. Tap ((List <:.:> List) := (:*:)))) := b

(->>>>) :: (Pointable u, Applicative u, Traversable v, Traversable w) => ((w :. (v :. Tap ((List <:.:> List) := (:*:)))) := a) -> (a -> u b) -> (u :. (w :. (v :. Tap ((List <:.:> List) := (:*:))))) := b

(->>>>>) :: (Pointable u, Applicative u, Traversable v, Traversable w, Traversable j) => ((j :. (w :. (v :. Tap ((List <:.:> List) := (:*:))))) := a) -> (a -> u b) -> (u :. (j :. (w :. (v :. Tap ((List <:.:> List) := (:*:)))))) := b

Semigroup (List a)

Defined in Pandora.Paradigm.Structure.Some.List

Methods

(+) :: List a -> List a -> List a

Monoid (List a)

Defined in Pandora.Paradigm.Structure.Some.List

Methods

zero :: List a

Setoid a => Setoid (List a)

Defined in Pandora.Paradigm.Structure.Some.List

Methods

(==) :: List a -> List a -> Boolean

(!=) :: List a -> List a -> Boolean

Nullable List

Defined in Pandora.Paradigm.Structure.Some.List

Methods

null :: forall (a :: k). (Predicate :. List) := a

Nullable Rose

Defined in Pandora.Paradigm.Structure.Some.Rose

Methods

null :: forall (a :: k). (Predicate :. Rose) := a

Nullable Binary

Defined in Pandora.Paradigm.Structure.Some.Binary

Methods

null :: forall (a :: k). (Predicate :. Binary) := a

Monad u => Catchable e (Conclusion e <.:> u :: Type -> Type)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

catch :: forall (a :: k). (Conclusion e <.:> u) a -> (e -> (Conclusion e <.:> u) a) -> (Conclusion e <.:> u) a

Morphable ('Into (Tap ((List <:.:> List) := (:*:)))) List

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Morphing ('Into (Tap ((List <:.:> List) := (:*:)))) List :: Type -> Type

Methods

morphing :: (Tagged ('Into (Tap ((List <:.:> List) := (:*:)))) <:.> List) ~> Morphing ('Into (Tap ((List <:.:> List) := (:*:)))) List

Morphable ('Delete ('All :: a -> Occurrence a) :: Morph (a -> Occurrence a)) List

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Morphing ('Delete 'All) List :: Type -> Type

Methods

morphing :: (Tagged ('Delete 'All) <:.> List) ~> Morphing ('Delete 'All) List

Morphable ('Delete ('First :: a -> Occurrence a) :: Morph (a -> Occurrence a)) List

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Morphing ('Delete 'First) List :: Type -> Type

Methods

morphing :: (Tagged ('Delete 'First) <:.> List) ~> Morphing ('Delete 'First) List

Morphable ('Find ('Element :: a -> Morph a) :: Morph (a -> Morph a)) List

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Morphing ('Find 'Element) List :: Type -> Type

Methods

morphing :: (Tagged ('Find 'Element) <:.> List) ~> Morphing ('Find 'Element) List

Morphable ('Into (o ds)) (Construction Wye) => Morphable ('Into (o ds) :: Morph a) Binary

Defined in Pandora.Paradigm.Structure

Associated Types

type Morphing ('Into (o ds)) Binary :: Type -> Type

Methods

morphing :: (Tagged ('Into (o ds)) <:.> Binary) ~> Morphing ('Into (o ds)) Binary

Morphable ('Into (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))) (Tap ((List <:.:> List) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Morphing ('Into (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))) (Tap ((List <:.:> List) := (:*:))) :: Type -> Type

Methods

morphing :: (Tagged ('Into (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))) <:.> Tap ((List <:.:> List) := (:*:))) ~> Morphing ('Into (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))) (Tap ((List <:.:> List) := (:*:)))

Morphable ('Into (Tap ((List <:.:> List) := (:*:)))) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Morphing ('Into (Tap ((List <:.:> List) := (:*:)))) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) :: Type -> Type

Methods

morphing :: (Tagged ('Into (Tap ((List <:.:> List) := (:*:)))) <:.> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) ~> Morphing ('Into (Tap ((List <:.:> List) := (:*:)))) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Morphable ('Into (Tap ((List <:.:> List) := (:*:)))) (Construction Maybe)

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Morphing ('Into (Tap ((List <:.:> List) := (:*:)))) (Construction Maybe) :: Type -> Type

Methods

morphing :: (Tagged ('Into (Tap ((List <:.:> List) := (:*:)))) <:.> Construction Maybe) ~> Morphing ('Into (Tap ((List <:.:> List) := (:*:)))) (Construction Maybe)

Morphable ('Into (Construction Maybe)) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Morphing ('Into (Construction Maybe)) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) :: Type -> Type

Methods

morphing :: (Tagged ('Into (Construction Maybe)) <:.> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) ~> Morphing ('Into (Construction Maybe)) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Morphable ('Into (Comprehension Maybe)) (Tap ((List <:.:> List) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Morphing ('Into (Comprehension Maybe)) (Tap ((List <:.:> List) := (:*:))) :: Type -> Type

Methods

morphing :: (Tagged ('Into (Comprehension Maybe)) <:.> Tap ((List <:.:> List) := (:*:))) ~> Morphing ('Into (Comprehension Maybe)) (Tap ((List <:.:> List) := (:*:)))

Morphable ('Into List) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Morphing ('Into List) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) :: Type -> Type

Methods

morphing :: (Tagged ('Into List) <:.> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) ~> Morphing ('Into List) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Morphable ('Into List) (Tap ((List <:.:> List) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Morphing ('Into List) (Tap ((List <:.:> List) := (:*:))) :: Type -> Type

Methods

morphing :: (Tagged ('Into List) <:.> Tap ((List <:.:> List) := (:*:))) ~> Morphing ('Into List) (Tap ((List <:.:> List) := (:*:)))

Morphable ('Into List) (Construction Maybe)

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Morphing ('Into List) (Construction Maybe) :: Type -> Type

Methods

morphing :: (Tagged ('Into List) <:.> Construction Maybe) ~> Morphing ('Into List) (Construction Maybe)

Morphable ('Into List) (Vector r)

Defined in Pandora.Paradigm.Primary.Linear.Vector

Associated Types

type Morphing ('Into List) (Vector r) :: Type -> Type

Methods

morphing :: (Tagged ('Into List) <:.> Vector r) ~> Morphing ('Into List) (Vector r)

Morphable ('Into Binary) (Construction Wye)

Defined in Pandora.Paradigm.Structure.Some.Binary

Associated Types

type Morphing ('Into Binary) (Construction Wye) :: Type -> Type

Methods

morphing :: (Tagged ('Into Binary) <:.> Construction Wye) ~> Morphing ('Into Binary) (Construction Wye)

Morphable ('Rotate ('Right :: a -> Wye a) :: Morph (a -> Wye a)) (Tap ((Stream <:.:> Stream) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.Stream

Associated Types

type Morphing ('Rotate 'Right) (Tap ((Stream <:.:> Stream) := (:*:))) :: Type -> Type

Methods

morphing :: (Tagged ('Rotate 'Right) <:.> Tap ((Stream <:.:> Stream) := (:*:))) ~> Morphing ('Rotate 'Right) (Tap ((Stream <:.:> Stream) := (:*:)))

Morphable ('Rotate ('Left :: a -> Wye a) :: Morph (a -> Wye a)) (Tap ((Stream <:.:> Stream) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.Stream

Associated Types

type Morphing ('Rotate 'Left) (Tap ((Stream <:.:> Stream) := (:*:))) :: Type -> Type

Methods

morphing :: (Tagged ('Rotate 'Left) <:.> Tap ((Stream <:.:> Stream) := (:*:))) ~> Morphing ('Rotate 'Left) (Tap ((Stream <:.:> Stream) := (:*:)))

Morphable ('Rotate ('Right :: a -> Wye a) :: Morph (a -> Wye a)) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Morphing ('Rotate 'Right) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) :: Type -> Type

Methods

morphing :: (Tagged ('Rotate 'Right) <:.> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) ~> Morphing ('Rotate 'Right) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Morphable ('Rotate ('Left :: a -> Wye a) :: Morph (a -> Wye a)) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Morphing ('Rotate 'Left) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) :: Type -> Type

Methods

morphing :: (Tagged ('Rotate 'Left) <:.> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) ~> Morphing ('Rotate 'Left) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Morphable ('Rotate ('Right :: a -> Wye a) :: Morph (a -> Wye a)) (Tap ((List <:.:> List) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Morphing ('Rotate 'Right) (Tap ((List <:.:> List) := (:*:))) :: Type -> Type

Methods

morphing :: (Tagged ('Rotate 'Right) <:.> Tap ((List <:.:> List) := (:*:))) ~> Morphing ('Rotate 'Right) (Tap ((List <:.:> List) := (:*:)))

Morphable ('Rotate ('Left :: a -> Wye a) :: Morph (a -> Wye a)) (Tap ((List <:.:> List) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Morphing ('Rotate 'Left) (Tap ((List <:.:> List) := (:*:))) :: Type -> Type

Methods

morphing :: (Tagged ('Rotate 'Left) <:.> Tap ((List <:.:> List) := (:*:))) ~> Morphing ('Rotate 'Left) (Tap ((List <:.:> List) := (:*:)))

Setoid key => Morphable ('Lookup ('Key :: a -> Morph a) :: Morph (a -> Morph a)) (Prefixed List key)

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Morphing ('Lookup 'Key) (Prefixed List key) :: Type -> Type

Methods

morphing :: (Tagged ('Lookup 'Key) <:.> Prefixed List key) ~> Morphing ('Lookup 'Key) (Prefixed List key)

Setoid k => Morphable ('Vary ('Element :: a -> Morph a) :: Morph (a -> Morph a)) (Prefixed (Construction List) k)

Defined in Pandora.Paradigm.Structure.Some.Rose

Associated Types

type Morphing ('Vary 'Element) (Prefixed (Construction List) k) :: Type -> Type

Methods

morphing :: (Tagged ('Vary 'Element) <:.> Prefixed (Construction List) k) ~> Morphing ('Vary 'Element) (Prefixed (Construction List) k)

Setoid k => Morphable ('Vary ('Element :: a -> Morph a) :: Morph (a -> Morph a)) (Prefixed Rose k)

Defined in Pandora.Paradigm.Structure.Some.Rose

Associated Types

type Morphing ('Vary 'Element) (Prefixed Rose k) :: Type -> Type

Methods

morphing :: (Tagged ('Vary 'Element) <:.> Prefixed Rose k) ~> Morphing ('Vary 'Element) (Prefixed Rose k)

Setoid k => Morphable ('Lookup ('Key :: a -> Morph a) :: Morph (a -> Morph a)) (Prefixed Rose k)

Defined in Pandora.Paradigm.Structure.Some.Rose

Associated Types

type Morphing ('Lookup 'Key) (Prefixed Rose k) :: Type -> Type

Methods

morphing :: (Tagged ('Lookup 'Key) <:.> Prefixed Rose k) ~> Morphing ('Lookup 'Key) (Prefixed Rose k)

Chain k => Morphable ('Vary ('Element :: a -> Morph a) :: Morph (a -> Morph a)) (Prefixed Binary k)

Defined in Pandora.Paradigm.Structure.Some.Binary

Associated Types

type Morphing ('Vary 'Element) (Prefixed Binary k) :: Type -> Type

Methods

morphing :: (Tagged ('Vary 'Element) <:.> Prefixed Binary k) ~> Morphing ('Vary 'Element) (Prefixed Binary k)

Chain k => Morphable ('Lookup ('Key :: a -> Morph a) :: Morph (a -> Morph a)) (Prefixed Binary k)

Defined in Pandora.Paradigm.Structure.Some.Binary

Associated Types

type Morphing ('Lookup 'Key) (Prefixed Binary k) :: Type -> Type

Methods

morphing :: (Tagged ('Lookup 'Key) <:.> Prefixed Binary k) ~> Morphing ('Lookup 'Key) (Prefixed Binary k)

Morphable ('Into Wye) ((Maybe <:.:> Maybe) := (:*:))

Defined in Pandora.Paradigm.Primary

Associated Types

type Morphing ('Into Wye) ((Maybe <:.:> Maybe) := (:*:)) :: Type -> Type

Methods

morphing :: (Tagged ('Into Wye) <:.> ((Maybe <:.:> Maybe) := (:*:))) ~> Morphing ('Into Wye) ((Maybe <:.:> Maybe) := (:*:))

Morphable ('Rotate ('Up :: a -> Vertical a) :: Morph (a -> Vertical a)) ((Construction Wye <:.:> (Bifurcation <:.> Bicursor)) := (:*:))

Defined in Pandora.Paradigm.Structure.Some.Binary

Associated Types

type Morphing ('Rotate 'Up) ((Construction Wye <:.:> (Bifurcation <:.> Bicursor)) := (:*:)) :: Type -> Type

Methods

morphing :: (Tagged ('Rotate 'Up) <:.> ((Construction Wye <:.:> (Bifurcation <:.> Bicursor)) := (:*:))) ~> Morphing ('Rotate 'Up) ((Construction Wye <:.:> (Bifurcation <:.> Bicursor)) := (:*:))

Morphable ('Rotate ('Down ('Right :: a -> Wye a)) :: Morph (Vertical (a -> Wye a))) ((Construction Wye <:.:> (Bifurcation <:.> Bicursor)) := (:*:))

Defined in Pandora.Paradigm.Structure.Some.Binary

Associated Types

type Morphing ('Rotate ('Down 'Right)) ((Construction Wye <:.:> (Bifurcation <:.> Bicursor)) := (:*:)) :: Type -> Type

Methods

morphing :: (Tagged ('Rotate ('Down 'Right)) <:.> ((Construction Wye <:.:> (Bifurcation <:.> Bicursor)) := (:*:))) ~> Morphing ('Rotate ('Down 'Right)) ((Construction Wye <:.:> (Bifurcation <:.> Bicursor)) := (:*:))

Morphable ('Rotate ('Down ('Left :: a -> Wye a)) :: Morph (Vertical (a -> Wye a))) ((Construction Wye <:.:> (Bifurcation <:.> Bicursor)) := (:*:))

Defined in Pandora.Paradigm.Structure.Some.Binary

Associated Types

type Morphing ('Rotate ('Down 'Left)) ((Construction Wye <:.:> (Bifurcation <:.> Bicursor)) := (:*:)) :: Type -> Type

Methods

morphing :: (Tagged ('Rotate ('Down 'Left)) <:.> ((Construction Wye <:.:> (Bifurcation <:.> Bicursor)) := (:*:))) ~> Morphing ('Rotate ('Down 'Left)) ((Construction Wye <:.:> (Bifurcation <:.> Bicursor)) := (:*:))

Covariant t => Hoistable (TU Covariant Covariant t :: (Type -> Type) -> Type -> Type)

Defined in Pandora.Paradigm.Schemes.TU

Methods

(/|\) :: forall (u :: Type -> Type) (v :: Type -> Type). Covariant u => (u ~> v) -> TU Covariant Covariant t u ~> TU Covariant Covariant t v

hoist :: forall (u :: Type -> Type) (v :: Type -> Type). Covariant u => (u ~> v) -> TU Covariant Covariant t u ~> TU Covariant Covariant t v

Covariant (Tagged tag)

Defined in Pandora.Paradigm.Primary.Functor.Tagged

Methods

(<$>) :: (a -> b) -> Tagged tag a -> Tagged tag b

comap :: (a -> b) -> Tagged tag a -> Tagged tag b

(<$) :: a -> Tagged tag b -> Tagged tag a

($>) :: Tagged tag a -> b -> Tagged tag b

void :: Tagged tag a -> Tagged tag ()

loeb :: Tagged tag (a <:= Tagged tag) -> Tagged tag a

(<&>) :: Tagged tag a -> (a -> b) -> Tagged tag b

(<$$>) :: Covariant u => (a -> b) -> ((Tagged tag :. u) := a) -> (Tagged tag :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Tagged tag :. (u :. v)) := a) -> (Tagged tag :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Tagged tag :. (u :. (v :. w))) := a) -> (Tagged tag :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Tagged tag :. u) := a) -> (a -> b) -> (Tagged tag :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Tagged tag :. (u :. v)) := a) -> (a -> b) -> (Tagged tag :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Tagged tag :. (u :. (v :. w))) := a) -> (a -> b) -> (Tagged tag :. (u :. (v :. w))) := b

(.#..) :: (Tagged tag ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Tagged tag ~ v a, Tagged tag ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Tagged tag ~ v a, Tagged tag ~ v b, Tagged tag ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Tagged tag :. u) := a) -> (Tagged tag :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Tagged tag :. (u :. v)) := a) -> (Tagged tag :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Tagged tag :. (u :. (v :. w))) := a) -> (Tagged tag :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Tagged tag :. u) := a) -> b -> (Tagged tag :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Tagged tag :. (u :. v)) := a) -> b -> (Tagged tag :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Tagged tag :. (u :. (v :. w))) := a) -> b -> (Tagged tag :. (u :. (v :. w))) := b

Covariant (Constant a :: Type -> Type)

Defined in Pandora.Paradigm.Primary.Functor.Constant

Methods

(<$>) :: (a0 -> b) -> Constant a a0 -> Constant a b

comap :: (a0 -> b) -> Constant a a0 -> Constant a b

(<$) :: a0 -> Constant a b -> Constant a a0

($>) :: Constant a a0 -> b -> Constant a b

void :: Constant a a0 -> Constant a ()

loeb :: Constant a (a0 <:= Constant a) -> Constant a a0

(<&>) :: Constant a a0 -> (a0 -> b) -> Constant a b

(<$$>) :: Covariant u => (a0 -> b) -> ((Constant a :. u) := a0) -> (Constant a :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a0 -> b) -> ((Constant a :. (u :. v)) := a0) -> (Constant a :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a0 -> b) -> ((Constant a :. (u :. (v :. w))) := a0) -> (Constant a :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Constant a :. u) := a0) -> (a0 -> b) -> (Constant a :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Constant a :. (u :. v)) := a0) -> (a0 -> b) -> (Constant a :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Constant a :. (u :. (v :. w))) := a0) -> (a0 -> b) -> (Constant a :. (u :. (v :. w))) := b

(.#..) :: (Constant a ~ v a0, Category v) => v c d -> ((v a0 :. v b) := c) -> (v a0 :. v b) := d

(.#...) :: (Constant a ~ v a0, Constant a ~ v b, Category v, Covariant (v a0), Covariant (v b)) => v d e -> ((v a0 :. (v b :. v c)) := d) -> (v a0 :. (v b :. v c)) := e

(.#....) :: (Constant a ~ v a0, Constant a ~ v b, Constant a ~ v c, Category v, Covariant (v a0), Covariant (v b), Covariant (v c)) => v e f -> ((v a0 :. (v b :. (v c :. v d))) := e) -> (v a0 :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Constant a :. u) := a0) -> (Constant a :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Constant a :. (u :. v)) := a0) -> (Constant a :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Constant a :. (u :. (v :. w))) := a0) -> (Constant a :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Constant a :. u) := a0) -> b -> (Constant a :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Constant a :. (u :. v)) := a0) -> b -> (Constant a :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Constant a :. (u :. (v :. w))) := a0) -> b -> (Constant a :. (u :. (v :. w))) := b

Covariant (Flip (:*:) a)

Defined in Pandora.Paradigm.Primary

Methods

(<$>) :: (a0 -> b) -> Flip (:*:) a a0 -> Flip (:*:) a b

comap :: (a0 -> b) -> Flip (:*:) a a0 -> Flip (:*:) a b

(<$) :: a0 -> Flip (:*:) a b -> Flip (:*:) a a0

($>) :: Flip (:*:) a a0 -> b -> Flip (:*:) a b

void :: Flip (:*:) a a0 -> Flip (:*:) a ()

loeb :: Flip (:*:) a (a0 <:= Flip (:*:) a) -> Flip (:*:) a a0

(<&>) :: Flip (:*:) a a0 -> (a0 -> b) -> Flip (:*:) a b

(<$$>) :: Covariant u => (a0 -> b) -> ((Flip (:*:) a :. u) := a0) -> (Flip (:*:) a :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a0 -> b) -> ((Flip (:*:) a :. (u :. v)) := a0) -> (Flip (:*:) a :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a0 -> b) -> ((Flip (:*:) a :. (u :. (v :. w))) := a0) -> (Flip (:*:) a :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Flip (:*:) a :. u) := a0) -> (a0 -> b) -> (Flip (:*:) a :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Flip (:*:) a :. (u :. v)) := a0) -> (a0 -> b) -> (Flip (:*:) a :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Flip (:*:) a :. (u :. (v :. w))) := a0) -> (a0 -> b) -> (Flip (:*:) a :. (u :. (v :. w))) := b

(.#..) :: (Flip (:*:) a ~ v a0, Category v) => v c d -> ((v a0 :. v b) := c) -> (v a0 :. v b) := d

(.#...) :: (Flip (:*:) a ~ v a0, Flip (:*:) a ~ v b, Category v, Covariant (v a0), Covariant (v b)) => v d e -> ((v a0 :. (v b :. v c)) := d) -> (v a0 :. (v b :. v c)) := e

(.#....) :: (Flip (:*:) a ~ v a0, Flip (:*:) a ~ v b, Flip (:*:) a ~ v c, Category v, Covariant (v a0), Covariant (v b), Covariant (v c)) => v e f -> ((v a0 :. (v b :. (v c :. v d))) := e) -> (v a0 :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Flip (:*:) a :. u) := a0) -> (Flip (:*:) a :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Flip (:*:) a :. (u :. v)) := a0) -> (Flip (:*:) a :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Flip (:*:) a :. (u :. (v :. w))) := a0) -> (Flip (:*:) a :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Flip (:*:) a :. u) := a0) -> b -> (Flip (:*:) a :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Flip (:*:) a :. (u :. v)) := a0) -> b -> (Flip (:*:) a :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Flip (:*:) a :. (u :. (v :. w))) := a0) -> b -> (Flip (:*:) a :. (u :. (v :. w))) := b

Covariant (Schematic Monad t u) => Covariant (t :> u)

Defined in Pandora.Paradigm.Controlflow.Effect.Transformer.Monadic

Methods

(<$>) :: (a -> b) -> (t :> u) a -> (t :> u) b

comap :: (a -> b) -> (t :> u) a -> (t :> u) b

(<$) :: a -> (t :> u) b -> (t :> u) a

($>) :: (t :> u) a -> b -> (t :> u) b

void :: (t :> u) a -> (t :> u) ()

loeb :: (t :> u) (a <:= (t :> u)) -> (t :> u) a

(<&>) :: (t :> u) a -> (a -> b) -> (t :> u) b

(<$$>) :: Covariant u0 => (a -> b) -> (((t :> u) :. u0) := a) -> ((t :> u) :. u0) := b

(<$$$>) :: (Covariant u0, Covariant v) => (a -> b) -> (((t :> u) :. (u0 :. v)) := a) -> ((t :> u) :. (u0 :. v)) := b

(<$$$$>) :: (Covariant u0, Covariant v, Covariant w) => (a -> b) -> (((t :> u) :. (u0 :. (v :. w))) := a) -> ((t :> u) :. (u0 :. (v :. w))) := b

(<&&>) :: Covariant u0 => (((t :> u) :. u0) := a) -> (a -> b) -> ((t :> u) :. u0) := b

(<&&&>) :: (Covariant u0, Covariant v) => (((t :> u) :. (u0 :. v)) := a) -> (a -> b) -> ((t :> u) :. (u0 :. v)) := b

(<&&&&>) :: (Covariant u0, Covariant v, Covariant w) => (((t :> u) :. (u0 :. (v :. w))) := a) -> (a -> b) -> ((t :> u) :. (u0 :. (v :. w))) := b

(.#..) :: ((t :> u) ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: ((t :> u) ~ v a, (t :> u) ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: ((t :> u) ~ v a, (t :> u) ~ v b, (t :> u) ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u0 => b -> (((t :> u) :. u0) := a) -> ((t :> u) :. u0) := b

(<$$$) :: (Covariant u0, Covariant v) => b -> (((t :> u) :. (u0 :. v)) := a) -> ((t :> u) :. (u0 :. v)) := b

(<$$$$) :: (Covariant u0, Covariant v, Covariant w) => b -> (((t :> u) :. (u0 :. (v :. w))) := a) -> ((t :> u) :. (u0 :. (v :. w))) := b

($$>) :: Covariant u0 => (((t :> u) :. u0) := a) -> b -> ((t :> u) :. u0) := b

($$$>) :: (Covariant u0, Covariant v) => (((t :> u) :. (u0 :. v)) := a) -> b -> ((t :> u) :. (u0 :. v)) := b

($$$$>) :: (Covariant u0, Covariant v, Covariant w) => (((t :> u) :. (u0 :. (v :. w))) := a) -> b -> ((t :> u) :. (u0 :. (v :. w))) := b

Covariant (Day t u)

Defined in Pandora.Paradigm.Primary.Transformer.Day

Methods

(<$>) :: (a -> b) -> Day t u a -> Day t u b

comap :: (a -> b) -> Day t u a -> Day t u b

(<$) :: a -> Day t u b -> Day t u a

($>) :: Day t u a -> b -> Day t u b

void :: Day t u a -> Day t u ()

loeb :: Day t u (a <:= Day t u) -> Day t u a

(<&>) :: Day t u a -> (a -> b) -> Day t u b

(<$$>) :: Covariant u0 => (a -> b) -> ((Day t u :. u0) := a) -> (Day t u :. u0) := b

(<$$$>) :: (Covariant u0, Covariant v) => (a -> b) -> ((Day t u :. (u0 :. v)) := a) -> (Day t u :. (u0 :. v)) := b

(<$$$$>) :: (Covariant u0, Covariant v, Covariant w) => (a -> b) -> ((Day t u :. (u0 :. (v :. w))) := a) -> (Day t u :. (u0 :. (v :. w))) := b

(<&&>) :: Covariant u0 => ((Day t u :. u0) := a) -> (a -> b) -> (Day t u :. u0) := b

(<&&&>) :: (Covariant u0, Covariant v) => ((Day t u :. (u0 :. v)) := a) -> (a -> b) -> (Day t u :. (u0 :. v)) := b

(<&&&&>) :: (Covariant u0, Covariant v, Covariant w) => ((Day t u :. (u0 :. (v :. w))) := a) -> (a -> b) -> (Day t u :. (u0 :. (v :. w))) := b

(.#..) :: (Day t u ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Day t u ~ v a, Day t u ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Day t u ~ v a, Day t u ~ v b, Day t u ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u0 => b -> ((Day t u :. u0) := a) -> (Day t u :. u0) := b

(<$$$) :: (Covariant u0, Covariant v) => b -> ((Day t u :. (u0 :. v)) := a) -> (Day t u :. (u0 :. v)) := b

(<$$$$) :: (Covariant u0, Covariant v, Covariant w) => b -> ((Day t u :. (u0 :. (v :. w))) := a) -> (Day t u :. (u0 :. (v :. w))) := b

($$>) :: Covariant u0 => ((Day t u :. u0) := a) -> b -> (Day t u :. u0) := b

($$$>) :: (Covariant u0, Covariant v) => ((Day t u :. (u0 :. v)) := a) -> b -> (Day t u :. (u0 :. v)) := b

($$$$>) :: (Covariant u0, Covariant v, Covariant w) => ((Day t u :. (u0 :. (v :. w))) := a) -> b -> (Day t u :. (u0 :. (v :. w))) := b

Covariant t => Covariant (Backwards t)

Defined in Pandora.Paradigm.Primary.Transformer.Backwards

Methods

(<$>) :: (a -> b) -> Backwards t a -> Backwards t b

comap :: (a -> b) -> Backwards t a -> Backwards t b

(<$) :: a -> Backwards t b -> Backwards t a

($>) :: Backwards t a -> b -> Backwards t b

void :: Backwards t a -> Backwards t ()

loeb :: Backwards t (a <:= Backwards t) -> Backwards t a

(<&>) :: Backwards t a -> (a -> b) -> Backwards t b

(<$$>) :: Covariant u => (a -> b) -> ((Backwards t :. u) := a) -> (Backwards t :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Backwards t :. (u :. v)) := a) -> (Backwards t :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Backwards t :. (u :. (v :. w))) := a) -> (Backwards t :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Backwards t :. u) := a) -> (a -> b) -> (Backwards t :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Backwards t :. (u :. v)) := a) -> (a -> b) -> (Backwards t :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Backwards t :. (u :. (v :. w))) := a) -> (a -> b) -> (Backwards t :. (u :. (v :. w))) := b

(.#..) :: (Backwards t ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Backwards t ~ v a, Backwards t ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Backwards t ~ v a, Backwards t ~ v b, Backwards t ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Backwards t :. u) := a) -> (Backwards t :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Backwards t :. (u :. v)) := a) -> (Backwards t :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Backwards t :. (u :. (v :. w))) := a) -> (Backwards t :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Backwards t :. u) := a) -> b -> (Backwards t :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Backwards t :. (u :. v)) := a) -> b -> (Backwards t :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Backwards t :. (u :. (v :. w))) := a) -> b -> (Backwards t :. (u :. (v :. w))) := b

Covariant t => Covariant (Reverse t)

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

(<$>) :: (a -> b) -> Reverse t a -> Reverse t b

comap :: (a -> b) -> Reverse t a -> Reverse t b

(<$) :: a -> Reverse t b -> Reverse t a

($>) :: Reverse t a -> b -> Reverse t b

void :: Reverse t a -> Reverse t ()

loeb :: Reverse t (a <:= Reverse t) -> Reverse t a

(<&>) :: Reverse t a -> (a -> b) -> Reverse t b

(<$$>) :: Covariant u => (a -> b) -> ((Reverse t :. u) := a) -> (Reverse t :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Reverse t :. (u :. v)) := a) -> (Reverse t :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Reverse t :. (u :. (v :. w))) := a) -> (Reverse t :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Reverse t :. u) := a) -> (a -> b) -> (Reverse t :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Reverse t :. (u :. v)) := a) -> (a -> b) -> (Reverse t :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Reverse t :. (u :. (v :. w))) := a) -> (a -> b) -> (Reverse t :. (u :. (v :. w))) := b

(.#..) :: (Reverse t ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Reverse t ~ v a, Reverse t ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Reverse t ~ v a, Reverse t ~ v b, Reverse t ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Reverse t :. u) := a) -> (Reverse t :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Reverse t :. (u :. v)) := a) -> (Reverse t :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Reverse t :. (u :. (v :. w))) := a) -> (Reverse t :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Reverse t :. u) := a) -> b -> (Reverse t :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Reverse t :. (u :. v)) := a) -> b -> (Reverse t :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Reverse t :. (u :. (v :. w))) := a) -> b -> (Reverse t :. (u :. (v :. w))) := b

Covariant (Schematic Comonad t u) => Covariant (t :< u)

Defined in Pandora.Paradigm.Controlflow.Effect.Transformer.Comonadic

Methods

(<$>) :: (a -> b) -> (t :< u) a -> (t :< u) b

comap :: (a -> b) -> (t :< u) a -> (t :< u) b

(<$) :: a -> (t :< u) b -> (t :< u) a

($>) :: (t :< u) a -> b -> (t :< u) b

void :: (t :< u) a -> (t :< u) ()

loeb :: (t :< u) (a <:= (t :< u)) -> (t :< u) a

(<&>) :: (t :< u) a -> (a -> b) -> (t :< u) b

(<$$>) :: Covariant u0 => (a -> b) -> (((t :< u) :. u0) := a) -> ((t :< u) :. u0) := b

(<$$$>) :: (Covariant u0, Covariant v) => (a -> b) -> (((t :< u) :. (u0 :. v)) := a) -> ((t :< u) :. (u0 :. v)) := b

(<$$$$>) :: (Covariant u0, Covariant v, Covariant w) => (a -> b) -> (((t :< u) :. (u0 :. (v :. w))) := a) -> ((t :< u) :. (u0 :. (v :. w))) := b

(<&&>) :: Covariant u0 => (((t :< u) :. u0) := a) -> (a -> b) -> ((t :< u) :. u0) := b

(<&&&>) :: (Covariant u0, Covariant v) => (((t :< u) :. (u0 :. v)) := a) -> (a -> b) -> ((t :< u) :. (u0 :. v)) := b

(<&&&&>) :: (Covariant u0, Covariant v, Covariant w) => (((t :< u) :. (u0 :. (v :. w))) := a) -> (a -> b) -> ((t :< u) :. (u0 :. (v :. w))) := b

(.#..) :: ((t :< u) ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: ((t :< u) ~ v a, (t :< u) ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: ((t :< u) ~ v a, (t :< u) ~ v b, (t :< u) ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u0 => b -> (((t :< u) :. u0) := a) -> ((t :< u) :. u0) := b

(<$$$) :: (Covariant u0, Covariant v) => b -> (((t :< u) :. (u0 :. v)) := a) -> ((t :< u) :. (u0 :. v)) := b

(<$$$$) :: (Covariant u0, Covariant v, Covariant w) => b -> (((t :< u) :. (u0 :. (v :. w))) := a) -> ((t :< u) :. (u0 :. (v :. w))) := b

($$>) :: Covariant u0 => (((t :< u) :. u0) := a) -> b -> ((t :< u) :. u0) := b

($$$>) :: (Covariant u0, Covariant v) => (((t :< u) :. (u0 :. v)) := a) -> b -> ((t :< u) :. (u0 :. v)) := b

($$$$>) :: (Covariant u0, Covariant v, Covariant w) => (((t :< u) :. (u0 :. (v :. w))) := a) -> b -> ((t :< u) :. (u0 :. (v :. w))) := b

Covariant t => Covariant (Prefixed t k)

Defined in Pandora.Paradigm.Structure.Modification.Prefixed

Methods

(<$>) :: (a -> b) -> Prefixed t k a -> Prefixed t k b

comap :: (a -> b) -> Prefixed t k a -> Prefixed t k b

(<$) :: a -> Prefixed t k b -> Prefixed t k a

($>) :: Prefixed t k a -> b -> Prefixed t k b

void :: Prefixed t k a -> Prefixed t k ()

loeb :: Prefixed t k (a <:= Prefixed t k) -> Prefixed t k a

(<&>) :: Prefixed t k a -> (a -> b) -> Prefixed t k b

(<$$>) :: Covariant u => (a -> b) -> ((Prefixed t k :. u) := a) -> (Prefixed t k :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Prefixed t k :. (u :. v)) := a) -> (Prefixed t k :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Prefixed t k :. (u :. (v :. w))) := a) -> (Prefixed t k :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Prefixed t k :. u) := a) -> (a -> b) -> (Prefixed t k :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Prefixed t k :. (u :. v)) := a) -> (a -> b) -> (Prefixed t k :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Prefixed t k :. (u :. (v :. w))) := a) -> (a -> b) -> (Prefixed t k :. (u :. (v :. w))) := b

(.#..) :: (Prefixed t k ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Prefixed t k ~ v a, Prefixed t k ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Prefixed t k ~ v a, Prefixed t k ~ v b, Prefixed t k ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Prefixed t k :. u) := a) -> (Prefixed t k :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Prefixed t k :. (u :. v)) := a) -> (Prefixed t k :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Prefixed t k :. (u :. (v :. w))) := a) -> (Prefixed t k :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Prefixed t k :. u) := a) -> b -> (Prefixed t k :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Prefixed t k :. (u :. v)) := a) -> b -> (Prefixed t k :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Prefixed t k :. (u :. (v :. w))) := a) -> b -> (Prefixed t k :. (u :. (v :. w))) := b

Morphable ('Pop :: a -> Morph a) List

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Morphing 'Pop List :: Type -> Type

Methods

morphing :: (Tagged 'Pop <:.> List) ~> Morphing 'Pop List

Morphable ('Push :: a -> Morph a) List

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Morphing 'Push List :: Type -> Type

Methods

morphing :: (Tagged 'Push <:.> List) ~> Morphing 'Push List

Morphable ('Insert :: a -> Morph a) Binary

Defined in Pandora.Paradigm.Structure.Some.Binary

Associated Types

type Morphing 'Insert Binary :: Type -> Type

Methods

morphing :: (Tagged 'Insert <:.> Binary) ~> Morphing 'Insert Binary

Substructure ('Tail :: a -> Segment a) List

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Substructural 'Tail List :: Type -> Type

Methods

substructure :: (Tagged 'Tail <:.> List) :~. Substructural 'Tail List

sub :: List :~. Substructural 'Tail List

Substructure ('Root :: a -> Segment a) List

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Substructural 'Root List :: Type -> Type

Methods

substructure :: (Tagged 'Root <:.> List) :~. Substructural 'Root List

sub :: List :~. Substructural 'Root List

Substructure ('Just :: a -> Maybe a) Rose

Defined in Pandora.Paradigm.Structure.Some.Rose

Associated Types

type Substructural 'Just Rose :: Type -> Type

Methods

substructure :: (Tagged 'Just <:.> Rose) :~. Substructural 'Just Rose

sub :: Rose :~. Substructural 'Just Rose

Substructure ('Root :: a -> Segment a) Rose

Defined in Pandora.Paradigm.Structure.Some.Rose

Associated Types

type Substructural 'Root Rose :: Type -> Type

Methods

substructure :: (Tagged 'Root <:.> Rose) :~. Substructural 'Root Rose

sub :: Rose :~. Substructural 'Root Rose

Substructure ('Right :: a -> Wye a) Binary

Defined in Pandora.Paradigm.Structure.Some.Binary

Associated Types

type Substructural 'Right Binary :: Type -> Type

Methods

substructure :: (Tagged 'Right <:.> Binary) :~. Substructural 'Right Binary

sub :: Binary :~. Substructural 'Right Binary

Substructure ('Left :: a -> Wye a) Binary

Defined in Pandora.Paradigm.Structure.Some.Binary

Associated Types

type Substructural 'Left Binary :: Type -> Type

Methods

substructure :: (Tagged 'Left <:.> Binary) :~. Substructural 'Left Binary

sub :: Binary :~. Substructural 'Left Binary

Substructure ('Right :: a -> Wye a) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Substructural 'Right (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) :: Type -> Type

Methods

substructure :: (Tagged 'Right <:.> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) :~. Substructural 'Right (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

sub :: Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) :~. Substructural 'Right (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Substructure ('Left :: a -> Wye a) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Substructural 'Left (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) :: Type -> Type

Methods

substructure :: (Tagged 'Left <:.> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) :~. Substructural 'Left (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

sub :: Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) :~. Substructural 'Left (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Substructure ('Root :: a -> Segment a) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Substructural 'Root (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) :: Type -> Type

Methods

substructure :: (Tagged 'Root <:.> Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) :~. Substructural 'Root (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

sub :: Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)) :~. Substructural 'Root (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Substructure ('Right :: a -> Wye a) (Tap ((List <:.:> List) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Substructural 'Right (Tap ((List <:.:> List) := (:*:))) :: Type -> Type

Methods

substructure :: (Tagged 'Right <:.> Tap ((List <:.:> List) := (:*:))) :~. Substructural 'Right (Tap ((List <:.:> List) := (:*:)))

sub :: Tap ((List <:.:> List) := (:*:)) :~. Substructural 'Right (Tap ((List <:.:> List) := (:*:)))

Substructure ('Left :: a -> Wye a) (Tap ((List <:.:> List) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Substructural 'Left (Tap ((List <:.:> List) := (:*:))) :: Type -> Type

Methods

substructure :: (Tagged 'Left <:.> Tap ((List <:.:> List) := (:*:))) :~. Substructural 'Left (Tap ((List <:.:> List) := (:*:)))

sub :: Tap ((List <:.:> List) := (:*:)) :~. Substructural 'Left (Tap ((List <:.:> List) := (:*:)))

Substructure ('Root :: a -> Segment a) (Tap ((List <:.:> List) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

Associated Types

type Substructural 'Root (Tap ((List <:.:> List) := (:*:))) :: Type -> Type

Methods

substructure :: (Tagged 'Root <:.> Tap ((List <:.:> List) := (:*:))) :~. Substructural 'Root (Tap ((List <:.:> List) := (:*:)))

sub :: Tap ((List <:.:> List) := (:*:)) :~. Substructural 'Root (Tap ((List <:.:> List) := (:*:)))

Substructure ('Tail :: a -> Segment a) (Construction List)

Defined in Pandora.Paradigm.Structure.Some.Rose

Associated Types

type Substructural 'Tail (Construction List) :: Type -> Type

Methods

substructure :: (Tagged 'Tail <:.> Construction List) :~. Substructural 'Tail (Construction List)

sub :: Construction List :~. Substructural 'Tail (Construction List)

Substructure ('Root :: a -> Segment a) (Construction List)

Defined in Pandora.Paradigm.Structure.Some.Rose

Associated Types

type Substructural 'Root (Construction List) :: Type -> Type

Methods

substructure :: (Tagged 'Root <:.> Construction List) :~. Substructural 'Root (Construction List)

sub :: Construction List :~. Substructural 'Root (Construction List)

Covariant ((->) a :: Type -> Type)

Defined in Pandora.Paradigm.Primary.Functor.Function

Methods

(<$>) :: (a0 -> b) -> (a -> a0) -> a -> b

comap :: (a0 -> b) -> (a -> a0) -> a -> b

(<$) :: a0 -> (a -> b) -> a -> a0

($>) :: (a -> a0) -> b -> a -> b

void :: (a -> a0) -> a -> ()

loeb :: (a -> (a0 <:= (->) a)) -> a -> a0

(<&>) :: (a -> a0) -> (a0 -> b) -> a -> b

(<$$>) :: Covariant u => (a0 -> b) -> (((->) a :. u) := a0) -> ((->) a :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a0 -> b) -> (((->) a :. (u :. v)) := a0) -> ((->) a :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a0 -> b) -> (((->) a :. (u :. (v :. w))) := a0) -> ((->) a :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => (((->) a :. u) := a0) -> (a0 -> b) -> ((->) a :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => (((->) a :. (u :. v)) := a0) -> (a0 -> b) -> ((->) a :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => (((->) a :. (u :. (v :. w))) := a0) -> (a0 -> b) -> ((->) a :. (u :. (v :. w))) := b

(.#..) :: ((->) a ~ v a0, Category v) => v c d -> ((v a0 :. v b) := c) -> (v a0 :. v b) := d

(.#...) :: ((->) a ~ v a0, (->) a ~ v b, Category v, Covariant (v a0), Covariant (v b)) => v d e -> ((v a0 :. (v b :. v c)) := d) -> (v a0 :. (v b :. v c)) := e

(.#....) :: ((->) a ~ v a0, (->) a ~ v b, (->) a ~ v c, Category v, Covariant (v a0), Covariant (v b), Covariant (v c)) => v e f -> ((v a0 :. (v b :. (v c :. v d))) := e) -> (v a0 :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> (((->) a :. u) := a0) -> ((->) a :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> (((->) a :. (u :. v)) := a0) -> ((->) a :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> (((->) a :. (u :. (v :. w))) := a0) -> ((->) a :. (u :. (v :. w))) := b

($$>) :: Covariant u => (((->) a :. u) := a0) -> b -> ((->) a :. u) := b

($$$>) :: (Covariant u, Covariant v) => (((->) a :. (u :. v)) := a0) -> b -> ((->) a :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => (((->) a :. (u :. (v :. w))) := a0) -> b -> ((->) a :. (u :. (v :. w))) := b

Covariant t => Covariant (Continuation r t)

Defined in Pandora.Paradigm.Primary.Transformer.Continuation

Methods

(<$>) :: (a -> b) -> Continuation r t a -> Continuation r t b

comap :: (a -> b) -> Continuation r t a -> Continuation r t b

(<$) :: a -> Continuation r t b -> Continuation r t a

($>) :: Continuation r t a -> b -> Continuation r t b

void :: Continuation r t a -> Continuation r t ()

loeb :: Continuation r t (a <:= Continuation r t) -> Continuation r t a

(<&>) :: Continuation r t a -> (a -> b) -> Continuation r t b

(<$$>) :: Covariant u => (a -> b) -> ((Continuation r t :. u) := a) -> (Continuation r t :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Continuation r t :. (u :. v)) := a) -> (Continuation r t :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Continuation r t :. (u :. (v :. w))) := a) -> (Continuation r t :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((Continuation r t :. u) := a) -> (a -> b) -> (Continuation r t :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Continuation r t :. (u :. v)) := a) -> (a -> b) -> (Continuation r t :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Continuation r t :. (u :. (v :. w))) := a) -> (a -> b) -> (Continuation r t :. (u :. (v :. w))) := b

(.#..) :: (Continuation r t ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Continuation r t ~ v a, Continuation r t ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (Continuation r t ~ v a, Continuation r t ~ v b, Continuation r t ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u => b -> ((Continuation r t :. u) := a) -> (Continuation r t :. u) := b

(<$$$) :: (Covariant u, Covariant v) => b -> ((Continuation r t :. (u :. v)) := a) -> (Continuation r t :. (u :. v)) := b

(<$$$$) :: (Covariant u, Covariant v, Covariant w) => b -> ((Continuation r t :. (u :. (v :. w))) := a) -> (Continuation r t :. (u :. (v :. w))) := b

($$>) :: Covariant u => ((Continuation r t :. u) := a) -> b -> (Continuation r t :. u) := b

($$$>) :: (Covariant u, Covariant v) => ((Continuation r t :. (u :. v)) := a) -> b -> (Continuation r t :. (u :. v)) := b

($$$$>) :: (Covariant u, Covariant v, Covariant w) => ((Continuation r t :. (u :. (v :. w))) := a) -> b -> (Continuation r t :. (u :. (v :. w))) := b

(Divariant p, Contravariant t, Covariant u) => Covariant ((t >:.:> u) := p)

Defined in Pandora.Paradigm.Schemes.T_U

Methods

(<$>) :: (a -> b) -> ((t >:.:> u) := p) a -> ((t >:.:> u) := p) b

comap :: (a -> b) -> ((t >:.:> u) := p) a -> ((t >:.:> u) := p) b

(<$) :: a -> ((t >:.:> u) := p) b -> ((t >:.:> u) := p) a

($>) :: ((t >:.:> u) := p) a -> b -> ((t >:.:> u) := p) b

void :: ((t >:.:> u) := p) a -> ((t >:.:> u) := p) ()

loeb :: ((t >:.:> u) := p) (a <:= ((t >:.:> u) := p)) -> ((t >:.:> u) := p) a

(<&>) :: ((t >:.:> u) := p) a -> (a -> b) -> ((t >:.:> u) := p) b

(<$$>) :: Covariant u0 => (a -> b) -> ((((t >:.:> u) := p) :. u0) := a) -> (((t >:.:> u) := p) :. u0) := b

(<$$$>) :: (Covariant u0, Covariant v) => (a -> b) -> ((((t >:.:> u) := p) :. (u0 :. v)) := a) -> (((t >:.:> u) := p) :. (u0 :. v)) := b

(<$$$$>) :: (Covariant u0, Covariant v, Covariant w) => (a -> b) -> ((((t >:.:> u) := p) :. (u0 :. (v :. w))) := a) -> (((t >:.:> u) := p) :. (u0 :. (v :. w))) := b

(<&&>) :: Covariant u0 => ((((t >:.:> u) := p) :. u0) := a) -> (a -> b) -> (((t >:.:> u) := p) :. u0) := b

(<&&&>) :: (Covariant u0, Covariant v) => ((((t >:.:> u) := p) :. (u0 :. v)) := a) -> (a -> b) -> (((t >:.:> u) := p) :. (u0 :. v)) := b

(<&&&&>) :: (Covariant u0, Covariant v, Covariant w) => ((((t >:.:> u) := p) :. (u0 :. (v :. w))) := a) -> (a -> b) -> (((t >:.:> u) := p) :. (u0 :. (v :. w))) := b

(.#..) :: (((t >:.:> u) := p) ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (((t >:.:> u) := p) ~ v a, ((t >:.:> u) := p) ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (((t >:.:> u) := p) ~ v a, ((t >:.:> u) := p) ~ v b, ((t >:.:> u) := p) ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u0 => b -> ((((t >:.:> u) := p) :. u0) := a) -> (((t >:.:> u) := p) :. u0) := b

(<$$$) :: (Covariant u0, Covariant v) => b -> ((((t >:.:> u) := p) :. (u0 :. v)) := a) -> (((t >:.:> u) := p) :. (u0 :. v)) := b

(<$$$$) :: (Covariant u0, Covariant v, Covariant w) => b -> ((((t >:.:> u) := p) :. (u0 :. (v :. w))) := a) -> (((t >:.:> u) := p) :. (u0 :. (v :. w))) := b

($$>) :: Covariant u0 => ((((t >:.:> u) := p) :. u0) := a) -> b -> (((t >:.:> u) := p) :. u0) := b

($$$>) :: (Covariant u0, Covariant v) => ((((t >:.:> u) := p) :. (u0 :. v)) := a) -> b -> (((t >:.:> u) := p) :. (u0 :. v)) := b

($$$$>) :: (Covariant u0, Covariant v, Covariant w) => ((((t >:.:> u) := p) :. (u0 :. (v :. w))) := a) -> b -> (((t >:.:> u) := p) :. (u0 :. (v :. w))) := b

(forall i. Covariant (p i), Bivariant p, Covariant t, Covariant u) => Covariant ((t <:.:> u) := p)

Defined in Pandora.Paradigm.Schemes.T_U

Methods

(<$>) :: (a -> b) -> ((t <:.:> u) := p) a -> ((t <:.:> u) := p) b

comap :: (a -> b) -> ((t <:.:> u) := p) a -> ((t <:.:> u) := p) b

(<$) :: a -> ((t <:.:> u) := p) b -> ((t <:.:> u) := p) a

($>) :: ((t <:.:> u) := p) a -> b -> ((t <:.:> u) := p) b

void :: ((t <:.:> u) := p) a -> ((t <:.:> u) := p) ()

loeb :: ((t <:.:> u) := p) (a <:= ((t <:.:> u) := p)) -> ((t <:.:> u) := p) a

(<&>) :: ((t <:.:> u) := p) a -> (a -> b) -> ((t <:.:> u) := p) b

(<$$>) :: Covariant u0 => (a -> b) -> ((((t <:.:> u) := p) :. u0) := a) -> (((t <:.:> u) := p) :. u0) := b

(<$$$>) :: (Covariant u0, Covariant v) => (a -> b) -> ((((t <:.:> u) := p) :. (u0 :. v)) := a) -> (((t <:.:> u) := p) :. (u0 :. v)) := b

(<$$$$>) :: (Covariant u0, Covariant v, Covariant w) => (a -> b) -> ((((t <:.:> u) := p) :. (u0 :. (v :. w))) := a) -> (((t <:.:> u) := p) :. (u0 :. (v :. w))) := b

(<&&>) :: Covariant u0 => ((((t <:.:> u) := p) :. u0) := a) -> (a -> b) -> (((t <:.:> u) := p) :. u0) := b

(<&&&>) :: (Covariant u0, Covariant v) => ((((t <:.:> u) := p) :. (u0 :. v)) := a) -> (a -> b) -> (((t <:.:> u) := p) :. (u0 :. v)) := b

(<&&&&>) :: (Covariant u0, Covariant v, Covariant w) => ((((t <:.:> u) := p) :. (u0 :. (v :. w))) := a) -> (a -> b) -> (((t <:.:> u) := p) :. (u0 :. (v :. w))) := b

(.#..) :: (((t <:.:> u) := p) ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (((t <:.:> u) := p) ~ v a, ((t <:.:> u) := p) ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (((t <:.:> u) := p) ~ v a, ((t <:.:> u) := p) ~ v b, ((t <:.:> u) := p) ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u0 => b -> ((((t <:.:> u) := p) :. u0) := a) -> (((t <:.:> u) := p) :. u0) := b

(<$$$) :: (Covariant u0, Covariant v) => b -> ((((t <:.:> u) := p) :. (u0 :. v)) := a) -> (((t <:.:> u) := p) :. (u0 :. v)) := b

(<$$$$) :: (Covariant u0, Covariant v, Covariant w) => b -> ((((t <:.:> u) := p) :. (u0 :. (v :. w))) := a) -> (((t <:.:> u) := p) :. (u0 :. (v :. w))) := b

($$>) :: Covariant u0 => ((((t <:.:> u) := p) :. u0) := a) -> b -> (((t <:.:> u) := p) :. u0) := b

($$$>) :: (Covariant u0, Covariant v) => ((((t <:.:> u) := p) :. (u0 :. v)) := a) -> b -> (((t <:.:> u) := p) :. (u0 :. v)) := b

($$$$>) :: (Covariant u0, Covariant v, Covariant w) => ((((t <:.:> u) := p) :. (u0 :. (v :. w))) := a) -> b -> (((t <:.:> u) := p) :. (u0 :. (v :. w))) := b

(Covariant t, Covariant t', Covariant u) => Covariant ((t <:<.>:> t') := u)

Defined in Pandora.Paradigm.Schemes.TUT

Methods

(<$>) :: (a -> b) -> ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) b

comap :: (a -> b) -> ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) b

(<$) :: a -> ((t <:<.>:> t') := u) b -> ((t <:<.>:> t') := u) a

($>) :: ((t <:<.>:> t') := u) a -> b -> ((t <:<.>:> t') := u) b

void :: ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) ()

loeb :: ((t <:<.>:> t') := u) (a <:= ((t <:<.>:> t') := u)) -> ((t <:<.>:> t') := u) a

(<&>) :: ((t <:<.>:> t') := u) a -> (a -> b) -> ((t <:<.>:> t') := u) b

(<$$>) :: Covariant u0 => (a -> b) -> ((((t <:<.>:> t') := u) :. u0) := a) -> (((t <:<.>:> t') := u) :. u0) := b

(<$$$>) :: (Covariant u0, Covariant v) => (a -> b) -> ((((t <:<.>:> t') := u) :. (u0 :. v)) := a) -> (((t <:<.>:> t') := u) :. (u0 :. v)) := b

(<$$$$>) :: (Covariant u0, Covariant v, Covariant w) => (a -> b) -> ((((t <:<.>:> t') := u) :. (u0 :. (v :. w))) := a) -> (((t <:<.>:> t') := u) :. (u0 :. (v :. w))) := b

(<&&>) :: Covariant u0 => ((((t <:<.>:> t') := u) :. u0) := a) -> (a -> b) -> (((t <:<.>:> t') := u) :. u0) := b

(<&&&>) :: (Covariant u0, Covariant v) => ((((t <:<.>:> t') := u) :. (u0 :. v)) := a) -> (a -> b) -> (((t <:<.>:> t') := u) :. (u0 :. v)) := b

(<&&&&>) :: (Covariant u0, Covariant v, Covariant w) => ((((t <:<.>:> t') := u) :. (u0 :. (v :. w))) := a) -> (a -> b) -> (((t <:<.>:> t') := u) :. (u0 :. (v :. w))) := b

(.#..) :: (((t <:<.>:> t') := u) ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (((t <:<.>:> t') := u) ~ v a, ((t <:<.>:> t') := u) ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: (((t <:<.>:> t') := u) ~ v a, ((t <:<.>:> t') := u) ~ v b, ((t <:<.>:> t') := u) ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u0 => b -> ((((t <:<.>:> t') := u) :. u0) := a) -> (((t <:<.>:> t') := u) :. u0) := b

(<$$$) :: (Covariant u0, Covariant v) => b -> ((((t <:<.>:> t') := u) :. (u0 :. v)) := a) -> (((t <:<.>:> t') := u) :. (u0 :. v)) := b

(<$$$$) :: (Covariant u0, Covariant v, Covariant w) => b -> ((((t <:<.>:> t') := u) :. (u0 :. (v :. w))) := a) -> (((t <:<.>:> t') := u) :. (u0 :. (v :. w))) := b

($$>) :: Covariant u0 => ((((t <:<.>:> t') := u) :. u0) := a) -> b -> (((t <:<.>:> t') := u) :. u0) := b

($$$>) :: (Covariant u0, Covariant v) => ((((t <:<.>:> t') := u) :. (u0 :. v)) := a) -> b -> (((t <:<.>:> t') := u) :. (u0 :. v)) := b

($$$$>) :: (Covariant u0, Covariant v, Covariant w) => ((((t <:<.>:> t') := u) :. (u0 :. (v :. w))) := a) -> b -> (((t <:<.>:> t') := u) :. (u0 :. (v :. w))) := b

(Covariant t, Covariant u) => Covariant (t <.:> u)

Defined in Pandora.Paradigm.Schemes.UT

Methods

(<$>) :: (a -> b) -> (t <.:> u) a -> (t <.:> u) b

comap :: (a -> b) -> (t <.:> u) a -> (t <.:> u) b

(<$) :: a -> (t <.:> u) b -> (t <.:> u) a

($>) :: (t <.:> u) a -> b -> (t <.:> u) b

void :: (t <.:> u) a -> (t <.:> u) ()

loeb :: (t <.:> u) (a <:= (t <.:> u)) -> (t <.:> u) a

(<&>) :: (t <.:> u) a -> (a -> b) -> (t <.:> u) b

(<$$>) :: Covariant u0 => (a -> b) -> (((t <.:> u) :. u0) := a) -> ((t <.:> u) :. u0) := b

(<$$$>) :: (Covariant u0, Covariant v) => (a -> b) -> (((t <.:> u) :. (u0 :. v)) := a) -> ((t <.:> u) :. (u0 :. v)) := b

(<$$$$>) :: (Covariant u0, Covariant v, Covariant w) => (a -> b) -> (((t <.:> u) :. (u0 :. (v :. w))) := a) -> ((t <.:> u) :. (u0 :. (v :. w))) := b

(<&&>) :: Covariant u0 => (((t <.:> u) :. u0) := a) -> (a -> b) -> ((t <.:> u) :. u0) := b

(<&&&>) :: (Covariant u0, Covariant v) => (((t <.:> u) :. (u0 :. v)) := a) -> (a -> b) -> ((t <.:> u) :. (u0 :. v)) := b

(<&&&&>) :: (Covariant u0, Covariant v, Covariant w) => (((t <.:> u) :. (u0 :. (v :. w))) := a) -> (a -> b) -> ((t <.:> u) :. (u0 :. (v :. w))) := b

(.#..) :: ((t <.:> u) ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: ((t <.:> u) ~ v a, (t <.:> u) ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: ((t <.:> u) ~ v a, (t <.:> u) ~ v b, (t <.:> u) ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u0 => b -> (((t <.:> u) :. u0) := a) -> ((t <.:> u) :. u0) := b

(<$$$) :: (Covariant u0, Covariant v) => b -> (((t <.:> u) :. (u0 :. v)) := a) -> ((t <.:> u) :. (u0 :. v)) := b

(<$$$$) :: (Covariant u0, Covariant v, Covariant w) => b -> (((t <.:> u) :. (u0 :. (v :. w))) := a) -> ((t <.:> u) :. (u0 :. (v :. w))) := b

($$>) :: Covariant u0 => (((t <.:> u) :. u0) := a) -> b -> ((t <.:> u) :. u0) := b

($$$>) :: (Covariant u0, Covariant v) => (((t <.:> u) :. (u0 :. v)) := a) -> b -> ((t <.:> u) :. (u0 :. v)) := b

($$$$>) :: (Covariant u0, Covariant v, Covariant w) => (((t <.:> u) :. (u0 :. (v :. w))) := a) -> b -> ((t <.:> u) :. (u0 :. (v :. w))) := b

(Covariant t, Covariant u) => Covariant (t <:.> u)

Defined in Pandora.Paradigm.Schemes.TU

Methods

(<$>) :: (a -> b) -> (t <:.> u) a -> (t <:.> u) b

comap :: (a -> b) -> (t <:.> u) a -> (t <:.> u) b

(<$) :: a -> (t <:.> u) b -> (t <:.> u) a

($>) :: (t <:.> u) a -> b -> (t <:.> u) b

void :: (t <:.> u) a -> (t <:.> u) ()

loeb :: (t <:.> u) (a <:= (t <:.> u)) -> (t <:.> u) a

(<&>) :: (t <:.> u) a -> (a -> b) -> (t <:.> u) b

(<$$>) :: Covariant u0 => (a -> b) -> (((t <:.> u) :. u0) := a) -> ((t <:.> u) :. u0) := b

(<$$$>) :: (Covariant u0, Covariant v) => (a -> b) -> (((t <:.> u) :. (u0 :. v)) := a) -> ((t <:.> u) :. (u0 :. v)) := b

(<$$$$>) :: (Covariant u0, Covariant v, Covariant w) => (a -> b) -> (((t <:.> u) :. (u0 :. (v :. w))) := a) -> ((t <:.> u) :. (u0 :. (v :. w))) := b

(<&&>) :: Covariant u0 => (((t <:.> u) :. u0) := a) -> (a -> b) -> ((t <:.> u) :. u0) := b

(<&&&>) :: (Covariant u0, Covariant v) => (((t <:.> u) :. (u0 :. v)) := a) -> (a -> b) -> ((t <:.> u) :. (u0 :. v)) := b

(<&&&&>) :: (Covariant u0, Covariant v, Covariant w) => (((t <:.> u) :. (u0 :. (v :. w))) := a) -> (a -> b) -> ((t <:.> u) :. (u0 :. (v :. w))) := b

(.#..) :: ((t <:.> u) ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: ((t <:.> u) ~ v a, (t <:.> u) ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: ((t <:.> u) ~ v a, (t <:.> u) ~ v b, (t <:.> u) ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

(<$$) :: Covariant u0 => b -> (((t <:.> u) :. u0) := a) -> ((t <:.> u) :. u0) := b

(<$$$) :: (Covariant u0, Covariant v) => b -> (((t <:.> u) :. (u0 :. v)) := a) -> ((t <:.> u) :. (u0 :. v)) := b

(<$$$$) :: (Covariant u0, Covariant v, Covariant w) => b -> (((t <:.> u) :. (u0 :. (v :. w))) := a) -> ((t <:.> u) :. (u0 :. (v :. w))) := b

($$>) :: Covariant u0 => (((t <:.> u) :. u0) := a) -> b -> ((t <:.> u) :. u0) := b

($$$>) :: (Covariant u0, Covariant v) => (((t <:.> u) :. (u0 :. v)) := a) -> b -> ((t <:.> u) :. (u0 :. v)) := b

($$$$>) :: (Covariant u0, Covariant v, Covariant w) => (((t <:.> u) :. (u0 :. (v :. w))) := a) -> b -> ((t <:.> u) :. (u0 :. (v :. w))) := b

(Adjoint t' t, Bindable u) => Bindable ((t <:<.>:> t') := u)

Defined in Pandora.Paradigm.Schemes.TUT

Methods

(>>=) :: ((t <:<.>:> t') := u) a -> (a -> ((t <:<.>:> t') := u) b) -> ((t <:<.>:> t') := u) b

(=<<) :: (a -> ((t <:<.>:> t') := u) b) -> ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) b

bind :: (a -> ((t <:<.>:> t') := u) b) -> ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) b

join :: ((((t <:<.>:> t') := u) :. ((t <:<.>:> t') := u)) := a) -> ((t <:<.>:> t') := u) a

(>=>) :: (a -> ((t <:<.>:> t') := u) b) -> (b -> ((t <:<.>:> t') := u) c) -> a -> ((t <:<.>:> t') := u) c

(<=<) :: (b -> ((t <:<.>:> t') := u) c) -> (a -> ((t <:<.>:> t') := u) b) -> a -> ((t <:<.>:> t') := u) c

($>>=) :: Covariant u0 => ((u0 :. ((t <:<.>:> t') := u)) := a) -> (a -> ((t <:<.>:> t') := u) b) -> (u0 :. ((t <:<.>:> t') := u)) := b

(Traversable t, Bindable t, Applicative u, Monad u) => Bindable (t <.:> u)

Defined in Pandora.Paradigm.Schemes.UT

Methods

(>>=) :: (t <.:> u) a -> (a -> (t <.:> u) b) -> (t <.:> u) b

(=<<) :: (a -> (t <.:> u) b) -> (t <.:> u) a -> (t <.:> u) b

bind :: (a -> (t <.:> u) b) -> (t <.:> u) a -> (t <.:> u) b

join :: (((t <.:> u) :. (t <.:> u)) := a) -> (t <.:> u) a

(>=>) :: (a -> (t <.:> u) b) -> (b -> (t <.:> u) c) -> a -> (t <.:> u) c

(<=<) :: (b -> (t <.:> u) c) -> (a -> (t <.:> u) b) -> a -> (t <.:> u) c

($>>=) :: Covariant u0 => ((u0 :. (t <.:> u)) := a) -> (a -> (t <.:> u) b) -> (u0 :. (t <.:> u)) := b

(Semigroup e, Pointable u, Bindable u) => Bindable ((:*:) e <.:> u)

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

(>>=) :: ((:*:) e <.:> u) a -> (a -> ((:*:) e <.:> u) b) -> ((:*:) e <.:> u) b

(=<<) :: (a -> ((:*:) e <.:> u) b) -> ((:*:) e <.:> u) a -> ((:*:) e <.:> u) b

bind :: (a -> ((:*:) e <.:> u) b) -> ((:*:) e <.:> u) a -> ((:*:) e <.:> u) b

join :: ((((:*:) e <.:> u) :. ((:*:) e <.:> u)) := a) -> ((:*:) e <.:> u) a

(>=>) :: (a -> ((:*:) e <.:> u) b) -> (b -> ((:*:) e <.:> u) c) -> a -> ((:*:) e <.:> u) c

(<=<) :: (b -> ((:*:) e <.:> u) c) -> (a -> ((:*:) e <.:> u) b) -> a -> ((:*:) e <.:> u) c

($>>=) :: Covariant u0 => ((u0 :. ((:*:) e <.:> u)) := a) -> (a -> ((:*:) e <.:> u) b) -> (u0 :. ((:*:) e <.:> u)) := b

(Bindable t, Distributive t, Bindable u) => Bindable (t <:.> u)

Defined in Pandora.Paradigm.Schemes.TU

Methods

(>>=) :: (t <:.> u) a -> (a -> (t <:.> u) b) -> (t <:.> u) b

(=<<) :: (a -> (t <:.> u) b) -> (t <:.> u) a -> (t <:.> u) b

bind :: (a -> (t <:.> u) b) -> (t <:.> u) a -> (t <:.> u) b

join :: (((t <:.> u) :. (t <:.> u)) := a) -> (t <:.> u) a

(>=>) :: (a -> (t <:.> u) b) -> (b -> (t <:.> u) c) -> a -> (t <:.> u) c

(<=<) :: (b -> (t <:.> u) c) -> (a -> (t <:.> u) b) -> a -> (t <:.> u) c

($>>=) :: Covariant u0 => ((u0 :. (t <:.> u)) := a) -> (a -> (t <:.> u) b) -> (u0 :. (t <:.> u)) := b

(Adjoint t' t, Bindable u) => Applicative ((t <:<.>:> t') := u)

Defined in Pandora.Paradigm.Schemes.TUT

Methods

(<*>) :: ((t <:<.>:> t') := u) (a -> b) -> ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) b

apply :: ((t <:<.>:> t') := u) (a -> b) -> ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) b

(*>) :: ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) b -> ((t <:<.>:> t') := u) b

(<*) :: ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) b -> ((t <:<.>:> t') := u) a

forever :: ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) b

(<%>) :: ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) (a -> b) -> ((t <:<.>:> t') := u) b

(<**>) :: Applicative u0 => ((((t <:<.>:> t') := u) :. u0) := (a -> b)) -> ((((t <:<.>:> t') := u) :. u0) := a) -> (((t <:<.>:> t') := u) :. u0) := b

(<***>) :: (Applicative u0, Applicative v) => ((((t <:<.>:> t') := u) :. (u0 :. v)) := (a -> b)) -> ((((t <:<.>:> t') := u) :. (u0 :. v)) := a) -> (((t <:<.>:> t') := u) :. (u0 :. v)) := b

(<****>) :: (Applicative u0, Applicative v, Applicative w) => ((((t <:<.>:> t') := u) :. (u0 :. (v :. w))) := (a -> b)) -> ((((t <:<.>:> t') := u) :. (u0 :. (v :. w))) := a) -> (((t <:<.>:> t') := u) :. (u0 :. (v :. w))) := b

(Applicative t, Applicative u) => Applicative (t <.:> u)

Defined in Pandora.Paradigm.Schemes.UT

Methods

(<*>) :: (t <.:> u) (a -> b) -> (t <.:> u) a -> (t <.:> u) b

apply :: (t <.:> u) (a -> b) -> (t <.:> u) a -> (t <.:> u) b

(*>) :: (t <.:> u) a -> (t <.:> u) b -> (t <.:> u) b

(<*) :: (t <.:> u) a -> (t <.:> u) b -> (t <.:> u) a

forever :: (t <.:> u) a -> (t <.:> u) b

(<%>) :: (t <.:> u) a -> (t <.:> u) (a -> b) -> (t <.:> u) b

(<**>) :: Applicative u0 => (((t <.:> u) :. u0) := (a -> b)) -> (((t <.:> u) :. u0) := a) -> ((t <.:> u) :. u0) := b

(<***>) :: (Applicative u0, Applicative v) => (((t <.:> u) :. (u0 :. v)) := (a -> b)) -> (((t <.:> u) :. (u0 :. v)) := a) -> ((t <.:> u) :. (u0 :. v)) := b

(<****>) :: (Applicative u0, Applicative v, Applicative w) => (((t <.:> u) :. (u0 :. (v :. w))) := (a -> b)) -> (((t <.:> u) :. (u0 :. (v :. w))) := a) -> ((t <.:> u) :. (u0 :. (v :. w))) := b

(Semigroup e, Applicative u) => Applicative ((:*:) e <.:> u)

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

(<*>) :: ((:*:) e <.:> u) (a -> b) -> ((:*:) e <.:> u) a -> ((:*:) e <.:> u) b

apply :: ((:*:) e <.:> u) (a -> b) -> ((:*:) e <.:> u) a -> ((:*:) e <.:> u) b

(*>) :: ((:*:) e <.:> u) a -> ((:*:) e <.:> u) b -> ((:*:) e <.:> u) b

(<*) :: ((:*:) e <.:> u) a -> ((:*:) e <.:> u) b -> ((:*:) e <.:> u) a

forever :: ((:*:) e <.:> u) a -> ((:*:) e <.:> u) b

(<%>) :: ((:*:) e <.:> u) a -> ((:*:) e <.:> u) (a -> b) -> ((:*:) e <.:> u) b

(<**>) :: Applicative u0 => ((((:*:) e <.:> u) :. u0) := (a -> b)) -> ((((:*:) e <.:> u) :. u0) := a) -> (((:*:) e <.:> u) :. u0) := b

(<***>) :: (Applicative u0, Applicative v) => ((((:*:) e <.:> u) :. (u0 :. v)) := (a -> b)) -> ((((:*:) e <.:> u) :. (u0 :. v)) := a) -> (((:*:) e <.:> u) :. (u0 :. v)) := b

(<****>) :: (Applicative u0, Applicative v, Applicative w) => ((((:*:) e <.:> u) :. (u0 :. (v :. w))) := (a -> b)) -> ((((:*:) e <.:> u) :. (u0 :. (v :. w))) := a) -> (((:*:) e <.:> u) :. (u0 :. (v :. w))) := b

(Applicative t, Applicative u) => Applicative (t <:.> u)

Defined in Pandora.Paradigm.Schemes.TU

Methods

(<*>) :: (t <:.> u) (a -> b) -> (t <:.> u) a -> (t <:.> u) b

apply :: (t <:.> u) (a -> b) -> (t <:.> u) a -> (t <:.> u) b

(*>) :: (t <:.> u) a -> (t <:.> u) b -> (t <:.> u) b

(<*) :: (t <:.> u) a -> (t <:.> u) b -> (t <:.> u) a

forever :: (t <:.> u) a -> (t <:.> u) b

(<%>) :: (t <:.> u) a -> (t <:.> u) (a -> b) -> (t <:.> u) b

(<**>) :: Applicative u0 => (((t <:.> u) :. u0) := (a -> b)) -> (((t <:.> u) :. u0) := a) -> ((t <:.> u) :. u0) := b

(<***>) :: (Applicative u0, Applicative v) => (((t <:.> u) :. (u0 :. v)) := (a -> b)) -> (((t <:.> u) :. (u0 :. v)) := a) -> ((t <:.> u) :. (u0 :. v)) := b

(<****>) :: (Applicative u0, Applicative v, Applicative w) => (((t <:.> u) :. (u0 :. (v :. w))) := (a -> b)) -> (((t <:.> u) :. (u0 :. (v :. w))) := a) -> ((t <:.> u) :. (u0 :. (v :. w))) := b

(Applicative t, Covariant t', Alternative u) => Alternative ((t <:<.>:> t') := u)

Defined in Pandora.Paradigm.Schemes.TUT

Methods

(<+>) :: ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) a

alter :: ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) a

(Covariant u, Alternative t) => Alternative (t <:.> u)

Defined in Pandora.Paradigm.Schemes.TU

Methods

(<+>) :: (t <:.> u) a -> (t <:.> u) a -> (t <:.> u) a

alter :: (t <:.> u) a -> (t <:.> u) a -> (t <:.> u) a

(Pointable t, Applicative t, Covariant t', Avoidable u) => Avoidable ((t <:<.>:> t') := u)

Defined in Pandora.Paradigm.Schemes.TUT

Methods

empty :: ((t <:<.>:> t') := u) a

(Covariant u, Avoidable t) => Avoidable (t <:.> u)

Defined in Pandora.Paradigm.Schemes.TU

Methods

empty :: (t <:.> u) a

(Adjoint t' t, Extendable u) => Extendable ((t' <:<.>:> t) := u)

Defined in Pandora.Paradigm.Schemes.TUT

Methods

(=>>) :: ((t' <:<.>:> t) := u) a -> (((t' <:<.>:> t) := u) a -> b) -> ((t' <:<.>:> t) := u) b

(<<=) :: (((t' <:<.>:> t) := u) a -> b) -> ((t' <:<.>:> t) := u) a -> ((t' <:<.>:> t) := u) b

extend :: (((t' <:<.>:> t) := u) a -> b) -> ((t' <:<.>:> t) := u) a -> ((t' <:<.>:> t) := u) b

duplicate :: ((t' <:<.>:> t) := u) a -> (((t' <:<.>:> t) := u) :. ((t' <:<.>:> t) := u)) := a

(=<=) :: (((t' <:<.>:> t) := u) b -> c) -> (((t' <:<.>:> t) := u) a -> b) -> ((t' <:<.>:> t) := u) a -> c

(=>=) :: (((t' <:<.>:> t) := u) a -> b) -> (((t' <:<.>:> t) := u) b -> c) -> ((t' <:<.>:> t) := u) a -> c

($=>>) :: Covariant u0 => ((u0 :. ((t' <:<.>:> t) := u)) := a) -> (((t' <:<.>:> t) := u) a -> b) -> (u0 :. ((t' <:<.>:> t) := u)) := b

(<<=$) :: Covariant u0 => ((u0 :. ((t' <:<.>:> t) := u)) := a) -> (((t' <:<.>:> t) := u) a -> b) -> (u0 :. ((t' <:<.>:> t) := u)) := b

(Semigroup e, Extendable u) => Extendable (((->) e :: Type -> Type) <.:> u)

Defined in Pandora.Paradigm.Inventory.Imprint

Methods

(=>>) :: ((->) e <.:> u) a -> (((->) e <.:> u) a -> b) -> ((->) e <.:> u) b

(<<=) :: (((->) e <.:> u) a -> b) -> ((->) e <.:> u) a -> ((->) e <.:> u) b

extend :: (((->) e <.:> u) a -> b) -> ((->) e <.:> u) a -> ((->) e <.:> u) b

duplicate :: ((->) e <.:> u) a -> (((->) e <.:> u) :. ((->) e <.:> u)) := a

(=<=) :: (((->) e <.:> u) b -> c) -> (((->) e <.:> u) a -> b) -> ((->) e <.:> u) a -> c

(=>=) :: (((->) e <.:> u) a -> b) -> (((->) e <.:> u) b -> c) -> ((->) e <.:> u) a -> c

($=>>) :: Covariant u0 => ((u0 :. ((->) e <.:> u)) := a) -> (((->) e <.:> u) a -> b) -> (u0 :. ((->) e <.:> u)) := b

(<<=$) :: Covariant u0 => ((u0 :. ((->) e <.:> u)) := a) -> (((->) e <.:> u) a -> b) -> (u0 :. ((->) e <.:> u)) := b

Extendable u => Extendable ((:*:) e <:.> u)

Defined in Pandora.Paradigm.Inventory.Equipment

Methods

(=>>) :: ((:*:) e <:.> u) a -> (((:*:) e <:.> u) a -> b) -> ((:*:) e <:.> u) b

(<<=) :: (((:*:) e <:.> u) a -> b) -> ((:*:) e <:.> u) a -> ((:*:) e <:.> u) b

extend :: (((:*:) e <:.> u) a -> b) -> ((:*:) e <:.> u) a -> ((:*:) e <:.> u) b

duplicate :: ((:*:) e <:.> u) a -> (((:*:) e <:.> u) :. ((:*:) e <:.> u)) := a

(=<=) :: (((:*:) e <:.> u) b -> c) -> (((:*:) e <:.> u) a -> b) -> ((:*:) e <:.> u) a -> c

(=>=) :: (((:*:) e <:.> u) a -> b) -> (((:*:) e <:.> u) b -> c) -> ((:*:) e <:.> u) a -> c

($=>>) :: Covariant u0 => ((u0 :. ((:*:) e <:.> u)) := a) -> (((:*:) e <:.> u) a -> b) -> (u0 :. ((:*:) e <:.> u)) := b

(<<=$) :: Covariant u0 => ((u0 :. ((:*:) e <:.> u)) := a) -> (((:*:) e <:.> u) a -> b) -> (u0 :. ((:*:) e <:.> u)) := b

(Adjoint t t', Extractable u) => Extractable ((t <:<.>:> t') := u)

Defined in Pandora.Paradigm.Schemes.TUT

Methods

extract :: a <:= ((t <:<.>:> t') := u)

(Extractable t, Extractable u) => Extractable (t <.:> u)

Defined in Pandora.Paradigm.Schemes.UT

Methods

extract :: a <:= (t <.:> u)

(Extractable t, Extractable u) => Extractable (t <:.> u)

Defined in Pandora.Paradigm.Schemes.TU

Methods

extract :: a <:= (t <:.> u)

(Pointable u, Adjoint t' t) => Pointable ((t <:<.>:> t') := u)

Defined in Pandora.Paradigm.Schemes.TUT

Methods

point :: a :=> ((t <:<.>:> t') := u)

pass :: ((t <:<.>:> t') := u) ()

(Pointable t, Pointable u) => Pointable (t <.:> u)

Defined in Pandora.Paradigm.Schemes.UT

Methods

point :: a :=> (t <.:> u)

pass :: (t <.:> u) ()

(Pointable u, Monoid e) => Pointable ((:*:) e <.:> u)

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

point :: a :=> ((:*:) e <.:> u)

pass :: ((:*:) e <.:> u) ()

(Pointable t, Pointable u) => Pointable (t <:.> u)

Defined in Pandora.Paradigm.Schemes.TU

Methods

point :: a :=> (t <:.> u)

pass :: (t <:.> u) ()

(Traversable t, Traversable u) => Traversable (t <:.> u)

Defined in Pandora.Paradigm.Schemes.TU

Methods

(->>) :: (Pointable u0, Applicative u0) => (t <:.> u) a -> (a -> u0 b) -> (u0 :. (t <:.> u)) := b

traverse :: (Pointable u0, Applicative u0) => (a -> u0 b) -> (t <:.> u) a -> (u0 :. (t <:.> u)) := b

sequence :: (Pointable u0, Applicative u0) => (((t <:.> u) :. u0) := a) -> (u0 :. (t <:.> u)) := a

(->>>) :: (Pointable u0, Applicative u0, Traversable v) => ((v :. (t <:.> u)) := a) -> (a -> u0 b) -> (u0 :. (v :. (t <:.> u))) := b

(->>>>) :: (Pointable u0, Applicative u0, Traversable v, Traversable w) => ((w :. (v :. (t <:.> u))) := a) -> (a -> u0 b) -> (u0 :. (w :. (v :. (t <:.> u)))) := b

(->>>>>) :: (Pointable u0, Applicative u0, Traversable v, Traversable w, Traversable j) => ((j :. (w :. (v :. (t <:.> u)))) := a) -> (a -> u0 b) -> (u0 :. (j :. (w :. (v :. (t <:.> u))))) := b

(Covariant (t <.:> v), Covariant (w <:.> u), Adjoint v u, Adjoint t w) => Adjoint (t <.:> v) (w <:.> u)

Defined in Pandora.Paradigm.Schemes

Methods

(-|) :: a -> ((t <.:> v) a -> b) -> (w <:.> u) b

(|-) :: (t <.:> v) a -> (a -> (w <:.> u) b) -> b

phi :: ((t <.:> v) a -> b) -> a -> (w <:.> u) b

psi :: (a -> (w <:.> u) b) -> (t <.:> v) a -> b

eta :: a -> ((w <:.> u) :. (t <.:> v)) := a

epsilon :: (((t <.:> v) :. (w <:.> u)) := a) -> a

(-|$) :: Covariant v0 => v0 a -> ((t <.:> v) a -> b) -> v0 ((w <:.> u) b)

($|-) :: Covariant v0 => v0 ((t <.:> v) a) -> (a -> (w <:.> u) b) -> v0 b

($$|-) :: (Covariant v0, Covariant w0) => ((v0 :. (w0 :. (t <.:> v))) := a) -> (a -> (w <:.> u) b) -> (v0 :. w0) := b

($$$|-) :: (Covariant v0, Covariant w0, Covariant x) => ((v0 :. (w0 :. (x :. (t <.:> v)))) := a) -> (a -> (w <:.> u) b) -> (v0 :. (w0 :. x)) := b

($$$$|-) :: (Covariant v0, Covariant w0, Covariant x, Covariant y) => ((v0 :. (w0 :. (x :. (y :. (t <.:> v))))) := a) -> (a -> (w <:.> u) b) -> (v0 :. (w0 :. (x :. y))) := b

(Covariant (t <.:> v), Covariant (w <.:> u), Adjoint t u, Adjoint v w) => Adjoint (t <.:> v) (w <.:> u)

Defined in Pandora.Paradigm.Schemes

Methods

(-|) :: a -> ((t <.:> v) a -> b) -> (w <.:> u) b

(|-) :: (t <.:> v) a -> (a -> (w <.:> u) b) -> b

phi :: ((t <.:> v) a -> b) -> a -> (w <.:> u) b

psi :: (a -> (w <.:> u) b) -> (t <.:> v) a -> b

eta :: a -> ((w <.:> u) :. (t <.:> v)) := a

epsilon :: (((t <.:> v) :. (w <.:> u)) := a) -> a

(-|$) :: Covariant v0 => v0 a -> ((t <.:> v) a -> b) -> v0 ((w <.:> u) b)

($|-) :: Covariant v0 => v0 ((t <.:> v) a) -> (a -> (w <.:> u) b) -> v0 b

($$|-) :: (Covariant v0, Covariant w0) => ((v0 :. (w0 :. (t <.:> v))) := a) -> (a -> (w <.:> u) b) -> (v0 :. w0) := b

($$$|-) :: (Covariant v0, Covariant w0, Covariant x) => ((v0 :. (w0 :. (x :. (t <.:> v)))) := a) -> (a -> (w <.:> u) b) -> (v0 :. (w0 :. x)) := b

($$$$|-) :: (Covariant v0, Covariant w0, Covariant x, Covariant y) => ((v0 :. (w0 :. (x :. (y :. (t <.:> v))))) := a) -> (a -> (w <.:> u) b) -> (v0 :. (w0 :. (x :. y))) := b

(Covariant (v <:.> t), Covariant (w <.:> u), Adjoint t u, Adjoint v w) => Adjoint (v <:.> t) (w <.:> u)

Defined in Pandora.Paradigm.Schemes

Methods

(-|) :: a -> ((v <:.> t) a -> b) -> (w <.:> u) b

(|-) :: (v <:.> t) a -> (a -> (w <.:> u) b) -> b

phi :: ((v <:.> t) a -> b) -> a -> (w <.:> u) b

psi :: (a -> (w <.:> u) b) -> (v <:.> t) a -> b

eta :: a -> ((w <.:> u) :. (v <:.> t)) := a

epsilon :: (((v <:.> t) :. (w <.:> u)) := a) -> a

(-|$) :: Covariant v0 => v0 a -> ((v <:.> t) a -> b) -> v0 ((w <.:> u) b)

($|-) :: Covariant v0 => v0 ((v <:.> t) a) -> (a -> (w <.:> u) b) -> v0 b

($$|-) :: (Covariant v0, Covariant w0) => ((v0 :. (w0 :. (v <:.> t))) := a) -> (a -> (w <.:> u) b) -> (v0 :. w0) := b

($$$|-) :: (Covariant v0, Covariant w0, Covariant x) => ((v0 :. (w0 :. (x :. (v <:.> t)))) := a) -> (a -> (w <.:> u) b) -> (v0 :. (w0 :. x)) := b

($$$$|-) :: (Covariant v0, Covariant w0, Covariant x, Covariant y) => ((v0 :. (w0 :. (x :. (y :. (v <:.> t))))) := a) -> (a -> (w <.:> u) b) -> (v0 :. (w0 :. (x :. y))) := b

(Covariant (v <:.> t), Covariant (u <:.> w), Adjoint t u, Adjoint v w) => Adjoint (v <:.> t) (u <:.> w)

Defined in Pandora.Paradigm.Schemes

Methods

(-|) :: a -> ((v <:.> t) a -> b) -> (u <:.> w) b

(|-) :: (v <:.> t) a -> (a -> (u <:.> w) b) -> b

phi :: ((v <:.> t) a -> b) -> a -> (u <:.> w) b

psi :: (a -> (u <:.> w) b) -> (v <:.> t) a -> b

eta :: a -> ((u <:.> w) :. (v <:.> t)) := a

epsilon :: (((v <:.> t) :. (u <:.> w)) := a) -> a

(-|$) :: Covariant v0 => v0 a -> ((v <:.> t) a -> b) -> v0 ((u <:.> w) b)

($|-) :: Covariant v0 => v0 ((v <:.> t) a) -> (a -> (u <:.> w) b) -> v0 b

($$|-) :: (Covariant v0, Covariant w0) => ((v0 :. (w0 :. (v <:.> t))) := a) -> (a -> (u <:.> w) b) -> (v0 :. w0) := b

($$$|-) :: (Covariant v0, Covariant w0, Covariant x) => ((v0 :. (w0 :. (x :. (v <:.> t)))) := a) -> (a -> (u <:.> w) b) -> (v0 :. (w0 :. x)) := b

($$$$|-) :: (Covariant v0, Covariant w0, Covariant x, Covariant y) => ((v0 :. (w0 :. (x :. (y :. (v <:.> t))))) := a) -> (a -> (u <:.> w) b) -> (v0 :. (w0 :. (x :. y))) := b

Covariant (Kan ('Right :: Type -> Wye Type) t u b)

Defined in Pandora.Paradigm.Primary.Transformer.Kan

Methods

(<$>) :: (a -> b0) -> Kan 'Right t u b a -> Kan 'Right t u b b0

comap :: (a -> b0) -> Kan 'Right t u b a -> Kan 'Right t u b b0

(<$) :: a -> Kan 'Right t u b b0 -> Kan 'Right t u b a

($>) :: Kan 'Right t u b a -> b0 -> Kan 'Right t u b b0

void :: Kan 'Right t u b a -> Kan 'Right t u b ()

loeb :: Kan 'Right t u b (a <:= Kan 'Right t u b) -> Kan 'Right t u b a

(<&>) :: Kan 'Right t u b a -> (a -> b0) -> Kan 'Right t u b b0

(<$$>) :: Covariant u0 => (a -> b0) -> ((Kan 'Right t u b :. u0) := a) -> (Kan 'Right t u b :. u0) := b0

(<$$$>) :: (Covariant u0, Covariant v) => (a -> b0) -> ((Kan 'Right t u b :. (u0 :. v)) := a) -> (Kan 'Right t u b :. (u0 :. v)) := b0

(<$$$$>) :: (Covariant u0, Covariant v, Covariant w) => (a -> b0) -> ((Kan 'Right t u b :. (u0 :. (v :. w))) := a) -> (Kan 'Right t u b :. (u0 :. (v :. w))) := b0

(<&&>) :: Covariant u0 => ((Kan 'Right t u b :. u0) := a) -> (a -> b0) -> (Kan 'Right t u b :. u0) := b0

(<&&&>) :: (Covariant u0, Covariant v) => ((Kan 'Right t u b :. (u0 :. v)) := a) -> (a -> b0) -> (Kan 'Right t u b :. (u0 :. v)) := b0

(<&&&&>) :: (Covariant u0, Covariant v, Covariant w) => ((Kan 'Right t u b :. (u0 :. (v :. w))) := a) -> (a -> b0) -> (Kan 'Right t u b :. (u0 :. (v :. w))) := b0

(.#..) :: (Kan 'Right t u b ~ v a, Category v) => v c d -> ((v a :. v b0) := c) -> (v a :. v b0) := d

(.#...) :: (Kan 'Right t u b ~ v a, Kan 'Right t u b ~ v b0, Category v, Covariant (v a), Covariant (v b0)) => v d e -> ((v a :. (v b0 :. v c)) := d) -> (v a :. (v b0 :. v c)) := e

(.#....) :: (Kan 'Right t u b ~ v a, Kan 'Right t u b ~ v b0, Kan 'Right t u b ~ v c, Category v, Covariant (v a), Covariant (v b0), Covariant (v c)) => v e f -> ((v a :. (v b0 :. (v c :. v d))) := e) -> (v a :. (v b0 :. (v c :. v d))) := f

(<$$) :: Covariant u0 => b0 -> ((Kan 'Right t u b :. u0) := a) -> (Kan 'Right t u b :. u0) := b0

(<$$$) :: (Covariant u0, Covariant v) => b0 -> ((Kan 'Right t u b :. (u0 :. v)) := a) -> (Kan 'Right t u b :. (u0 :. v)) := b0

(<$$$$) :: (Covariant u0, Covariant v, Covariant w) => b0 -> ((Kan 'Right t u b :. (u0 :. (v :. w))) := a) -> (Kan 'Right t u b :. (u0 :. (v :. w))) := b0

($$>) :: Covariant u0 => ((Kan 'Right t u b :. u0) := a) -> b0 -> (Kan 'Right t u b :. u0) := b0

($$$>) :: (Covariant u0, Covariant v) => ((Kan 'Right t u b :. (u0 :. v)) := a) -> b0 -> (Kan 'Right t u b :. (u0 :. v)) := b0

($$$$>) :: (Covariant u0, Covariant v, Covariant w) => ((Kan 'Right t u b :. (u0 :. (v :. w))) := a) -> b0 -> (Kan 'Right t u b :. (u0 :. (v :. w))) := b0

(Adjoint t' t, Distributive t) => Liftable (t <:<.>:> t')

Defined in Pandora.Paradigm.Schemes.TUT

Methods

lift :: forall (u :: Type -> Type). Covariant u => u ~> (t <:<.>:> t') u

(Adjoint t t', Distributive t') => Lowerable (t <:<.>:> t')

Defined in Pandora.Paradigm.Schemes.TUT

Methods

lower :: forall (u :: Type -> Type). Covariant u => (t <:<.>:> t') u ~> u

(Covariant ((t <:<.>:> u) t'), Covariant ((v <:<.>:> w) v'), Adjoint t w, Adjoint t' v', Adjoint t v, Adjoint u v, Adjoint v' t') => Adjoint ((t <:<.>:> u) t') ((v <:<.>:> w) v')

Defined in Pandora.Paradigm.Schemes

Methods

(-|) :: a -> ((t <:<.>:> u) t' a -> b) -> (v <:<.>:> w) v' b

(|-) :: (t <:<.>:> u) t' a -> (a -> (v <:<.>:> w) v' b) -> b

phi :: ((t <:<.>:> u) t' a -> b) -> a -> (v <:<.>:> w) v' b

psi :: (a -> (v <:<.>:> w) v' b) -> (t <:<.>:> u) t' a -> b

eta :: a -> ((v <:<.>:> w) v' :. (t <:<.>:> u) t') := a

epsilon :: (((t <:<.>:> u) t' :. (v <:<.>:> w) v') := a) -> a

(-|$) :: Covariant v0 => v0 a -> ((t <:<.>:> u) t' a -> b) -> v0 ((v <:<.>:> w) v' b)

($|-) :: Covariant v0 => v0 ((t <:<.>:> u) t' a) -> (a -> (v <:<.>:> w) v' b) -> v0 b

($$|-) :: (Covariant v0, Covariant w0) => ((v0 :. (w0 :. (t <:<.>:> u) t')) := a) -> (a -> (v <:<.>:> w) v' b) -> (v0 :. w0) := b

($$$|-) :: (Covariant v0, Covariant w0, Covariant x) => ((v0 :. (w0 :. (x :. (t <:<.>:> u) t'))) := a) -> (a -> (v <:<.>:> w) v' b) -> (v0 :. (w0 :. x)) := b

($$$$|-) :: (Covariant v0, Covariant w0, Covariant x, Covariant y) => ((v0 :. (w0 :. (x :. (y :. (t <:<.>:> u) t')))) := a) -> (a -> (v <:<.>:> w) v' b) -> (v0 :. (w0 :. (x :. y))) := b

Pointable t => Liftable (UT Covariant Covariant t)

Defined in Pandora.Paradigm.Schemes.UT

Methods

lift :: forall (u :: Type -> Type). Covariant u => u ~> UT Covariant Covariant t u

Pointable t => Liftable (TU Covariant Covariant t :: (Type -> Type) -> Type -> Type)

Defined in Pandora.Paradigm.Schemes.TU

Methods

lift :: forall (u :: Type -> Type). Covariant u => u ~> TU Covariant Covariant t u

Extractable t => Lowerable (UT Covariant Covariant t)

Defined in Pandora.Paradigm.Schemes.UT

Methods

lower :: forall (u :: Type -> Type). Covariant u => UT Covariant Covariant t u ~> u

Extractable t => Lowerable (TU Covariant Covariant t :: (Type -> Type) -> Type -> Type)

Defined in Pandora.Paradigm.Schemes.TU

Methods

lower :: forall (u :: Type -> Type). Covariant u => TU Covariant Covariant t u ~> u

type Nonempty List

Defined in Pandora.Paradigm.Structure.Some.List

type Nonempty List = Construction Maybe

type Nonempty Rose

Defined in Pandora.Paradigm.Structure.Some.Rose

type Nonempty Rose = Construction List

type Nonempty Binary

Defined in Pandora.Paradigm.Structure.Some.Binary

type Nonempty Binary = Construction Wye

type Zipper List

Defined in Pandora.Paradigm.Structure.Some.List

type Zipper List = Tap ((List <:.:> List) := (:*:))

type Combinative List

Defined in Pandora.Paradigm.Structure.Some.List

type Combinative List = Comprehension Maybe

type Measural 'Length List a

Defined in Pandora.Paradigm.Structure.Some.List

type Measural 'Length List a = Numerator

type Measural 'Heighth Binary a

Defined in Pandora.Paradigm.Structure.Some.Binary

type Measural 'Heighth Binary a = Numerator

type Morphing ('Into (Tap ((List <:.:> List) := (:*:)))) List

Defined in Pandora.Paradigm.Structure.Some.List

type Morphing ('Into (Tap ((List <:.:> List) := (:*:)))) List = Maybe <:.> Zipper List

type Morphing ('Delete ('All :: a -> Occurrence a) :: Morph (a -> Occurrence a)) List

Defined in Pandora.Paradigm.Structure.Some.List

type Morphing ('Delete ('All :: a -> Occurrence a) :: Morph (a -> Occurrence a)) List = (Predicate <:.:> List) := ((->) :: Type -> Type -> Type)

type Morphing ('Delete ('First :: a -> Occurrence a) :: Morph (a -> Occurrence a)) List

Defined in Pandora.Paradigm.Structure.Some.List

type Morphing ('Delete ('First :: a -> Occurrence a) :: Morph (a -> Occurrence a)) List = (Predicate <:.:> List) := ((->) :: Type -> Type -> Type)

type Morphing ('Find ('Element :: a -> Morph a) :: Morph (a -> Morph a)) List

Defined in Pandora.Paradigm.Structure.Some.List

type Morphing ('Find ('Element :: a -> Morph a) :: Morph (a -> Morph a)) List = (Predicate <:.:> Maybe) := ((->) :: Type -> Type -> Type)

type Morphing ('Into (o ds) :: Morph a) Binary

Defined in Pandora.Paradigm.Structure

type Morphing ('Into (o ds) :: Morph a) Binary = Maybe <:.> Morphing ('Into (o ds)) (Construction Wye)

type Morphing ('Into (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))) (Tap ((List <:.:> List) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

type Morphing ('Into (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))) (Tap ((List <:.:> List) := (:*:))) = Maybe <:.> Zipper (Construction Maybe)

type Morphing ('Into (Tap ((List <:.:> List) := (:*:)))) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

type Morphing ('Into (Tap ((List <:.:> List) := (:*:)))) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) = Zipper List

type Morphing ('Into (Tap ((List <:.:> List) := (:*:)))) (Construction Maybe)

Defined in Pandora.Paradigm.Structure.Some.List

type Morphing ('Into (Tap ((List <:.:> List) := (:*:)))) (Construction Maybe) = Zipper List

type Morphing ('Into (Construction Maybe)) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

type Morphing ('Into (Construction Maybe)) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) = Construction Maybe

type Morphing ('Into (Comprehension Maybe)) (Tap ((List <:.:> List) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

type Morphing ('Into (Comprehension Maybe)) (Tap ((List <:.:> List) := (:*:))) = Comprehension Maybe

type Morphing ('Into List) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

type Morphing ('Into List) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) = List

type Morphing ('Into List) (Tap ((List <:.:> List) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

type Morphing ('Into List) (Tap ((List <:.:> List) := (:*:))) = List

type Morphing ('Into List) (Construction Maybe)

Defined in Pandora.Paradigm.Structure.Some.List

type Morphing ('Into List) (Construction Maybe) = List

type Morphing ('Into List) (Vector r)

Defined in Pandora.Paradigm.Primary.Linear.Vector

type Morphing ('Into List) (Vector r) = List

type Morphing ('Into Binary) (Construction Wye)

Defined in Pandora.Paradigm.Structure.Some.Binary

type Morphing ('Into Binary) (Construction Wye) = Binary

type Morphing ('Rotate ('Right :: a -> Wye a) :: Morph (a -> Wye a)) (Tap ((Stream <:.:> Stream) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.Stream

type Morphing ('Rotate ('Right :: a -> Wye a) :: Morph (a -> Wye a)) (Tap ((Stream <:.:> Stream) := (:*:))) = Tap ((Stream <:.:> Stream) := (:*:))

type Morphing ('Rotate ('Left :: a -> Wye a) :: Morph (a -> Wye a)) (Tap ((Stream <:.:> Stream) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.Stream

type Morphing ('Rotate ('Left :: a -> Wye a) :: Morph (a -> Wye a)) (Tap ((Stream <:.:> Stream) := (:*:))) = Tap ((Stream <:.:> Stream) := (:*:))

type Morphing ('Rotate ('Right :: a -> Wye a) :: Morph (a -> Wye a)) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

type Morphing ('Rotate ('Right :: a -> Wye a) :: Morph (a -> Wye a)) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) = Maybe <:.> Zipper (Construction Maybe)

type Morphing ('Rotate ('Left :: a -> Wye a) :: Morph (a -> Wye a)) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

type Morphing ('Rotate ('Left :: a -> Wye a) :: Morph (a -> Wye a)) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) = Maybe <:.> Zipper (Construction Maybe)

type Morphing ('Rotate ('Right :: a -> Wye a) :: Morph (a -> Wye a)) (Tap ((List <:.:> List) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

type Morphing ('Rotate ('Right :: a -> Wye a) :: Morph (a -> Wye a)) (Tap ((List <:.:> List) := (:*:))) = Maybe <:.> Zipper List

type Morphing ('Rotate ('Left :: a -> Wye a) :: Morph (a -> Wye a)) (Tap ((List <:.:> List) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

type Morphing ('Rotate ('Left :: a -> Wye a) :: Morph (a -> Wye a)) (Tap ((List <:.:> List) := (:*:))) = Maybe <:.> Zipper List

type Morphing ('Lookup ('Key :: a -> Morph a) :: Morph (a -> Morph a)) (Prefixed List key)

Defined in Pandora.Paradigm.Structure.Some.List

type Morphing ('Lookup ('Key :: a -> Morph a) :: Morph (a -> Morph a)) (Prefixed List key) = ((->) key :: Type -> Type) <:.> Maybe

type Morphing ('Vary ('Element :: a -> Morph a) :: Morph (a -> Morph a)) (Prefixed (Construction List) k)

Defined in Pandora.Paradigm.Structure.Some.Rose

type Morphing ('Vary ('Element :: a -> Morph a) :: Morph (a -> Morph a)) (Prefixed (Construction List) k) = ((Product (Nonempty List k) <:.> Identity) <:.:> Prefixed (Construction List) k) := ((->) :: Type -> Type -> Type)

type Morphing ('Vary ('Element :: a -> Morph a) :: Morph (a -> Morph a)) (Prefixed Rose k)

Defined in Pandora.Paradigm.Structure.Some.Rose

type Morphing ('Vary ('Element :: a -> Morph a) :: Morph (a -> Morph a)) (Prefixed Rose k) = ((Product (Nonempty List k) <:.> Identity) <:.:> Prefixed Rose k) := ((->) :: Type -> Type -> Type)

type Morphing ('Lookup ('Key :: a -> Morph a) :: Morph (a -> Morph a)) (Prefixed Rose k)

Defined in Pandora.Paradigm.Structure.Some.Rose

type Morphing ('Lookup ('Key :: a -> Morph a) :: Morph (a -> Morph a)) (Prefixed Rose k) = ((->) (Nonempty List k) :: Type -> Type) <:.> Maybe

type Morphing ('Vary ('Element :: a -> Morph a) :: Morph (a -> Morph a)) (Prefixed Binary k)

Defined in Pandora.Paradigm.Structure.Some.Binary

type Morphing ('Vary ('Element :: a -> Morph a) :: Morph (a -> Morph a)) (Prefixed Binary k) = ((Product k <:.> Identity) <:.:> Prefixed Binary k) := ((->) :: Type -> Type -> Type)

type Morphing ('Lookup ('Key :: a -> Morph a) :: Morph (a -> Morph a)) (Prefixed Binary k)

Defined in Pandora.Paradigm.Structure.Some.Binary

type Morphing ('Lookup ('Key :: a -> Morph a) :: Morph (a -> Morph a)) (Prefixed Binary k) = ((->) k :: Type -> Type) <:.> Maybe

type Morphing ('Into Wye) ((Maybe <:.:> Maybe) := (:*:))

Defined in Pandora.Paradigm.Primary

type Morphing ('Into Wye) ((Maybe <:.:> Maybe) := (:*:)) = Wye

type Morphing ('Rotate ('Up :: a -> Vertical a) :: Morph (a -> Vertical a)) ((Construction Wye <:.:> (Bifurcation <:.> Bicursor)) := (:*:))

Defined in Pandora.Paradigm.Structure.Some.Binary

type Morphing ('Rotate ('Up :: a -> Vertical a) :: Morph (a -> Vertical a)) ((Construction Wye <:.:> (Bifurcation <:.> Bicursor)) := (:*:)) = Maybe <:.> ((Construction Wye <:.:> (Bifurcation <:.> Bicursor)) := (:*:))

type Morphing ('Rotate ('Down ('Right :: a -> Wye a)) :: Morph (Vertical (a -> Wye a))) ((Construction Wye <:.:> (Bifurcation <:.> Bicursor)) := (:*:))

Defined in Pandora.Paradigm.Structure.Some.Binary

type Morphing ('Rotate ('Down ('Right :: a -> Wye a)) :: Morph (Vertical (a -> Wye a))) ((Construction Wye <:.:> (Bifurcation <:.> Bicursor)) := (:*:)) = Maybe <:.> ((Construction Wye <:.:> (Bifurcation <:.> Bicursor)) := (:*:))

type Morphing ('Rotate ('Down ('Left :: a -> Wye a)) :: Morph (Vertical (a -> Wye a))) ((Construction Wye <:.:> (Bifurcation <:.> Bicursor)) := (:*:))

Defined in Pandora.Paradigm.Structure.Some.Binary

type Morphing ('Rotate ('Down ('Left :: a -> Wye a)) :: Morph (Vertical (a -> Wye a))) ((Construction Wye <:.:> (Bifurcation <:.> Bicursor)) := (:*:)) = Maybe <:.> ((Construction Wye <:.:> (Bifurcation <:.> Bicursor)) := (:*:))

type Morphing ('Pop :: a -> Morph a) List

Defined in Pandora.Paradigm.Structure.Some.List

type Morphing ('Pop :: a -> Morph a) List = List

type Morphing ('Push :: a -> Morph a) List

Defined in Pandora.Paradigm.Structure.Some.List

type Morphing ('Push :: a -> Morph a) List = (Identity <:.:> List) := ((->) :: Type -> Type -> Type)

type Morphing ('Insert :: a -> Morph a) Binary

Defined in Pandora.Paradigm.Structure.Some.Binary

type Morphing ('Insert :: a -> Morph a) Binary = (((Identity <:.:> Comparison) := (:*:)) <:.:> Binary) := ((->) :: Type -> Type -> Type)

type Substructural ('Tail :: a -> Segment a) List

Defined in Pandora.Paradigm.Structure.Some.List

type Substructural ('Tail :: a -> Segment a) List = List

type Substructural ('Root :: a -> Segment a) List

Defined in Pandora.Paradigm.Structure.Some.List

type Substructural ('Root :: a -> Segment a) List = Maybe

type Substructural ('Just :: a -> Maybe a) Rose

Defined in Pandora.Paradigm.Structure.Some.Rose

type Substructural ('Just :: a -> Maybe a) Rose = List <:.> Construction List

type Substructural ('Root :: a -> Segment a) Rose

Defined in Pandora.Paradigm.Structure.Some.Rose

type Substructural ('Root :: a -> Segment a) Rose = Maybe

type Substructural ('Right :: a -> Wye a) Binary

Defined in Pandora.Paradigm.Structure.Some.Binary

type Substructural ('Right :: a -> Wye a) Binary = Binary

type Substructural ('Left :: a -> Wye a) Binary

Defined in Pandora.Paradigm.Structure.Some.Binary

type Substructural ('Left :: a -> Wye a) Binary = Binary

type Substructural ('Right :: a -> Wye a) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

type Substructural ('Right :: a -> Wye a) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) = Construction Maybe

type Substructural ('Left :: a -> Wye a) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

type Substructural ('Left :: a -> Wye a) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) = Construction Maybe

type Substructural ('Root :: a -> Segment a) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

type Substructural ('Root :: a -> Segment a) (Tap ((Construction Maybe <:.:> Construction Maybe) := (:*:))) = Identity

type Substructural ('Right :: a -> Wye a) (Tap ((List <:.:> List) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

type Substructural ('Right :: a -> Wye a) (Tap ((List <:.:> List) := (:*:))) = List

type Substructural ('Left :: a -> Wye a) (Tap ((List <:.:> List) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

type Substructural ('Left :: a -> Wye a) (Tap ((List <:.:> List) := (:*:))) = List

type Substructural ('Root :: a -> Segment a) (Tap ((List <:.:> List) := (:*:)))

Defined in Pandora.Paradigm.Structure.Some.List

type Substructural ('Root :: a -> Segment a) (Tap ((List <:.:> List) := (:*:))) = Identity

type Substructural ('Tail :: a -> Segment a) (Construction List)

Defined in Pandora.Paradigm.Structure.Some.Rose

type Substructural ('Tail :: a -> Segment a) (Construction List) = List <:.> Construction List

type Substructural ('Root :: a -> Segment a) (Construction List)

Defined in Pandora.Paradigm.Structure.Some.Rose

type Substructural ('Root :: a -> Segment a) (Construction List) = Identity