AST.Term.Scheme

Type schemes

Documentation

data Scheme varTypes typ k

A type scheme representing a polymorphic type.

Constructors

Scheme

Fields

• _sForAlls :: Tree varTypes QVars
• _sTyp :: k # typ

Instances

(c (Scheme v t), Recursively c t) => Recursively c (Scheme v t)

Defined in AST.Term.Scheme

Methods

recursively :: Proxy (c (Scheme v t)) -> Dict (c (Scheme v t), KNodesConstraint (Scheme v t) (Recursively c))

(Monad m, HasInferredValue typ, Unify m typ, KTraversable varTypes, KNodesConstraint varTypes (MonadInstantiate m), RTraversable typ, Infer m typ) => Infer m (Scheme varTypes typ)

Defined in AST.Term.Scheme

Methods

inferBody :: Tree (Scheme varTypes typ) (InferChild m k) -> m (Tree (Scheme varTypes typ) k, Tree (InferOf (Scheme varTypes typ)) (UVarOf m))

inferContext :: Proxy m -> Proxy (Scheme varTypes typ) -> Dict (KNodesConstraint (Scheme varTypes typ) (Infer m), KNodesConstraint (InferOf (Scheme varTypes typ)) (Unify m))

(RNodes t, c t, Recursive c, ITermVarsConstraint c t) => ITermVarsConstraint c (Scheme v t)

Defined in AST.Term.Scheme

Methods

iTermVarsConstraintCtx :: Proxy c -> Proxy (Scheme v t) -> Dict (ITermVarsConstraintContext c (Scheme v t))

KNodes (Scheme varTypes typ)

Defined in AST.Term.Scheme

Associated Types

type KNodesConstraint (Scheme varTypes typ) c :: Constraint

data KWitness (Scheme varTypes typ) a :: Type

Methods

kLiftConstraint :: KNodesConstraint (Scheme varTypes typ) c => KWitness (Scheme varTypes typ) n -> Proxy c -> (c n -> r) -> r

Monoid (Tree varTypes QVars) => KPointed (Scheme varTypes typ)

Defined in AST.Term.Scheme

Methods

pureK :: (forall (n :: Knot -> Type). KWitness (Scheme varTypes typ) n -> Tree p n) -> Tree (Scheme varTypes typ) p

KFunctor (Scheme varTypes typ)

Defined in AST.Term.Scheme

Methods

mapK :: (forall (n :: Knot -> Type). KWitness (Scheme varTypes typ) n -> Tree p n -> Tree q n) -> Tree (Scheme varTypes typ) p -> Tree (Scheme varTypes typ) q

Semigroup (Tree varTypes QVars) => KApply (Scheme varTypes typ)

Defined in AST.Term.Scheme

Methods

zipK :: Tree (Scheme varTypes typ) p -> Tree (Scheme varTypes typ) q -> Tree (Scheme varTypes typ) (Product p q)

KFoldable (Scheme varTypes typ)

Defined in AST.Term.Scheme

Methods

foldMapK :: Monoid a => (forall (n :: Knot -> Type). KWitness (Scheme varTypes typ) n -> Tree p n -> a) -> Tree (Scheme varTypes typ) p -> a

KTraversable (Scheme varTypes typ)

Defined in AST.Term.Scheme

Methods

sequenceK :: Applicative f => Tree (Scheme varTypes typ) (ContainedK f p) -> f (Tree (Scheme varTypes typ) p)

(KTraversable (Scheme v t), RTraversable t) => RTraversable (Scheme v t)

Defined in AST.Term.Scheme

Methods

recursiveKTraversable :: Proxy (Scheme v t) -> Dict (KNodesConstraint (Scheme v t) RTraversable)

RNodes t => RNodes (Scheme v t)

Defined in AST.Term.Scheme

Methods

recursiveKNodes :: Proxy (Scheme v t) -> Dict (KNodesConstraint (Scheme v t) RNodes)

(RTraversable t, RTraversableInferOf t) => RTraversableInferOf (Scheme v t)

Defined in AST.Term.Scheme

Methods

rTraversableInferOfRec :: Proxy (Scheme v t) -> Dict (KNodesConstraint (Scheme v t) RTraversableInferOf)

Constraints (Scheme varTypes typ k) Eq => Eq (Scheme varTypes typ k)

