Safe Haskell	None
Language	Haskell2010

AST.Class.Recursive

Description

Classes applying on Knots recursively

Synopsis

class Recursive c where
- recurse :: (KNodes k, c k) => Proxy (c k) -> Dict (KNodesConstraint k c)
class RNodes k => Recursively c k where
- recursively :: Proxy (c k) -> Dict (c k, KNodesConstraint k (Recursively c))
class KNodes k => RNodes k
class (KTraversable k, Recursively KFunctor k, Recursively KFoldable k) => RTraversable k

Documentation

class Recursive c where Source #

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

Methods

recurse :: (KNodes k, c k) => Proxy (c k) -> Dict (KNodesConstraint k c) Source #

Lift a recursive constraint to the next layer

Instances

Recursive RTraversable Source #
Instance details Defined in AST.Class.Recursive Methods recurse :: (KNodes k, RTraversable k) => Proxy (RTraversable k) -> Dict (KNodesConstraint k RTraversable) Source #
Recursive RNodes Source #
Instance details Defined in AST.Class.Recursive Methods recurse :: (KNodes k, RNodes k) => Proxy (RNodes k) -> Dict (KNodesConstraint k RNodes) Source #
Recursive RTraversableInferOf Source #
Instance details Defined in AST.Class.Infer.InferOf Methods recurse :: (KNodes k, RTraversableInferOf k) => Proxy (RTraversableInferOf k) -> Dict (KNodesConstraint k RTraversableInferOf) Source #
Recursive (Recursively c) Source #
Instance details Defined in AST.Class.Recursive Methods recurse :: (KNodes k, Recursively c k) => Proxy (Recursively c k) -> Dict (KNodesConstraint k (Recursively c)) Source #
Recursive (Unify m) Source #
Instance details Defined in AST.Class.Unify Methods recurse :: (KNodes k, Unify m k) => Proxy (Unify m k) -> Dict (KNodesConstraint k (Unify m)) Source #
Recursive (Infer m) Source #
Instance details Defined in AST.Class.Infer Methods recurse :: (KNodes k, Infer m k) => Proxy (Infer m k) -> Dict (KNodesConstraint k (Infer m)) Source #
Recursive (ITermVarsConstraint c) Source #
Instance details Defined in AST.Infer.Term Methods recurse :: (KNodes k, ITermVarsConstraint c k) => Proxy (ITermVarsConstraint c k) -> Dict (KNodesConstraint k (ITermVarsConstraint c)) Source #
Recursive (Blame m) Source #
Instance details Defined in AST.Infer.Blame Methods recurse :: (KNodes k, Blame m k) => Proxy (Blame m k) -> Dict (KNodesConstraint k (Blame m)) Source #
Recursive (HasScheme varTypes m) Source #
Instance details Defined in AST.Term.Scheme Methods recurse :: (KNodes k, HasScheme varTypes m k) => Proxy (HasScheme varTypes m k) -> Dict (KNodesConstraint k (HasScheme varTypes m)) Source #

class RNodes k => Recursively c k where Source #

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 k) -> Dict (c k, KNodesConstraint k (Recursively c)) Source #

recursively :: (c k, KNodesConstraint k (Recursively c)) => Proxy (c k) -> Dict (c k, KNodesConstraint k (Recursively c)) Source #

Instances

