Hyper.Type

A HyperType is a type parameterized by a hypertype.

This infinite definition is expressible using the AHyperType Kind for hypertypes.

For more information see the README.

Documentation

type HyperType = AHyperType -> Type

A hypertype is a type parameterized by a hypertype

newtype AHyperType

A Kind for HyperTypes

Constructors

AHyperType HyperType

Instances

c (Const a :: AHyperType -> Type) => Recursively c (Const a :: AHyperType -> Type)

Defined in Hyper.Class.Recursive

Methods

recursively :: proxy (c (Const a)) -> Dict (c (Const a), HNodesConstraint (Const a) (Recursively c))

Infer m h => Infer m (Rec1 h)

Defined in Hyper.Class.Infer

Methods

inferBody :: forall (h0 :: AHyperType -> Type). (Rec1 h # InferChild m h0) -> m (Rec1 h # h0, InferOf (Rec1 h) # UVarOf m)

inferContext :: proxy0 m -> proxy1 (Rec1 h) -> Dict (HNodesConstraint (Rec1 h) (Infer m), HNodesConstraint (InferOf (Rec1 h)) (UnifyGen m))

(InferOf a ~ InferOf b, Infer m a, Infer m b) => Infer m (a :+: b)

Defined in Hyper.Class.Infer

Methods

inferBody :: forall (h :: AHyperType -> Type). ((a :+: b) # InferChild m h) -> m ((a :+: b) # h, InferOf (a :+: b) # UVarOf m)

inferContext :: proxy0 m -> proxy1 (a :+: b) -> Dict (HNodesConstraint (a :+: b) (Infer m), HNodesConstraint (InferOf (a :+: b)) (UnifyGen m))

Infer m h => Infer m (M1 i c h)

Defined in Hyper.Class.Infer

Methods

inferBody :: forall (h0 :: AHyperType -> Type). (M1 i c h # InferChild m h0) -> m (M1 i c h # h0, InferOf (M1 i c h) # UVarOf m)

inferContext :: proxy0 m -> proxy1 (M1 i c h) -> Dict (HNodesConstraint (M1 i c h) (Infer m), HNodesConstraint (InferOf (M1 i c h)) (UnifyGen m))

HNodes h => HNodes (Rec1 h)

Defined in Hyper.Class.Nodes

Associated Types

type HNodesConstraint (Rec1 h) c

type HWitnessType (Rec1 h) :: HyperType -> Type

Methods

hLiftConstraint :: forall c (n :: HyperType) r. HNodesConstraint (Rec1 h) c => HWitness (Rec1 h) n -> Proxy c -> (c n => r) -> r

HNodes (Const a :: AHyperType -> Type)

Defined in Hyper.Class.Nodes

Associated Types

type HNodesConstraint (Const a) c

type HWitnessType (Const a) :: HyperType -> Type

Methods

hLiftConstraint :: forall c (n :: HyperType) r. HNodesConstraint (Const a) c => HWitness (Const a) n -> Proxy c -> (c n => r) -> r

Monoid a => HPointed (Const a :: AHyperType -> Type)

Defined in Hyper.Class.Pointed

Methods

hpure :: (forall (n :: HyperType). HWitness (Const a) n -> p # n) -> Const a # p

HFunctor h => HFunctor (Rec1 h)

Defined in Hyper.Class.Functor

Methods

hmap :: (forall (n :: HyperType). HWitness (Rec1 h) n -> (p # n) -> q # n) -> (Rec1 h # p) -> Rec1 h # q

HFunctor (Const a :: AHyperType -> Type)

Defined in Hyper.Class.Functor

Methods

hmap :: (forall (n :: HyperType). HWitness (Const a) n -> (p # n) -> q # n) -> (Const a # p) -> Const a # q

HFoldable h => HFoldable (Rec1 h)

Defined in Hyper.Class.Foldable

Methods

hfoldMap :: Monoid a => (forall (n :: HyperType). HWitness (Rec1 h) n -> (p # n) -> a) -> (Rec1 h # p) -> a

HFoldable (Const a :: AHyperType -> Type)

Defined in Hyper.Class.Foldable

Methods

hfoldMap :: Monoid a0 => (forall (n :: HyperType). HWitness (Const a) n -> (p # n) -> a0) -> (Const a # p) -> a0

HTraversable h => HTraversable (Rec1 h)

Defined in Hyper.Class.Traversable

Methods

hsequence :: forall f (p :: AHyperType -> Type). Applicative f => (Rec1 h # ContainedH f p) -> f (Rec1 h # p)

HTraversable (Const a :: AHyperType -> Type)

Defined in Hyper.Class.Traversable

Methods

hsequence :: forall f (p :: AHyperType -> Type). Applicative f => (Const a # ContainedH f p) -> f (Const a # p)

Semigroup a => HApply (Const a :: AHyperType -> Type)

Defined in Hyper.Class.Apply

Methods

hzip :: forall (p :: HyperType) (q :: HyperType). (Const a # p) -> (Const a # q) -> Const a # (p :*: q)

ZipMatch h => ZipMatch (Rec1 h)

Defined in Hyper.Class.ZipMatch

Methods

zipMatch :: forall (p :: HyperType) (q :: HyperType). (Rec1 h # p) -> (Rec1 h # q) -> Maybe (Rec1 h # (p :*: q))

Eq a => ZipMatch (Const a :: AHyperType -> Type)

Defined in Hyper.Class.ZipMatch

Methods

zipMatch :: forall (p :: HyperType) (q :: HyperType). (Const a # p) -> (Const a # q) -> Maybe (Const a # (p :*: q))

RTraversable (Const a :: AHyperType -> Type)

Defined in Hyper.Class.Recursive

Methods

recursiveHTraversable :: proxy (Const a) -> Dict (HNodesConstraint (Const a) RTraversable)

RNodes (Const a :: AHyperType -> Type)

Defined in Hyper.Class.Recursive

Methods

recursiveHNodes :: proxy (Const a) -> Dict (HNodesConstraint (Const a) RNodes)

(HNodes a, HNodes b) => HNodes (a :+: b)

Defined in Hyper.Class.Nodes

Associated Types

type HNodesConstraint (a :+: b) c

type HWitnessType (a :+: b) :: HyperType -> Type

Methods

hLiftConstraint :: forall c (n :: HyperType) r. HNodesConstraint (a :+: b) c => HWitness (a :+: b) n -> Proxy c -> (c n => r) -> r

(HNodes a, HNodes b) => HNodes (a :*: b)

Defined in Hyper.Class.Nodes

Associated Types

type HNodesConstraint (a :*: b) c

type HWitnessType (a :*: b) :: HyperType -> Type

Methods

hLiftConstraint :: forall c (n :: HyperType) r. HNodesConstraint (a :*: b) c => HWitness (a :*: b) n -> Proxy c -> (c n => r) -> r

(HPointed a, HPointed b) => HPointed (a :*: b)

Defined in Hyper.Class.Pointed

Methods

hpure :: (forall (n :: HyperType). HWitness (a :*: b) n -> p # n) -> (a :*: b) # p

(HFunctor a, HFunctor b) => HFunctor (a :+: b)

Defined in Hyper.Class.Functor

Methods

hmap :: (forall (n :: HyperType). HWitness (a :+: b) n -> (p # n) -> q # n) -> ((a :+: b) # p) -> (a :+: b) # q

(HFunctor a, HFunctor b) => HFunctor (a :*: b)

Defined in Hyper.Class.Functor

Methods

hmap :: (forall (n :: HyperType). HWitness (a :*: b) n -> (p # n) -> q # n) -> ((a :*: b) # p) -> (a :*: b) # q

(HFoldable a, HFoldable b) => HFoldable (a :+: b)

Defined in Hyper.Class.Foldable

Methods

hfoldMap :: Monoid a0 => (forall (n :: HyperType). HWitness (a :+: b) n -> (p # n) -> a0) -> ((a :+: b) # p) -> a0

(HFoldable a, HFoldable b) => HFoldable (a :*: b)

Defined in Hyper.Class.Foldable

Methods

hfoldMap :: Monoid a0 => (forall (n :: HyperType). HWitness (a :*: b) n -> (p # n) -> a0) -> ((a :*: b) # p) -> a0

(HTraversable a, HTraversable b) => HTraversable (a :+: b)

Defined in Hyper.Class.Traversable

Methods

hsequence :: forall f (p :: AHyperType -> Type). Applicative f => ((a :+: b) # ContainedH f p) -> f ((a :+: b) # p)

(HTraversable a, HTraversable b) => HTraversable (a :*: b)

Defined in Hyper.Class.Traversable

Methods

hsequence :: forall f (p :: AHyperType -> Type). Applicative f => ((a :*: b) # ContainedH f p) -> f ((a :*: b) # p)

(HApply a, HApply b) => HApply (a :*: b)

Defined in Hyper.Class.Apply

Methods

hzip :: forall (p :: HyperType) (q :: HyperType). ((a :*: b) # p) -> ((a :*: b) # q) -> (a :*: b) # (p :*: q)

(ZipMatch a, ZipMatch b) => ZipMatch (a :+: b)

Defined in Hyper.Class.ZipMatch

Methods

zipMatch :: forall (p :: HyperType) (q :: HyperType). ((a :+: b) # p) -> ((a :+: b) # q) -> Maybe ((a :+: b) # (p :*: q))

(ZipMatch a, ZipMatch b) => ZipMatch (a :*: b)

Defined in Hyper.Class.ZipMatch

Methods

zipMatch :: forall (p :: HyperType) (q :: HyperType). ((a :*: b) # p) -> ((a :*: b) # q) -> Maybe ((a :*: b) # (p :*: q))

HNodes h => HNodes (M1 i m h)

Defined in Hyper.Class.Nodes

Associated Types

type HNodesConstraint (M1 i m h) c

type HWitnessType (M1 i m h) :: HyperType -> Type

Methods

hLiftConstraint :: forall c (n :: HyperType) r. HNodesConstraint (M1 i m h) c => HWitness (M1 i m h) n -> Proxy c -> (c n => r) -> r

HFunctor h => HFunctor (M1 i m h)

Defined in Hyper.Class.Functor

Methods

hmap :: (forall (n :: HyperType). HWitness (M1 i m h) n -> (p # n) -> q # n) -> (M1 i m h # p) -> M1 i m h # q

HFoldable h => HFoldable (M1 i m h)

Defined in Hyper.Class.Foldable

Methods

hfoldMap :: Monoid a => (forall (n :: HyperType). HWitness (M1 i m h) n -> (p # n) -> a) -> (M1 i m h # p) -> a

HTraversable h => HTraversable (M1 i m h)

Defined in Hyper.Class.Traversable

Methods

hsequence :: forall f (p :: AHyperType -> Type). Applicative f => (M1 i m h # ContainedH f p) -> f (M1 i m h # p)

ZipMatch h => ZipMatch (M1 i m h)

Defined in Hyper.Class.ZipMatch

Methods

zipMatch :: forall (p :: HyperType) (q :: HyperType). (M1 i m h # p) -> (M1 i m h # q) -> Maybe (M1 i m h # (p :*: q))

type HWitnessType (Rec1 h)

Defined in Hyper.Class.Nodes

type HWitnessType (Rec1 h) = HWitnessType h

type HWitnessType (Const a :: AHyperType -> Type)

Defined in Hyper.Class.Nodes

type HWitnessType (Const a :: AHyperType -> Type) = V1 :: HyperType -> Type

type InferOf (Rec1 h)

Defined in Hyper.Class.Infer

type InferOf (Rec1 h) = InferOf h

type HNodesConstraint (Rec1 h) c

Defined in Hyper.Class.Nodes

type HNodesConstraint (Rec1 h) c = HNodesConstraint h c

type HNodesConstraint (Const a :: AHyperType -> Type) _1

Defined in Hyper.Class.Nodes

type HNodesConstraint (Const a :: AHyperType -> Type) _1 = ()

type HWitnessType (a :+: b)

Defined in Hyper.Class.Nodes

type HWitnessType (a :+: b) = HWitness a :+: HWitness b

type HWitnessType (a :*: b)

Defined in Hyper.Class.Nodes

type HWitnessType (a :*: b) = HWitness a :+: HWitness b

type InferOf (a :+: _1)

Defined in Hyper.Class.Infer

type InferOf (a :+: _1) = InferOf a

type HNodesConstraint (a :+: b) x

Defined in Hyper.Class.Nodes

type HNodesConstraint (a :+: b) x = (HNodesConstraint a x, HNodesConstraint b x)

type HNodesConstraint (a :*: b) x

Defined in Hyper.Class.Nodes

type HNodesConstraint (a :*: b) x = (HNodesConstraint a x, HNodesConstraint b x)

type HWitnessType (M1 i m h)

Defined in Hyper.Class.Nodes

type HWitnessType (M1 i m h) = HWitnessType h

type InferOf (M1 _1 _2 h)

Defined in Hyper.Class.Infer

type InferOf (M1 _1 _2 h) = InferOf h

type HNodesConstraint (M1 i m h) c

Defined in Hyper.Class.Nodes

type HNodesConstraint (M1 i m h) c = HNodesConstraint h c

type family GetHyperType h where ...

A type-level getter for the type constructor encoded in AHyperType.

Notes:

• If DataKinds supported lifting field getters this would had been replaced with the type's getter.
• GetHyperType is injective, but due to no support for constrained type families, that's not expressible at the moment.
• Because GetHyperType can't declared as bijective, uses of it may restrict inference. In those cases wrapping terms with the asHyper helper assists Haskell's type inference as if Haskell knew that GetHyperType was bijective.

Equations

GetHyperType ('AHyperType t) = t

type (#) h p = h ('AHyperType p) :: Type

A type synonym to express nested-HKD structures

type (:#) h p = GetHyperType h # p

A type synonym to express child nodes in nested-HKDs

asHyper :: (h # p) -> h # p

An id variant which tells the type checker that its argument is a hypertype.

See the notes for GetHyperType which expand on why this might be used.

Note that asHyper may often be used during development to assist the inference of incomplete code, but removed once the code is complete.