AST.Knot.Ann

A Knot which adds an annotation to every node in a tree

Documentation

data Ann a k

A Knot which adds an annotation to every node in a tree

Constructors

Ann

Fields

• _ann :: a
• _val :: k # Ann a

Instances

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

Defined in AST.Knot.Ann

Methods

recursively :: Proxy (c (Ann a)) -> Dict (c (Ann a), KNodesConstraint (Ann a) (Recursively c))

KNodes (Ann a)

Defined in AST.Knot.Ann

Associated Types

type KNodesConstraint (Ann a) c :: Constraint

data KWitness (Ann a) a :: Type

Methods

kLiftConstraint :: KNodesConstraint (Ann a) c => KWitness (Ann a) n -> Proxy c -> (c n -> r) -> r

Monoid a => KPointed (Ann a)

Defined in AST.Knot.Ann

Methods

pureK :: (forall (n :: Knot -> Type). KWitness (Ann a) n -> Tree p n) -> Tree (Ann a) p

KFunctor (Ann a)

Defined in AST.Knot.Ann

Methods

mapK :: (forall (n :: Knot -> Type). KWitness (Ann a) n -> Tree p n -> Tree q n) -> Tree (Ann a) p -> Tree (Ann a) q

Semigroup a => KApply (Ann a)

Defined in AST.Knot.Ann

Methods

zipK :: Tree (Ann a) p -> Tree (Ann a) q -> Tree (Ann a) (Product p q)

KFoldable (Ann a)

Defined in AST.Knot.Ann

Methods

foldMapK :: Monoid a0 => (forall (n :: Knot -> Type). KWitness (Ann a) n -> Tree p n -> a0) -> Tree (Ann a) p -> a0

KTraversable (Ann a)

Defined in AST.Knot.Ann

Methods

sequenceK :: Applicative f => Tree (Ann a) (ContainedK f p) -> f (Tree (Ann a) p)

Eq a => ZipMatch (Ann a)

Defined in AST.Knot.Ann

Methods

zipMatch :: Tree (Ann a) p -> Tree (Ann a) q -> Maybe (Tree (Ann a) (Product p q))

RTraversable (Ann a)

Defined in AST.Knot.Ann

Methods

recursiveKTraversable :: Proxy (Ann a) -> Dict (KNodesConstraint (Ann a) RTraversable)

RNodes (Ann a)

Defined in AST.Knot.Ann

Methods

recursiveKNodes :: Proxy (Ann a) -> Dict (KNodesConstraint (Ann a) RNodes)

Monoid a => KMonad (Ann a)

Defined in AST.Knot.Ann

Methods

joinK :: Recursively KFunctor p => Tree (Compose (Ann a) (Ann a)) p -> Tree (Ann a) p

Constraints (Ann a k) Eq => Eq (Ann a k)

Defined in AST.Knot.Ann

Methods

(==) :: Ann a k -> Ann a k -> Bool

(/=) :: Ann a k -> Ann a k -> Bool

Constraints (Ann a k) Ord => Ord (Ann a k)

Defined in AST.Knot.Ann

Methods

compare :: Ann a k -> Ann a k -> Ordering

(<) :: Ann a k -> Ann a k -> Bool

(<=) :: Ann a k -> Ann a k -> Bool

(>) :: Ann a k -> Ann a k -> Bool

(>=) :: Ann a k -> Ann a k -> Bool

max :: Ann a k -> Ann a k -> Ann a k

min :: Ann a k -> Ann a k -> Ann a k

Constraints (Ann a k) Show => Show (Ann a k)

Defined in AST.Knot.Ann

Methods

showsPrec :: Int -> Ann a k -> ShowS

show :: Ann a k -> String

showList :: [Ann a k] -> ShowS

Generic (Ann a k)

Defined in AST.Knot.Ann

Associated Types

type Rep (Ann a k) :: Type -> Type

Methods

from :: Ann a k -> Rep (Ann a k) x

to :: Rep (Ann a k) x -> Ann a k