Defined in AST.Term.Scheme

Methods

(==) :: Scheme varTypes typ k -> Scheme varTypes typ k -> Bool

(/=) :: Scheme varTypes typ k -> Scheme varTypes typ k -> Bool

Constraints (Scheme varTypes typ k) Ord => Ord (Scheme varTypes typ k)

Defined in AST.Term.Scheme

Methods

compare :: Scheme varTypes typ k -> Scheme varTypes typ k -> Ordering

(<) :: Scheme varTypes typ k -> Scheme varTypes typ k -> Bool

(<=) :: Scheme varTypes typ k -> Scheme varTypes typ k -> Bool

(>) :: Scheme varTypes typ k -> Scheme varTypes typ k -> Bool

(>=) :: Scheme varTypes typ k -> Scheme varTypes typ k -> Bool

max :: Scheme varTypes typ k -> Scheme varTypes typ k -> Scheme varTypes typ k

min :: Scheme varTypes typ k -> Scheme varTypes typ k -> Scheme varTypes typ k

Constraints (Scheme varTypes typ k) Show => Show (Scheme varTypes typ k)

Defined in AST.Term.Scheme

Methods

showsPrec :: Int -> Scheme varTypes typ k -> ShowS

show :: Scheme varTypes typ k -> String

showList :: [Scheme varTypes typ k] -> ShowS

Generic (Scheme varTypes typ k)

Defined in AST.Term.Scheme

Associated Types

type Rep (Scheme varTypes typ k) :: Type -> Type

Methods

from :: Scheme varTypes typ k -> Rep (Scheme varTypes typ k) x

to :: Rep (Scheme varTypes typ k) x -> Scheme varTypes typ k

Constraints (Scheme varTypes typ k) Binary => Binary (Scheme varTypes typ k)

Defined in AST.Term.Scheme

Methods

put :: Scheme varTypes typ k -> Put

get :: Get (Scheme varTypes typ k)

putList :: [Scheme varTypes typ k] -> Put

Constraints (Scheme varTypes typ k) NFData => NFData (Scheme varTypes typ k)

Defined in AST.Term.Scheme

Methods

rnf :: Scheme varTypes typ k -> ()

