Agda-2.5.2: A dependently typed functional programming language and proof assistant

Safe Haskell | None
Language | Haskell2010

Agda.TypeChecking.MetaVars.Mention

# Documentation

class MentionsMeta t where #

Minimal complete definition

mentionsMeta

Methods

mentionsMeta :: MetaId -> t -> Bool #

Instances

MentionsMeta LevelAtom # |
Methods mentionsMeta :: MetaId -> LevelAtom -> Bool #
MentionsMeta PlusLevel # |
Methods mentionsMeta :: MetaId -> PlusLevel -> Bool #
MentionsMeta Level # |
Methods mentionsMeta :: MetaId -> Level -> Bool #
MentionsMeta Sort # |
Methods mentionsMeta :: MetaId -> Sort -> Bool #
MentionsMeta Type # |
Methods mentionsMeta :: MetaId -> Type -> Bool #
MentionsMeta Elim # |
Methods mentionsMeta :: MetaId -> Elim -> Bool #
MentionsMeta Term # |
Methods mentionsMeta :: MetaId -> Term -> Bool #
MentionsMeta Constraint # |
Methods mentionsMeta :: MetaId -> Constraint -> Bool #
MentionsMeta ProblemConstraint # |
Methods mentionsMeta :: MetaId -> ProblemConstraint -> Bool #
MentionsMeta t => MentionsMeta [t] # |
Methods mentionsMeta :: MetaId -> [t] -> Bool #
MentionsMeta t => MentionsMeta (Maybe t) # |
Methods mentionsMeta :: MetaId -> Maybe t -> Bool #
MentionsMeta t => MentionsMeta (Dom t) # |
Methods mentionsMeta :: MetaId -> Dom t -> Bool #
MentionsMeta t => MentionsMeta (Arg t) # |
Methods mentionsMeta :: MetaId -> Arg t -> Bool #
MentionsMeta a => MentionsMeta (Tele a) # |
Methods mentionsMeta :: MetaId -> Tele a -> Bool #
MentionsMeta t => MentionsMeta (Abs t) # |
Methods mentionsMeta :: MetaId -> Abs t -> Bool #
MentionsMeta a => MentionsMeta (Closure a) # |
Methods mentionsMeta :: MetaId -> Closure a -> Bool #
(MentionsMeta a, MentionsMeta b) => MentionsMeta (a, b) # |
Methods mentionsMeta :: MetaId -> (a, b) -> Bool #
(MentionsMeta a, MentionsMeta b, MentionsMeta c) => MentionsMeta (a, b, c) # |
Methods mentionsMeta :: MetaId -> (a, b, c) -> Bool #