(Arbitrary a, Arbitrary (k # Ann a)) => Arbitrary (Ann a k)

Defined in AST.Knot.Ann.Arbitrary

Methods

arbitrary :: Gen (Ann a k)

shrink :: Ann a k -> [Ann a k]

Constraints (Ann a k) Binary => Binary (Ann a k)

Defined in AST.Knot.Ann

Methods

put :: Ann a k -> Put

get :: Get (Ann a k)

putList :: [Ann a k] -> Put

Constraints (Ann a k) NFData => NFData (Ann a k)

Defined in AST.Knot.Ann

Methods

rnf :: Ann a k -> ()

Constraints (Ann a t) Pretty => Pretty (Ann a t)

Defined in AST.Knot.Ann

Methods

pPrintPrec :: PrettyLevel -> Rational -> Ann a t -> Doc

pPrint :: Ann a t -> Doc

pPrintList :: PrettyLevel -> [Ann a t] -> Doc

(Arbitrary a, ArbitraryWithContext (k # Ann a)) => ArbitraryWithContext (Ann a k)

Defined in AST.Knot.Ann.Arbitrary

Associated Types

type Context (Ann a k) :: Type

Methods

arbitraryCtx :: Context (Ann a k) -> Gen (Ann a k)

data KWitness (Ann a) node

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)

type KNodesConstraint (Ann a) constraint

Defined in AST.Knot.Ann

type KNodesConstraint (Ann a) constraint = constraint (Ann a)

type Rep (Ann a k)

Defined in AST.Knot.Ann

type Rep (Ann a k) = D1 (MetaData "Ann" "AST.Knot.Ann" "syntax-tree-0.1.0.1-5Y9WhklreXaDnL6Q9tTtln" False) (C1 (MetaCons "Ann" PrefixI True) (S1 (MetaSel (Just "_ann") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a) :*: S1 (MetaSel (Just "_val") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (k # Ann a))))

type Context (Ann a k)

Defined in AST.Knot.Ann.Arbitrary

type Context (Ann a k) = Context (k # Ann a)

ann :: forall a k. Lens' (Ann a k) a

val :: forall a k k. Lens (Ann a k) (Ann a k) ((#) k (Ann a)) ((#) k (Ann a))

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

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

Instances

data KWitness Pure node

Defined in AST.Knot.Pure

data KWitness Pure node where

• W_Pure_Pure :: forall (node :: Knot -> Type). KWitness Pure Pure

data KWitness Prune node

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

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

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

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

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

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

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

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

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

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

Defined in AST.Class.Nodes

data KWitness (Const a :: Knot -> Type) i

data KWitness (Flip GTerm a) n

Defined in AST.Unify.Generalize

data KWitness (Flip GTerm a) n = E_Flip_GTerm (KRecWitness a n)

data KWitness (Flip (ITerm a) e) n

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

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

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

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

Defined in AST.Term.Var

data KWitness (Var v expr) node

data KWitness (Scheme varTypes typ) node

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

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

Defined in AST.Term.Nominal

data KWitness (FromNom nomId term) node

data KWitness (ToNom nomId term) node

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

Defined in AST.Term.Nominal

data KWitness (NominalInst n v) c = E_NominalInst_k (KWitness v c)

data KWitness (Let v expr) node

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

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

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

Defined in AST.Term.NamelessScope

data KWitness (ScopeVar expr a) node

data KWitness (Product a b) n

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

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

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

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

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

annotations :: forall k a b. RTraversable k => Traversal (Tree (Ann a) k) (Tree (Ann b) k) a b

A Traversal from an annotated tree to its annotations

strip :: Recursively KFunctor expr => Tree (Ann a) expr -> Tree Pure expr

Remove a tree's annotations

addAnnotations :: Recursively KFunctor k => (forall n. KRecWitness k n -> Tree n (Ann a) -> a) -> Tree Pure k -> Tree (Ann a) k

Compute annotations for a tree from the bottom up