Safe Haskell | None |
---|---|
Language | Haskell2010 |
AST.Term.TypedLam
Documentation
data TypedLam var typ expr k Source #
Instances
(Infer m t, Infer m e, HasInferredType e, Unify m (TypeOf e), HasChild (InferOf t) (TypeOf e), LocalScopeType v (Tree (UVarOf m) (TypeOf e)) m) => Infer m (TypedLam v t e) Source # | |
Defined in AST.Term.TypedLam Methods inferBody :: Tree (TypedLam v t e) (InferChild m k) -> m (Tree (TypedLam v t e) k, Tree (InferOf (TypedLam v t e)) (UVarOf m)) Source # inferContext :: Proxy m -> Proxy (TypedLam v t e) -> Dict (KNodesConstraint (TypedLam v t e) (Infer m), KNodesConstraint (InferOf (TypedLam v t e)) (Unify m)) Source # | |
KNodes (TypedLam var typ expr) Source # | |
Defined in AST.Term.TypedLam Associated Types type KNodesConstraint (TypedLam var typ expr) c :: Constraint Source # Methods kLiftConstraint :: KNodesConstraint (TypedLam var typ expr) c => KWitness (TypedLam var typ expr) n -> Proxy c -> (c n -> r) -> r Source # | |
Monoid var => KPointed (TypedLam var typ expr) Source # | |
KFunctor (TypedLam var typ expr) Source # | |
Semigroup var => KApply (TypedLam var typ expr) Source # | |
KFoldable (TypedLam var typ expr) Source # | |
KTraversable (TypedLam var typ expr) Source # | |
Defined in AST.Term.TypedLam Methods sequenceK :: Applicative f => Tree (TypedLam var typ expr) (ContainedK f p) -> f (Tree (TypedLam var typ expr) p) Source # | |
Constraints (TypedLam var typ expr k) Eq => Eq (TypedLam var typ expr k) Source # | |
Constraints (TypedLam var typ expr k) Ord => Ord (TypedLam var typ expr k) Source # | |
Defined in AST.Term.TypedLam Methods compare :: TypedLam var typ expr k -> TypedLam var typ expr k -> Ordering # (<) :: TypedLam var typ expr k -> TypedLam var typ expr k -> Bool # (<=) :: TypedLam var typ expr k -> TypedLam var typ expr k -> Bool # (>) :: TypedLam var typ expr k -> TypedLam var typ expr k -> Bool # (>=) :: TypedLam var typ expr k -> TypedLam var typ expr k -> Bool # max :: TypedLam var typ expr k -> TypedLam var typ expr k -> TypedLam var typ expr k # min :: TypedLam var typ expr k -> TypedLam var typ expr k -> TypedLam var typ expr k # | |
Constraints (TypedLam var typ expr k) Show => Show (TypedLam var typ expr k) Source # | |
Generic (TypedLam var typ expr k) Source # | |
Constraints (TypedLam var typ expr k) Binary => Binary (TypedLam var typ expr k) Source # | |
Constraints (TypedLam var typ expr k) NFData => NFData (TypedLam var typ expr k) Source # | |
Defined in AST.Term.TypedLam | |
Constraints (TypedLam var typ expr k) Pretty => Pretty (TypedLam var typ expr k) Source # | |
Defined in AST.Term.TypedLam Methods pPrintPrec :: PrettyLevel -> Rational -> TypedLam var typ expr k -> Doc # pPrint :: TypedLam var typ expr k -> Doc # pPrintList :: PrettyLevel -> [TypedLam var typ expr k] -> Doc # | |
data KWitness (TypedLam var typ expr) node Source # | |
Defined in AST.Term.TypedLam | |
type InferOf (TypedLam v t e) Source # | |
Defined in AST.Term.TypedLam | |
type KNodesConstraint (TypedLam var typ expr) constraint Source # | |
Defined in AST.Term.TypedLam | |
type Rep (TypedLam var typ expr k) Source # | |
Defined in AST.Term.TypedLam type Rep (TypedLam var typ expr k) = D1 (MetaData "TypedLam" "AST.Term.TypedLam" "syntax-tree-0.1.0.0-8tfou50n4eQ4Iq1dis9DWN" False) (C1 (MetaCons "TypedLam" PrefixI True) (S1 (MetaSel (Just "_tlIn") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 var) :*: (S1 (MetaSel (Just "_tlInType") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (k # typ)) :*: S1 (MetaSel (Just "_tlOut") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (k # expr))))) |
tlIn :: forall var typ expr k var. Lens (TypedLam var typ expr k) (TypedLam var typ expr k) var var Source #