Hyper.Class.Recursive

Classes applying on HyperTypes recursively

Documentation

class Recursive c where

A class of constraint constructors that apply to all recursive child nodes

Methods

recurse :: (HNodes h, c h) => proxy (c h) -> Dict (HNodesConstraint h c)

Lift a recursive constraint to the next layer

Instances

Recursive RTraversable

Defined in Hyper.Class.Recursive

Methods

recurse :: forall (h :: HyperType) proxy. (HNodes h, RTraversable h) => proxy (RTraversable h) -> Dict (HNodesConstraint h RTraversable)

Recursive RNodes

Defined in Hyper.Class.Recursive

Methods

recurse :: forall (h :: HyperType) proxy. (HNodes h, RNodes h) => proxy (RNodes h) -> Dict (HNodesConstraint h RNodes)

Recursive RTraversableInferOf

Defined in Hyper.Class.Infer.InferOf

Methods

recurse :: forall (h :: HyperType) proxy. (HNodes h, RTraversableInferOf h) => proxy (RTraversableInferOf h) -> Dict (HNodesConstraint h RTraversableInferOf)

Recursive (Recursively c)

Defined in Hyper.Class.Recursive

Methods

recurse :: forall (h :: HyperType) proxy. (HNodes h, Recursively c h) => proxy (Recursively c h) -> Dict (HNodesConstraint h (Recursively c))

Recursive (UnifyGen m)

Defined in Hyper.Class.Unify

Methods

recurse :: forall (h :: HyperType) proxy. (HNodes h, UnifyGen m h) => proxy (UnifyGen m h) -> Dict (HNodesConstraint h (UnifyGen m))

Recursive (Unify m)

Defined in Hyper.Class.Unify

Methods

recurse :: forall (h :: HyperType) proxy. (HNodes h, Unify m h) => proxy (Unify m h) -> Dict (HNodesConstraint h (Unify m))

Recursive (Infer m)

Defined in Hyper.Class.Infer

Methods

recurse :: forall (h :: HyperType) proxy. (HNodes h, Infer m h) => proxy (Infer m h) -> Dict (HNodesConstraint h (Infer m))

Recursive (Blame m)

Defined in Hyper.Infer.Blame

Methods

recurse :: forall (h :: HyperType) proxy. (HNodes h, Blame m h) => proxy (Blame m h) -> Dict (HNodesConstraint h (Blame m))

Recursive (HasScheme varTypes m)

Defined in Hyper.Type.AST.Scheme

Methods

recurse :: forall (h :: HyperType) proxy. (HNodes h, HasScheme varTypes m h) => proxy (HasScheme varTypes m h) -> Dict (HNodesConstraint h (HasScheme varTypes m))

class RNodes h => Recursively c h where

A constraint lifted to apply recursively.

Note that in cases where a constraint has dependencies other than RNodes, one will want to create a class such as RTraversable to capture the dependencies, otherwise using it in class contexts will be quite unergonomic.

Minimal complete definition

Nothing

Methods

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

default recursively :: (c h, HNodesConstraint h (Recursively c)) => proxy (c h) -> Dict (c h, HNodesConstraint h (Recursively c))

Instances

c Pure => Recursively c Pure

Defined in Hyper.Class.Recursive

Methods

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

c Prune => Recursively c Prune

Defined in Hyper.Type.Prune

Methods

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

(c (Ann a), Recursively c a) => Recursively c (Ann a)

Defined in Hyper.Combinator.Ann

Methods

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

(c (ANode n), Recursively c n) => Recursively c (ANode n)

Defined in Hyper.Combinator.ANode

Methods

recursively :: proxy (c (ANode n)) -> Dict (c (ANode n), HNodesConstraint (ANode n) (Recursively c))

c (F f) => Recursively c (F f)

Defined in Hyper.Type.Functor

Methods

recursively :: proxy (c (F f)) -> Dict (c (F f), HNodesConstraint (F f) (Recursively c))

(c (App e), Recursively c e) => Recursively c (App e)