c Pure => Recursively c Pure Source #
Instance details Defined in AST.Class.Recursive Methods recursively :: Proxy (c Pure) -> Dict (c Pure, KNodesConstraint Pure (Recursively c)) Source #
c Prune => Recursively c Prune Source #
Instance details Defined in AST.Knot.Prune Methods recursively :: Proxy (c Prune) -> Dict (c Prune, KNodesConstraint Prune (Recursively c)) Source #
c (F f) => Recursively c (F f) Source #
Instance details Defined in AST.Knot.Functor Methods recursively :: Proxy (c (F f)) -> Dict (c (F f), KNodesConstraint (F f) (Recursively c)) Source #
c (Ann a) => Recursively c (Ann a) Source #
Instance details Defined in AST.Knot.Ann Methods recursively :: Proxy (c (Ann a)) -> Dict (c (Ann a), KNodesConstraint (Ann a) (Recursively c)) Source #
c (Const a :: Knot -> Type) => Recursively c (Const a :: Knot -> Type) Source #
Instance details Defined in AST.Class.Recursive Methods recursively :: Proxy (c (Const a)) -> Dict (c (Const a), KNodesConstraint (Const a) (Recursively c)) Source #
(c (Scheme v t), Recursively c t) => Recursively c (Scheme v t) Source #
Instance details Defined in AST.Term.Scheme Methods recursively :: Proxy (c (Scheme v t)) -> Dict (c (Scheme v t), KNodesConstraint (Scheme v t) (Recursively c)) Source #
Recursive (Recursively c) Source #
Instance details Defined in AST.Class.Recursive Methods recurse :: (KNodes k, Recursively c k) => Proxy (Recursively c k) -> Dict (KNodesConstraint k (Recursively c)) Source #

class KNodes k => RNodes k Source #

A class of Knots which recursively implement KNodes

Instances

RNodes Pure Source #
Instance details Defined in AST.Class.Recursive Methods recursiveKNodes :: Proxy Pure -> Dict (KNodesConstraint Pure RNodes)
RNodes Prune Source #
Instance details Defined in AST.Knot.Prune Methods recursiveKNodes :: Proxy Prune -> Dict (KNodesConstraint Prune RNodes)
Recursive RNodes Source #
Instance details Defined in AST.Class.Recursive Methods recurse :: (KNodes k, RNodes k) => Proxy (RNodes k) -> Dict (KNodesConstraint k RNodes) Source #
RNodes (F f) Source #
Instance details Defined in AST.Knot.Functor Methods recursiveKNodes :: Proxy (F f) -> Dict (KNodesConstraint (F f) RNodes)
RNodes (Ann a) Source #
Instance details Defined in AST.Knot.Ann Methods recursiveKNodes :: Proxy (Ann a) -> Dict (KNodesConstraint (Ann a) RNodes)
RNodes (Const a :: Knot -> Type) Source #
Instance details Defined in AST.Class.Recursive Methods recursiveKNodes :: Proxy (Const a) -> Dict (KNodesConstraint (Const a) RNodes)
RNodes t => RNodes (Scheme v t) Source #
Instance details Defined in AST.Term.Scheme Methods recursiveKNodes :: Proxy (Scheme v t) -> Dict (KNodesConstraint (Scheme v t) RNodes)

class (KTraversable k, Recursively KFunctor k, Recursively KFoldable k) => RTraversable k Source #

A class of Knots which recursively implement KTraversable

Instances

RTraversable Pure Source #
Instance details Defined in AST.Class.Recursive Methods recursiveKTraversable :: Proxy Pure -> Dict (KNodesConstraint Pure RTraversable)
RTraversable Prune Source #
Instance details Defined in AST.Knot.Prune Methods recursiveKTraversable :: Proxy Prune -> Dict (KNodesConstraint Prune RTraversable)
Recursive RTraversable Source #
Instance details Defined in AST.Class.Recursive Methods recurse :: (KNodes k, RTraversable k) => Proxy (RTraversable k) -> Dict (KNodesConstraint k RTraversable) Source #
Traversable f => RTraversable (F f) Source #
Instance details Defined in AST.Knot.Functor Methods recursiveKTraversable :: Proxy (F f) -> Dict (KNodesConstraint (F f) RTraversable)
RTraversable (Ann a) Source #
Instance details Defined in AST.Knot.Ann Methods recursiveKTraversable :: Proxy (Ann a) -> Dict (KNodesConstraint (Ann a) RTraversable)
RTraversable (Const a :: Knot -> Type) Source #
Instance details Defined in AST.Class.Recursive Methods recursiveKTraversable :: Proxy (Const a) -> Dict (KNodesConstraint (Const a) RTraversable)
(KTraversable (Scheme v t), RTraversable t) => RTraversable (Scheme v t) Source #
Instance details Defined in AST.Term.Scheme Methods recursiveKTraversable :: Proxy (Scheme v t) -> Dict (KNodesConstraint (Scheme v t) RTraversable)