Copyright	(c) 2014 Aleksey Kliger
License	BSD3 (See LICENSE)
Maintainer	Aleksey Kliger
Stability	experimental
Safe Haskell	None
Language	Haskell2010
Extensions	DeriveGeneric

Unbound.Generics.LocallyNameless.Rec

Description

The pattern Rec p binds the names in p like p itself would, but additionally, the names in p are scope over p.

The term TRec p is shorthand for Bind (Rec p) ()

Synopsis

data Rec p
rec :: Alpha p => p -> Rec p
unrec :: Alpha p => Rec p -> p
newtype TRec p = TRec (Bind (Rec p) ())

Documentation

data Rec p Source #

If p is a pattern type, then Rec p is also a pattern type, which is recursive in the sense that p may bind names in terms embedded within itself. Useful for encoding e.g. lectrec and Agda's dot notation.

Instances

Subst c p => Subst c (Rec p) Source #
Instance details Defined in Unbound.Generics.LocallyNameless.Subst Methods isvar :: Rec p -> Maybe (SubstName (Rec p) c) Source # isCoerceVar :: Rec p -> Maybe (SubstCoerce (Rec p) c) Source # subst :: Name c -> c -> Rec p -> Rec p Source # substs :: [(Name c, c)] -> Rec p -> Rec p Source #
Eq p => Eq (Rec p) Source #
Instance details Defined in Unbound.Generics.LocallyNameless.Rec Methods (==) :: Rec p -> Rec p -> Bool # (/=) :: Rec p -> Rec p -> Bool #
Show a => Show (Rec a) Source #
Instance details Defined in Unbound.Generics.LocallyNameless.Rec Methods showsPrec :: Int -> Rec a -> ShowS # show :: Rec a -> String # showList :: [Rec a] -> ShowS #
Generic (Rec p) Source #
Instance details Defined in Unbound.Generics.LocallyNameless.Rec Associated Types type Rep (Rec p) :: * -> * # Methods from :: Rec p -> Rep (Rec p) x # to :: Rep (Rec p) x -> Rec p #
NFData p => NFData (Rec p) Source #
Instance details Defined in Unbound.Generics.LocallyNameless.Rec Methods rnf :: Rec p -> () #
Alpha p => Alpha (Rec p) Source #
Instance details Defined in Unbound.Generics.LocallyNameless.Rec Methods aeq' :: AlphaCtx -> Rec p -> Rec p -> Bool Source # fvAny' :: (Contravariant f, Applicative f) => AlphaCtx -> (AnyName -> f AnyName) -> Rec p -> f (Rec p) Source # close :: AlphaCtx -> NamePatFind -> Rec p -> Rec p Source # open :: AlphaCtx -> NthPatFind -> Rec p -> Rec p Source # isPat :: Rec p -> DisjointSet AnyName Source # isTerm :: Rec p -> All Source # isEmbed :: Rec p -> Bool Source # nthPatFind :: Rec p -> NthPatFind Source # namePatFind :: Rec p -> NamePatFind Source # swaps' :: AlphaCtx -> Perm AnyName -> Rec p -> Rec p Source # lfreshen' :: LFresh m => AlphaCtx -> Rec p -> (Rec p -> Perm AnyName -> m b) -> m b Source # freshen' :: Fresh m => AlphaCtx -> Rec p -> m (Rec p, Perm AnyName) Source # acompare' :: AlphaCtx -> Rec p -> Rec p -> Ordering Source #
type Rep (Rec p) Source #
Instance details Defined in Unbound.Generics.LocallyNameless.Rec type Rep (Rec p) = D1 (MetaData "Rec" "Unbound.Generics.LocallyNameless.Rec" "unbound-generics-0.4.0-3CzcjD8SUhgLQazt2sGCP5" True) (C1 (MetaCons "Rec" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 p)))

rec :: Alpha p => p -> Rec p Source #

Constructor for recursive patterns.

unrec :: Alpha p => Rec p -> p Source #

Destructor for recursive patterns.

newtype TRec p Source #

TRec is a standalone variant of Rec: the only difference is that whereas Rec p is a pattern type, TRec p is a term type. It is isomorphic to Bind (Rec p) ().

Note that TRec corresponds to Pottier's abstraction construct from alpha-Caml. In this context, Embed t corresponds to alpha-Caml's inner t, and Shift (Embed t) corresponds to alpha-Caml's outer t.

Constructors

TRec (Bind (Rec p) ())

Instances

(Alpha p, Subst c p) => Subst c (TRec p) Source #
Instance details Defined in Unbound.Generics.LocallyNameless.Subst Methods isvar :: TRec p -> Maybe (SubstName (TRec p) c) Source # isCoerceVar :: TRec p -> Maybe (SubstCoerce (TRec p) c) Source # subst :: Name c -> c -> TRec p -> TRec p Source # substs :: [(Name c, c)] -> TRec p -> TRec p Source #
Show a => Show (TRec a) Source #
Instance details Defined in Unbound.Generics.LocallyNameless.Rec Methods showsPrec :: Int -> TRec a -> ShowS # show :: TRec a -> String # showList :: [TRec a] -> ShowS #
Generic (TRec p) Source #
Instance details Defined in Unbound.Generics.LocallyNameless.Rec Associated Types type Rep (TRec p) :: * -> * # Methods from :: TRec p -> Rep (TRec p) x # to :: Rep (TRec p) x -> TRec p #
Alpha p => Alpha (TRec p) Source #
Instance details Defined in Unbound.Generics.LocallyNameless.Rec Methods aeq' :: AlphaCtx -> TRec p -> TRec p -> Bool Source # fvAny' :: (Contravariant f, Applicative f) => AlphaCtx -> (AnyName -> f AnyName) -> TRec p -> f (TRec p) Source # close :: AlphaCtx -> NamePatFind -> TRec p -> TRec p Source # open :: AlphaCtx -> NthPatFind -> TRec p -> TRec p Source # isPat :: TRec p -> DisjointSet AnyName Source # isTerm :: TRec p -> All Source # isEmbed :: TRec p -> Bool Source # nthPatFind :: TRec p -> NthPatFind Source # namePatFind :: TRec p -> NamePatFind Source # swaps' :: AlphaCtx -> Perm AnyName -> TRec p -> TRec p Source # lfreshen' :: LFresh m => AlphaCtx -> TRec p -> (TRec p -> Perm AnyName -> m b) -> m b Source # freshen' :: Fresh m => AlphaCtx -> TRec p -> m (TRec p, Perm AnyName) Source # acompare' :: AlphaCtx -> TRec p -> TRec p -> Ordering Source #
type Rep (TRec p) Source #
Instance details Defined in Unbound.Generics.LocallyNameless.Rec type Rep (TRec p) = D1 (MetaData "TRec" "Unbound.Generics.LocallyNameless.Rec" "unbound-generics-0.4.0-3CzcjD8SUhgLQazt2sGCP5" True) (C1 (MetaCons "TRec" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Bind (Rec p) ()))))