Defined in Hyper.Type.AST.App

Methods

recursively :: proxy (c (App e)) -> Dict (c (App e), HNodesConstraint (App e) (Recursively c))

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))

(HNodes h0, HNodes h1, c (HCompose h0 h1), HNodesConstraint h0 (HComposeConstraint0 RNodes h1), HNodesConstraint h0 (HComposeConstraint0 (Recursively c) h1)) => Recursively c (HCompose h0 h1)

Defined in Hyper.Combinator.Compose

Methods

recursively :: proxy (c (HCompose h0 h1)) -> Dict (c (HCompose h0 h1), HNodesConstraint (HCompose h0 h1) (Recursively c))

(c (Scheme v t), Recursively c t) => Recursively c (Scheme v t)

Defined in Hyper.Type.AST.Scheme

Methods

recursively :: proxy (c (Scheme v t)) -> Dict (c (Scheme v t), HNodesConstraint (Scheme v t) (Recursively c))

(c (Lam v t), Recursively c t) => Recursively c (Lam v t)

Defined in Hyper.Type.AST.Lam

Methods

recursively :: proxy (c (Lam v t)) -> Dict (c (Lam v t), HNodesConstraint (Lam v t) (Recursively c))

(c (TypedLam v t e), Recursively c t, Recursively c e) => Recursively c (TypedLam v t e)

Defined in Hyper.Type.AST.TypedLam

Methods

recursively :: proxy (c (TypedLam v t e)) -> Dict (c (TypedLam v t e), HNodesConstraint (TypedLam v t e) (Recursively c))

Recursive (Recursively c)

Defined in Hyper.Class.Recursive

Methods

recurse :: forall (h :: HyperType) proxy. (HNodes h, Recursively c h) => proxy (Recursively c h) -> Dict (HNodesConstraint h (Recursively c))

class HNodes h => RNodes h where

A class of HyperTypes which recursively implement HNodes

Minimal complete definition

Nothing

Methods

recursiveHNodes :: proxy h -> Dict (HNodesConstraint h RNodes)

default recursiveHNodes :: HNodesConstraint h RNodes => proxy h -> Dict (HNodesConstraint h RNodes)

Instances

RNodes Pure

Defined in Hyper.Class.Recursive

Methods

recursiveHNodes :: proxy Pure -> Dict (HNodesConstraint Pure RNodes)

RNodes Prune

Defined in Hyper.Type.Prune

Methods

recursiveHNodes :: proxy Prune -> Dict (HNodesConstraint Prune RNodes)

Recursive RNodes

Defined in Hyper.Class.Recursive

Methods

recurse :: forall (h :: HyperType) proxy. (HNodes h, RNodes h) => proxy (RNodes h) -> Dict (HNodesConstraint h RNodes)

RNodes a => RNodes (Ann a)

Defined in Hyper.Combinator.Ann

Methods

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

RNodes n => RNodes (ANode n)

Defined in Hyper.Combinator.ANode

Methods

recursiveHNodes :: proxy (ANode n) -> Dict (HNodesConstraint (ANode n) RNodes)

RNodes (F f)

Defined in Hyper.Type.Functor

Methods

recursiveHNodes :: proxy (F f) -> Dict (HNodesConstraint (F f) RNodes)

RNodes e => RNodes (App e)

Defined in Hyper.Type.AST.App

Methods

recursiveHNodes :: proxy (App e) -> Dict (HNodesConstraint (App e) RNodes)

RNodes (Const a :: AHyperType -> Type)

Defined in Hyper.Class.Recursive

Methods

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

(HNodes a, HNodes b, HNodesConstraint a (HComposeConstraint0 RNodes b)) => RNodes (HCompose a b)

Defined in Hyper.Combinator.Compose

Methods

recursiveHNodes :: proxy (HCompose a b) -> Dict (HNodesConstraint (HCompose a b) RNodes)

RNodes t => RNodes (Scheme v t)

Defined in Hyper.Type.AST.Scheme

Methods

