Unbound.Generics.LocallyNameless.Kind.Derive

Documentation

newtype AutoAlpha a

Constructors

AutoAlpha

Fields

• unAutoAlpha :: a

Instances

Eq a => Eq (AutoAlpha a)

Defined in Unbound.Generics.LocallyNameless.Kind.Derive

Methods

(==) :: AutoAlpha a -> AutoAlpha a -> Bool

(/=) :: AutoAlpha a -> AutoAlpha a -> Bool

Show a => Show (AutoAlpha a)

Defined in Unbound.Generics.LocallyNameless.Kind.Derive

Methods

showsPrec :: Int -> AutoAlpha a -> ShowS

show :: AutoAlpha a -> String

showList :: [AutoAlpha a] -> ShowS

(Typeable a, GenericAlpha a, Show a) => Alpha (AutoAlpha a)

Defined in Unbound.Generics.LocallyNameless.Kind.Derive

Methods

aeq' :: AlphaCtx -> AutoAlpha a -> AutoAlpha a -> Bool

fvAny' :: (Contravariant f, Applicative f) => AlphaCtx -> (AnyName -> f AnyName) -> AutoAlpha a -> f (AutoAlpha a)

close :: AlphaCtx -> NamePatFind -> AutoAlpha a -> AutoAlpha a

open :: AlphaCtx -> NthPatFind -> AutoAlpha a -> AutoAlpha a

isPat :: AutoAlpha a -> DisjointSet AnyName

isTerm :: AutoAlpha a -> All

isEmbed :: AutoAlpha a -> Bool

nthPatFind :: AutoAlpha a -> NthPatFind

namePatFind :: AutoAlpha a -> NamePatFind

swaps' :: AlphaCtx -> Perm AnyName -> AutoAlpha a -> AutoAlpha a

lfreshen' :: LFresh m => AlphaCtx -> AutoAlpha a -> (AutoAlpha a -> Perm AnyName -> m b) -> m b

freshen' :: Fresh m => AlphaCtx -> AutoAlpha a -> m (AutoAlpha a, Perm AnyName)

acompare' :: AlphaCtx -> AutoAlpha a -> AutoAlpha a -> Ordering

aeqDefK :: forall a. GenericAlpha a => AlphaCtx -> a -> a -> Bool

fvAnyDefK :: forall g a. (GenericAlpha a, Contravariant g, Applicative g) => AlphaCtx -> (AnyName -> g AnyName) -> a -> g a

closeDefK :: forall a. GenericAlpha a => AlphaCtx -> NamePatFind -> a -> a

openDefK :: forall a. GenericAlpha a => AlphaCtx -> NthPatFind -> a -> a

isPatDefK :: forall a. GenericAlpha a => a -> DisjointSet AnyName

isTermDefK :: forall a. GenericAlpha a => a -> All

isEmbedDefK :: a -> Bool

nthPatFindDefK :: forall a. GenericAlpha a => a -> NthPatFind

namePatFindDefK :: forall a. GenericAlpha a => a -> NamePatFind

swapsDefK :: forall a. GenericAlpha a => AlphaCtx -> Perm AnyName -> a -> a

lfreshenDefK :: forall m a b. (LFresh m, GenericAlpha a) => AlphaCtx -> a -> (a -> Perm AnyName -> m b) -> m b

freshenDefK :: forall m a. (Fresh m, GenericAlpha a) => AlphaCtx -> a -> m (a, Perm AnyName)

acompareDefK :: forall a. GenericAlpha a => AlphaCtx -> a -> a -> Ordering

buildSubstName :: forall a b. (Typeable a, Typeable b) => Name a -> Maybe (SubstName a b)

gsubstDefK :: forall a b. (GenericK a, GSubstK b (RepK a) LoT0, Subst b a) => Name b -> b -> a -> a

gsubstsDefK :: forall a b. (GenericK a, GSubstK b (RepK a) LoT0, Subst b a) => [(Name b, b)] -> a -> a