(Pretty (Tree varTypes QVars), Pretty (k # typ)) => Pretty (Scheme varTypes typ k)

Defined in AST.Term.Scheme

Methods

pPrintPrec :: PrettyLevel -> Rational -> Scheme varTypes typ k -> Doc

pPrint :: Scheme varTypes typ k -> Doc

pPrintList :: PrettyLevel -> [Scheme varTypes typ k] -> Doc

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

type InferOf (Scheme v t)

Defined in AST.Term.Scheme

type InferOf (Scheme v t) = Flip GTerm t

type KNodesConstraint (Scheme varTypes typ) constraint

Defined in AST.Term.Scheme

type KNodesConstraint (Scheme varTypes typ) constraint = constraint typ

type Rep (Scheme varTypes typ k)

Defined in AST.Term.Scheme

type Rep (Scheme varTypes typ k) = D1 (MetaData "Scheme" "AST.Term.Scheme" "syntax-tree-0.1.0.1-5Y9WhklreXaDnL6Q9tTtln" False) (C1 (MetaCons "Scheme" PrefixI True) (S1 (MetaSel (Just "_sForAlls") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Tree varTypes QVars)) :*: S1 (MetaSel (Just "_sTyp") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (k # typ))))

sForAlls :: forall varTypes typ k varTypes. Lens (Scheme varTypes typ k) (Scheme varTypes typ k) (Tree varTypes QVars) (Tree varTypes QVars)

sTyp :: forall varTypes typ k typ k. Lens (Scheme varTypes typ k) (Scheme varTypes typ k) ((#) k typ) ((#) k typ)

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

newtype QVars typ

Constructors

QVars (Map (QVar (GetKnot typ)) (TypeConstraintsOf (GetKnot typ)))

Instances

Constraints (QVars typ) Eq => Eq (QVars typ)

Defined in AST.Term.Scheme

Methods

(==) :: QVars typ -> QVars typ -> Bool

(/=) :: QVars typ -> QVars typ -> Bool

Constraints (QVars typ) Ord => Ord (QVars typ)

Defined in AST.Term.Scheme

Methods

compare :: QVars typ -> QVars typ -> Ordering

(<) :: QVars typ -> QVars typ -> Bool

(<=) :: QVars typ -> QVars typ -> Bool

(>) :: QVars typ -> QVars typ -> Bool

(>=) :: QVars typ -> QVars typ -> Bool

max :: QVars typ -> QVars typ -> QVars typ

min :: QVars typ -> QVars typ -> QVars typ

Constraints (QVars typ) Show => Show (QVars typ)

Defined in AST.Term.Scheme

Methods

showsPrec :: Int -> QVars typ -> ShowS

show :: QVars typ -> String

showList :: [QVars typ] -> ShowS

Generic (QVars typ)

Defined in AST.Term.Scheme

Associated Types

type Rep (QVars typ) :: Type -> Type

Methods

from :: QVars typ -> Rep (QVars typ) x

to :: Rep (QVars typ) x -> QVars typ

(Ord (QVar (GetKnot typ)), Semigroup (TypeConstraintsOf (GetKnot typ))) => Semigroup (QVars typ)

Defined in AST.Term.Scheme

Methods

(<>) :: QVars typ -> QVars typ -> QVars typ

sconcat :: NonEmpty (QVars typ) -> QVars typ

stimes :: Integral b => b -> QVars typ -> QVars typ

(Ord (QVar (GetKnot typ)), Semigroup (TypeConstraintsOf (GetKnot typ))) => Monoid (QVars typ)

Defined in AST.Term.Scheme

Methods

mempty :: QVars typ

mappend :: QVars typ -> QVars typ -> QVars typ

mconcat :: [QVars typ] -> QVars typ

Constraints (QVars typ) Binary => Binary (QVars typ)

Defined in AST.Term.Scheme

Methods

put :: QVars typ -> Put

get :: Get (QVars typ)

putList :: [QVars typ] -> Put

Constraints (QVars typ) NFData => NFData (QVars typ)

Defined in AST.Term.Scheme

Methods

rnf :: QVars typ -> ()

Ord (QVar (GetKnot typ)) => Ixed (QVars typ)

Defined in AST.Term.Scheme

Methods

ix :: Index (QVars typ) -> Traversal' (QVars typ) (IxValue (QVars typ))

Ord (QVar (GetKnot typ)) => At (QVars typ)

Defined in AST.Term.Scheme

Methods

at :: Index (QVars typ) -> Lens' (QVars typ) (Maybe (IxValue (QVars typ)))

(Pretty (TypeConstraintsOf typ), Pretty (QVar typ)) => Pretty (Tree QVars typ)

Defined in AST.Term.Scheme

Methods

pPrintPrec :: PrettyLevel -> Rational -> Tree QVars typ -> Doc

pPrint :: Tree QVars typ -> Doc

pPrintList :: PrettyLevel -> [Tree QVars typ] -> Doc

type Rep (QVars typ)

Defined in AST.Term.Scheme

type Rep (QVars typ) = D1 (MetaData "QVars" "AST.Term.Scheme" "syntax-tree-0.1.0.1-5Y9WhklreXaDnL6Q9tTtln" True) (C1 (MetaCons "QVars" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Map (QVar (GetKnot typ)) (TypeConstraintsOf (GetKnot typ))))))

type Index (QVars typ)

Defined in AST.Term.Scheme

type Index (QVars typ) = QVar (GetKnot typ)

type IxValue (QVars typ)

Defined in AST.Term.Scheme

type IxValue (QVars typ) = TypeConstraintsOf (GetKnot typ)

_QVars :: forall typ typ. Iso (QVars typ) (QVars typ) (Map (QVar (GetKnot typ)) (TypeConstraintsOf (GetKnot typ))) (Map (QVar (GetKnot typ)) (TypeConstraintsOf (GetKnot typ)))

class (Unify m t, HasChild varTypes t, Ord (QVar t)) => HasScheme varTypes m t where

Minimal complete definition

Nothing

Methods

hasSchemeRecursive :: Proxy varTypes -> Proxy m -> Proxy t -> Dict (KNodesConstraint t (HasScheme varTypes m))

hasSchemeRecursive :: KNodesConstraint t (HasScheme varTypes m) => Proxy varTypes -> Proxy m -> Proxy t -> Dict (KNodesConstraint t (HasScheme varTypes m))

Instances

Recursive (HasScheme varTypes m)

Defined in AST.Term.Scheme

Methods

recurse :: (KNodes k, HasScheme varTypes m k) => Proxy (HasScheme varTypes m k) -> Dict (KNodesConstraint k (HasScheme varTypes m))

loadScheme :: forall m varTypes typ. (Monad m, KTraversable varTypes, KNodesConstraint varTypes (Unify m), HasScheme varTypes m typ) => Tree Pure (Scheme varTypes typ) -> m (Tree (GTerm (UVarOf m)) typ)

Load scheme into unification monad so that different instantiations share the scheme's monomorphic parts - their unification is O(1) as it is the same shared unification term.

saveScheme :: (KNodesConstraint varTypes OrdQVar, KPointed varTypes, HasScheme varTypes m typ) => Tree (GTerm (UVarOf m)) typ -> m (Tree Pure (Scheme varTypes typ))

class Unify m t => MonadInstantiate m t where

Methods

localInstantiations :: Tree (QVarInstances (UVarOf m)) t -> m a -> m a

lookupQVar :: QVar t -> m (Tree (UVarOf m) t)

inferType :: (InferOf t ~ ANode t, KTraversable t, KNodesConstraint t HasInferredValue, Unify m t, MonadInstantiate m t) => Tree t (InferChild m k) -> m (Tree t k, Tree (InferOf t) (UVarOf m))

newtype QVarInstances k typ

Constructors

QVarInstances (Map (QVar (GetKnot typ)) (k typ))

Instances

Constraints (QVarInstances k typ) Eq => Eq (QVarInstances k typ)

Defined in AST.Term.Scheme

Methods

(==) :: QVarInstances k typ -> QVarInstances k typ -> Bool

(/=) :: QVarInstances k typ -> QVarInstances k typ -> Bool

Constraints (QVarInstances k typ) Ord => Ord (QVarInstances k typ)

Defined in AST.Term.Scheme

Methods

compare :: QVarInstances k typ -> QVarInstances k typ -> Ordering

(<) :: QVarInstances k typ -> QVarInstances k typ -> Bool

(<=) :: QVarInstances k typ -> QVarInstances k typ -> Bool

(>) :: QVarInstances k typ -> QVarInstances k typ -> Bool

(>=) :: QVarInstances k typ -> QVarInstances k typ -> Bool

max :: QVarInstances k typ -> QVarInstances k typ -> QVarInstances k typ

min :: QVarInstances k typ -> QVarInstances k typ -> QVarInstances k typ

Constraints (QVarInstances k typ) Show => Show (QVarInstances k typ)

Defined in AST.Term.Scheme

Methods

showsPrec :: Int -> QVarInstances k typ -> ShowS

show :: QVarInstances k typ -> String

showList :: [QVarInstances k typ] -> ShowS

Generic (QVarInstances k typ)

Defined in AST.Term.Scheme

Associated Types

type Rep (QVarInstances k typ) :: Type -> Type

Methods

from :: QVarInstances k typ -> Rep (QVarInstances k typ) x

to :: Rep (QVarInstances k typ) x -> QVarInstances k typ

Constraints (QVarInstances k typ) Binary => Binary (QVarInstances k typ)

Defined in AST.Term.Scheme

Methods

put :: QVarInstances k typ -> Put

get :: Get (QVarInstances k typ)

putList :: [QVarInstances k typ] -> Put

Constraints (QVarInstances k typ) NFData => NFData (QVarInstances k typ)

Defined in AST.Term.Scheme

Methods

rnf :: QVarInstances k typ -> ()

type Rep (QVarInstances k typ)

Defined in AST.Term.Scheme

type Rep (QVarInstances k typ) = D1 (MetaData "QVarInstances" "AST.Term.Scheme" "syntax-tree-0.1.0.1-5Y9WhklreXaDnL6Q9tTtln" True) (C1 (MetaCons "QVarInstances" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Map (QVar (GetKnot typ)) (k typ)))))

_QVarInstances :: forall k typ k typ. Iso (QVarInstances k typ) (QVarInstances k typ) (Map (QVar (GetKnot typ)) (k typ)) (Map (QVar (GetKnot typ)) (k typ))

makeQVarInstances :: Unify m typ => Tree QVars typ -> m (Tree (QVarInstances (UVarOf m)) typ)