recursiveHNodes :: proxy (Scheme v t) -> Dict (HNodesConstraint (Scheme v t) RNodes)

RNodes t => RNodes (Lam v t)

Defined in Hyper.Type.AST.Lam

Methods

recursiveHNodes :: proxy (Lam v t) -> Dict (HNodesConstraint (Lam v t) RNodes)

(RNodes t, RNodes e) => RNodes (TypedLam v t e)

Defined in Hyper.Type.AST.TypedLam

Methods

recursiveHNodes :: proxy (TypedLam v t e) -> Dict (HNodesConstraint (TypedLam v t e) RNodes)

class (HTraversable h, Recursively HFunctor h, Recursively HFoldable h) => RTraversable h where

A class of HyperTypes which recursively implement HTraversable

Minimal complete definition

Nothing

Methods

recursiveHTraversable :: proxy h -> Dict (HNodesConstraint h RTraversable)

default recursiveHTraversable :: HNodesConstraint h RTraversable => proxy h -> Dict (HNodesConstraint h RTraversable)

Instances

RTraversable Pure

Defined in Hyper.Class.Recursive

Methods

recursiveHTraversable :: proxy Pure -> Dict (HNodesConstraint Pure RTraversable)

RTraversable Prune

Defined in Hyper.Type.Prune

Methods

recursiveHTraversable :: proxy Prune -> Dict (HNodesConstraint Prune RTraversable)

Recursive RTraversable

Defined in Hyper.Class.Recursive

Methods

recurse :: forall (h :: HyperType) proxy. (HNodes h, RTraversable h) => proxy (RTraversable h) -> Dict (HNodesConstraint h RTraversable)

RTraversable a => RTraversable (Ann a)

Defined in Hyper.Combinator.Ann

Methods

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

RTraversable n => RTraversable (ANode n)

Defined in Hyper.Combinator.ANode

Methods

recursiveHTraversable :: proxy (ANode n) -> Dict (HNodesConstraint (ANode n) RTraversable)

Traversable f => RTraversable (F f)

Defined in Hyper.Type.Functor

Methods

recursiveHTraversable :: proxy (F f) -> Dict (HNodesConstraint (F f) RTraversable)

RTraversable e => RTraversable (App e)

Defined in Hyper.Type.AST.App

Methods

recursiveHTraversable :: proxy (App e) -> Dict (HNodesConstraint (App e) RTraversable)

RTraversable (Const a :: AHyperType -> Type)

Defined in Hyper.Class.Recursive

Methods

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

(HTraversable a, HTraversable b, HNodesConstraint a (HComposeConstraint0 RNodes b), HNodesConstraint a (HComposeConstraint0 (Recursively HFunctor) b), HNodesConstraint a (HComposeConstraint0 (Recursively HFoldable) b), HNodesConstraint a (HComposeConstraint0 RTraversable b)) => RTraversable (HCompose a b)

Defined in Hyper.Combinator.Compose

Methods

recursiveHTraversable :: proxy (HCompose a b) -> Dict (HNodesConstraint (HCompose a b) RTraversable)

(HTraversable (Scheme v t), RTraversable t) => RTraversable (Scheme v t)

Defined in Hyper.Type.AST.Scheme

Methods

recursiveHTraversable :: proxy (Scheme v t) -> Dict (HNodesConstraint (Scheme v t) RTraversable)

RTraversable t => RTraversable (Lam v t)

Defined in Hyper.Type.AST.Lam

Methods

recursiveHTraversable :: proxy (Lam v t) -> Dict (HNodesConstraint (Lam v t) RTraversable)

(RTraversable t, RTraversable e) => RTraversable (TypedLam v t e)

Defined in Hyper.Type.AST.TypedLam

Methods

recursiveHTraversable :: proxy (TypedLam v t e) -> Dict (HNodesConstraint (TypedLam v t e) RTraversable)

proxyArgument :: proxy (f h :: Constraint) -> Proxy (h :: HyperType)

Helper Proxy combinator that is useful in many instances of Recursive