Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- class HasInferredType t where
- class HasInferredValue t where
- inferredValue :: Lens' (Tree (InferOf t) v) (Tree v t)
- class KFunctor (InferOf k) => KFunctorInferOf k
- class KFoldable (InferOf k) => KFoldableInferOf k
- class (KTraversable (InferOf k), Recursively KFunctorInferOf k, Recursively KFoldableInferOf k) => RTraversableInferOf k
Documentation
class HasInferredType t where Source #
HasInferredType t
represents that InferOf t
contains a TypeOf t
, which represents its inferred type.
class HasInferredValue t where Source #
HasInferredValue t
represents that InferOf t
contains an inferred value for t
.
class KFunctor (InferOf k) => KFunctorInferOf k Source #
Instances
KFunctor (InferOf k) => KFunctorInferOf k Source # | |
Defined in AST.Class.Infer.InferOf |
class KFoldable (InferOf k) => KFoldableInferOf k Source #
Instances
KFoldable (InferOf k) => KFoldableInferOf k Source # | |
Defined in AST.Class.Infer.InferOf |
class (KTraversable (InferOf k), Recursively KFunctorInferOf k, Recursively KFoldableInferOf k) => RTraversableInferOf k Source #
Instances
Recursive RTraversableInferOf Source # | |
Defined in AST.Class.Infer.InferOf recurse :: (KNodes k, RTraversableInferOf k) => Proxy (RTraversableInferOf k) -> Dict (KNodesConstraint k RTraversableInferOf) Source # | |
(RTraversable t, RTraversableInferOf t) => RTraversableInferOf (Scheme v t) Source # | |
Defined in AST.Term.Scheme rTraversableInferOfRec :: Proxy (Scheme v t) -> Dict (KNodesConstraint (Scheme v t) RTraversableInferOf) |