Safe Haskell	None
Language	Haskell2010

AST.Term.Let

Synopsis

data Let v expr k = Let {
- _letVar :: v
- _letEquals :: k # expr
- _letIn :: k # expr
}
letVar :: forall v expr k v. Lens (Let v expr k) (Let v expr k) v v
letEquals :: forall v expr k. Lens' (Let v expr k) ((#) k expr)
letIn :: forall v expr k. Lens' (Let v expr k) ((#) k expr)
data family KWitness k :: (Knot -> Type) -> Type

Documentation

data Let v expr k Source #

A term for let-expressions with let-generalization.

Let v exprs express let-expressions with vs as variable names and exprs for terms.

Apart from the data type, an Infer instance is also provided.

Constructors

Let
Fields _letVar :: v _letEquals :: k # expr _letIn :: k # expr

Instances

(MonadScopeLevel m, LocalScopeType v (Tree (GTerm (UVarOf m)) (TypeOf expr)) m, Unify m (TypeOf expr), HasInferredType expr, KNodesConstraint (InferOf expr) (Unify m), KTraversable (InferOf expr), Infer m expr) => Infer m (Let v expr) Source #
Instance details Defined in AST.Term.Let Methods inferBody :: Tree (Let v expr) (InferChild m k) -> m (Tree (Let v expr) k, Tree (InferOf (Let v expr)) (UVarOf m)) Source # inferContext :: Proxy m -> Proxy (Let v expr) -> Dict (KNodesConstraint (Let v expr) (Infer m), KNodesConstraint (InferOf (Let v expr)) (Unify m)) Source #
KNodes (Let v expr) Source #
Instance details Defined in AST.Term.Let Associated Types type KNodesConstraint (Let v expr) c :: Constraint Source # data KWitness (Let v expr) a :: Type Source # Methods kLiftConstraint :: KNodesConstraint (Let v expr) c => KWitness (Let v expr) n -> Proxy c -> (c n -> r) -> r Source #
Monoid v => KPointed (Let v expr) Source #
Instance details Defined in AST.Term.Let Methods pureK :: (forall (n :: Knot -> Type). KWitness (Let v expr) n -> Tree p n) -> Tree (Let v expr) p Source #
KFunctor (Let v expr) Source #
Instance details Defined in AST.Term.Let Methods mapK :: (forall (n :: Knot -> Type). KWitness (Let v expr) n -> Tree p n -> Tree q n) -> Tree (Let v expr) p -> Tree (Let v expr) q Source #
Semigroup v => KApply (Let v expr) Source #
Instance details Defined in AST.Term.Let Methods zipK :: Tree (Let v expr) p -> Tree (Let v expr) q -> Tree (Let v expr) (Product p q) Source #
KFoldable (Let v expr) Source #
Instance details Defined in AST.Term.Let Methods foldMapK :: Monoid a => (forall (n :: Knot -> Type). KWitness (Let v expr) n -> Tree p n -> a) -> Tree (Let v expr) p -> a Source #
KTraversable (Let v expr) Source #
Instance details Defined in AST.Term.Let Methods sequenceK :: Applicative f => Tree (Let v expr) (ContainedK f p) -> f (Tree (Let v expr) p) Source #
Constraints (Let v expr k) Eq => Eq (Let v expr k) Source #
Instance details Defined in AST.Term.Let Methods (==) :: Let v expr k -> Let v expr k -> Bool # (/=) :: Let v expr k -> Let v expr k -> Bool #
Constraints (Let v expr k) Ord => Ord (Let v expr k) Source #
Instance details Defined in AST.Term.Let Methods compare :: Let v expr k -> Let v expr k -> Ordering # (<) :: Let v expr k -> Let v expr k -> Bool # (<=) :: Let v expr k -> Let v expr k -> Bool # (>) :: Let v expr k -> Let v expr k -> Bool # (>=) :: Let v expr k -> Let v expr k -> Bool # max :: Let v expr k -> Let v expr k -> Let v expr k # min :: Let v expr k -> Let v expr k -> Let v expr k #
Constraints (Let v expr k) Show => Show (Let v expr k) Source #
Instance details Defined in AST.Term.Let Methods showsPrec :: Int -> Let v expr k -> ShowS # show :: Let v expr k -> String # showList :: [Let v expr k] -> ShowS #
Generic (Let v expr k) Source #
Instance details Defined in AST.Term.Let Associated Types type Rep (Let v expr k) :: Type -> Type # Methods from :: Let v expr k -> Rep (Let v expr k) x # to :: Rep (Let v expr k) x -> Let v expr k #
Constraints (Let v expr k) Binary => Binary (Let v expr k) Source #
Instance details Defined in AST.Term.Let Methods put :: Let v expr k -> Put # get :: Get (Let v expr k) # putList :: [Let v expr k] -> Put #
Constraints (Let v expr k) NFData => NFData (Let v expr k) Source #
Instance details Defined in AST.Term.Let Methods rnf :: Let v expr k -> () #
Constraints (Let v expr k) Pretty => Pretty (Let v expr k) Source #
Instance details Defined in AST.Term.Let Methods pPrintPrec :: PrettyLevel -> Rational -> Let v expr k -> Doc # pPrint :: Let v expr k -> Doc # pPrintList :: PrettyLevel -> [Let v expr k] -> Doc #
data KWitness (Let v expr) node Source #
Instance details Defined in AST.Term.Let data KWitness (Let v expr) node where W_Let_expr :: forall v (expr :: Knot -> Type) (node :: Knot -> Type). KWitness (Let v expr) expr
type InferOf (Let v e) Source #
Instance details Defined in AST.Term.Let type InferOf (Let v e) = InferOf e
type KNodesConstraint (Let v expr) constraint Source #
Instance details Defined in AST.Term.Let type KNodesConstraint (Let v expr) constraint = constraint expr
type Rep (Let v expr k) Source #
Instance details Defined in AST.Term.Let type Rep (Let v expr k) = D1 (MetaData "Let" "AST.Term.Let" "syntax-tree-0.1.0.1-5Y9WhklreXaDnL6Q9tTtln" False) (C1 (MetaCons "Let" PrefixI True) (S1 (MetaSel (Just "_letVar") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 v) :: (S1 (MetaSel (Just "_letEquals") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (k # expr)) :: S1 (MetaSel (Just "_letIn") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (k # expr)))))

letVar :: forall v expr k v. Lens (Let v expr k) (Let v expr k) v v Source #

letEquals :: forall v expr k. Lens' (Let v expr k) ((#) k expr) Source #

letIn :: forall v expr k. Lens' (Let v expr k) ((#) k expr) Source #

data family KWitness k :: (Knot -> Type) -> Type Source #

KWitness k n is a witness that n is a node of k

Instances

data KWitness Pure node Source #
Instance details Defined in AST.Knot.Pure data KWitness Pure node where W_Pure_Pure :: forall (node :: Knot -> Type). KWitness Pure Pure
data KWitness Prune node Source #
Instance details Defined in AST.Knot.Prune data KWitness Prune node where W_Prune_Prune :: forall (node :: Knot -> Type). KWitness Prune Prune
data KWitness (ANode c) node Source #
Instance details Defined in AST.Combinator.ANode data KWitness (ANode c) node where W_ANode_c :: forall (c :: Knot -> Type) (node :: Knot -> Type). KWitness (ANode c) c
data KWitness (F f) node Source #
Instance details Defined in AST.Knot.Functor data KWitness (F f) node where W_F_F_f :: forall (f :: Type -> Type) (node :: Knot -> Type). KWitness (F f) (F f)
data KWitness (Ann a) node Source #
Instance details Defined in AST.Knot.Ann data KWitness (Ann a) node where W_Ann_Ann_a :: forall a (node :: Knot -> Type). KWitness (Ann a) (Ann a)
data KWitness (UnifyError t) n Source #
Instance details Defined in AST.Unify.Error data KWitness (UnifyError t) n where W_UnifyError_t :: forall (t :: Knot -> Type) (n :: Knot -> Type). KWitness (UnifyError t) t E_UnifyError_t :: forall (t :: Knot -> Type) (n :: Knot -> Type). KWitness t n -> KWitness (UnifyError t) n
data KWitness (FuncType typ) node Source #
Instance details Defined in AST.Term.FuncType data KWitness (FuncType typ) node where W_FuncType_typ :: forall (typ :: Knot -> Type) (node :: Knot -> Type). KWitness (FuncType typ) typ
data KWitness (LoadedNominalDecl t) n Source #
Instance details Defined in AST.Term.Nominal data KWitness (LoadedNominalDecl t) n = E_LoadedNominalDecl_Body (KRecWitness t n) \| E_LoadedNominalDecl_NomVarTypes (KWitness (NomVarTypes t) n)
data KWitness (NominalDecl typ) node Source #
Instance details Defined in AST.Term.Nominal data KWitness (NominalDecl typ) node = E_NominalDecl_Scheme_NomVarTypes_typ_typ (KWitness (Scheme (NomVarTypes typ) typ) node)
data KWitness (App expr) node Source #
Instance details Defined in AST.Term.App data KWitness (App expr) node where W_App_expr :: forall (expr :: Knot -> Type) (node :: Knot -> Type). KWitness (App expr) expr
data KWitness (ScopeTypes t) node Source #
Instance details Defined in AST.Term.NamelessScope data KWitness (ScopeTypes t) node where W_ScopeTypes_t :: forall (t :: Knot -> Type) (node :: Knot -> Type). KWitness (ScopeTypes t) t
data KWitness (Const a :: Knot -> Type) i Source #
Instance details Defined in AST.Class.Nodes data KWitness (Const a :: Knot -> Type) i
data KWitness (Flip GTerm a) n Source #
Instance details Defined in AST.Unify.Generalize data KWitness (Flip GTerm a) n = E_Flip_GTerm (KRecWitness a n)
data KWitness (Flip (ITerm a) e) n Source #
Instance details Defined in AST.Infer.Term data KWitness (Flip (ITerm a) e) n where E_Flip_ITerm_InferOf_e :: forall a (e :: Knot -> Type) (n :: Knot -> Type). KWitness (InferOf e) n -> KWitness (Flip (ITerm a) e) n E_Flip_ITerm_e :: forall a (e :: Knot -> Type) (n :: Knot -> Type) (f :: Knot -> Type). KWitness e f -> KWitness (Flip (ITerm a) f) n -> KWitness (Flip (ITerm a) e) n
data KWitness (Flip (BTerm a) e) n Source #
Instance details Defined in AST.Infer.Blame data KWitness (Flip (BTerm a) e) n where E_Flip_BTerm_InferOf_e :: forall a (e :: Knot -> Type) (n :: Knot -> Type). KWitness (InferOf e) n -> KWitness (Flip (BTerm a) e) n E_Flip_BTerm_e :: forall a (e :: Knot -> Type) (n :: Knot -> Type) (f :: Knot -> Type). KWitness e f -> KWitness (Flip (BTerm a) f) n -> KWitness (Flip (BTerm a) e) n
data KWitness (Compose a b) n Source #
Instance details Defined in AST.Combinator.Compose data KWitness (Compose a b) n where KWitness_Compose :: forall (a :: Knot -> Type) (b :: Knot -> Type) (n :: Knot -> Type) (a0 :: Knot -> Type) (b0 :: Knot -> Type). KWitness a a0 -> KWitness b b0 -> KWitness (Compose a b) (Compose a0 b0)
data KWitness (TermMap k expr) node Source #
Instance details Defined in AST.Term.Map data KWitness (TermMap k expr) node where W_TermMap_expr :: forall k (expr :: Knot -> Type) (node :: Knot -> Type). KWitness (TermMap k expr) expr
data KWitness (Var v expr) node Source #
Instance details Defined in AST.Term.Var data KWitness (Var v expr) node
data KWitness (Scheme varTypes typ) node Source #
Instance details Defined in AST.Term.Scheme data KWitness (Scheme varTypes typ) node where W_Scheme_typ :: forall (varTypes :: Knot -> Type) (typ :: Knot -> Type) (node :: Knot -> Type). KWitness (Scheme varTypes typ) typ
data KWitness (TypeSig vars term) node Source #
Instance details Defined in AST.Term.TypeSig data KWitness (TypeSig vars term) node where W_TypeSig_term :: forall (vars :: Knot -> Type) (term :: Knot -> Type) (node :: Knot -> Type). KWitness (TypeSig vars term) term W_TypeSig_Scheme_vars_TypeOf_term :: forall (vars :: Knot -> Type) (term :: Knot -> Type) (node :: Knot -> Type). KWitness (TypeSig vars term) (Scheme vars (TypeOf term))
data KWitness (FromNom nomId term) node Source #
Instance details Defined in AST.Term.Nominal data KWitness (FromNom nomId term) node
data KWitness (ToNom nomId term) node Source #
Instance details Defined in AST.Term.Nominal data KWitness (ToNom nomId term) node where W_ToNom_term :: forall nomId (term :: Knot -> Type) (node :: Knot -> Type). KWitness (ToNom nomId term) term
data KWitness (NominalInst n v) c Source #
Instance details Defined in AST.Term.Nominal data KWitness (NominalInst n v) c = E_NominalInst_k (KWitness v c)
data KWitness (Let v expr) node Source #
Instance details Defined in AST.Term.Let data KWitness (Let v expr) node where W_Let_expr :: forall v (expr :: Knot -> Type) (node :: Knot -> Type). KWitness (Let v expr) expr
data KWitness (Lam v expr) node Source #
Instance details Defined in AST.Term.Lam data KWitness (Lam v expr) node where W_Lam_expr :: forall v (expr :: Knot -> Type) (node :: Knot -> Type). KWitness (Lam v expr) expr
data KWitness (Scope expr a) node Source #
Instance details Defined in AST.Term.NamelessScope data KWitness (Scope expr a) node where W_Scope_expr_Maybe_a :: forall (expr :: Type -> Knot -> Type) a (node :: Knot -> Type). KWitness (Scope expr a) (expr (Maybe a))
data KWitness (ScopeVar expr a) node Source #
Instance details Defined in AST.Term.NamelessScope data KWitness (ScopeVar expr a) node
data KWitness (Product a b) n Source #
Instance details Defined in AST.Class.Nodes data KWitness (Product a b) n = E_Product_a (KWitness a n) \| E_Product_b (KWitness b n)
data KWitness (Sum a b) n Source #
Instance details Defined in AST.Class.Nodes data KWitness (Sum a b) n = E_Sum_a (KWitness a n) \| E_Sum_b (KWitness b n)
data KWitness (FlatRowExtends key val rest) node Source #
Instance details Defined in AST.Term.Row data KWitness (FlatRowExtends key val rest) node where W_FlatRowExtends_val :: forall key (val :: Knot -> Type) (rest :: Knot -> Type) (node :: Knot -> Type). KWitness (FlatRowExtends key val rest) val W_FlatRowExtends_rest :: forall key (val :: Knot -> Type) (rest :: Knot -> Type) (node :: Knot -> Type). KWitness (FlatRowExtends key val rest) rest
data KWitness (RowExtend key val rest) node Source #
Instance details Defined in AST.Term.Row data KWitness (RowExtend key val rest) node where W_RowExtend_val :: forall key (val :: Knot -> Type) (rest :: Knot -> Type) (node :: Knot -> Type). KWitness (RowExtend key val rest) val W_RowExtend_rest :: forall key (val :: Knot -> Type) (rest :: Knot -> Type) (node :: Knot -> Type). KWitness (RowExtend key val rest) rest
data KWitness (TypedLam var typ expr) node Source #
Instance details Defined in AST.Term.TypedLam data KWitness (TypedLam var typ expr) node where W_TypedLam_typ :: forall var (typ :: Knot -> Type) (expr :: Knot -> Type) (node :: Knot -> Type). KWitness (TypedLam var typ expr) typ W_TypedLam_expr :: forall var (typ :: Knot -> Type) (expr :: Knot -> Type) (node :: Knot -> Type). KWitness (TypedLam var typ expr) expr

Key	Shortcut
s	Open this search box
esc	Close this search box
↓,ctrl + j	Move down in search results
↑,ctrl + k	Move up in search results
↵	Go to active search result