Copyright	Copyright (c) 2007--2024 wren gayle romano
License	BSD
Maintainer	[email protected]
Stability	highly experimental
Portability	semi-portable (MPTCs,...)
Safe Haskell	Safe-Inferred
Language	Haskell98

Control.Unification.Ranked.IntVar

Description

A ranked variant of Control.Unification.IntVar.

Synopsis

newtype IntVar = IntVar Int
data IntRBindingState t
data IntRBindingT t m a
runIntRBindingT :: IntRBindingT t m a -> m (a, IntRBindingState t)
evalIntRBindingT :: Monad m => IntRBindingT t m a -> m a
execIntRBindingT :: Monad m => IntRBindingT t m a -> m (IntRBindingState t)

Documentation

newtype IntVar Source #

A "mutable" unification variable implemented by an integer. This provides an entirely pure alternative to truly mutable alternatives (like STVar), which can make backtracking easier.

N.B., because this implementation is pure, we can use it for both ranked and unranked monads.

Constructors

IntVar Int

Instances

Instances details

Show IntVar Source #
Instance details Defined in Control.Unification.IntVar Methods showsPrec :: Int -> IntVar -> ShowS # show :: IntVar -> String # showList :: [IntVar] -> ShowS #
Eq IntVar Source #
Instance details Defined in Control.Unification.IntVar Methods (==) :: IntVar -> IntVar -> Bool # (/=) :: IntVar -> IntVar -> Bool #
Variable IntVar Source #
Instance details Defined in Control.Unification.IntVar Methods getVarID :: IntVar -> Int Source #
(Unifiable t, Applicative m, Monad m) => BindingMonad t IntVar (IntBindingT t m) Source #
Instance details Defined in Control.Unification.IntVar Methods lookupVar :: IntVar -> IntBindingT t m (Maybe (UTerm t IntVar)) Source # freeVar :: IntBindingT t m IntVar Source # newVar :: UTerm t IntVar -> IntBindingT t m IntVar Source # bindVar :: IntVar -> UTerm t IntVar -> IntBindingT t m () Source #
(Unifiable t, Applicative m, Monad m) => BindingMonad t IntVar (IntRBindingT t m) Source #
Instance details Defined in Control.Unification.Ranked.IntVar Methods lookupVar :: IntVar -> IntRBindingT t m (Maybe (UTerm t IntVar)) Source # freeVar :: IntRBindingT t m IntVar Source # newVar :: UTerm t IntVar -> IntRBindingT t m IntVar Source # bindVar :: IntVar -> UTerm t IntVar -> IntRBindingT t m () Source #
(Unifiable t, Applicative m, Monad m) => RankedBindingMonad t IntVar (IntRBindingT t m) Source #
Instance details Defined in Control.Unification.Ranked.IntVar Methods lookupRankVar :: IntVar -> IntRBindingT t m (Rank t IntVar) Source # incrementRank :: IntVar -> IntRBindingT t m () Source # incrementBindVar :: IntVar -> UTerm t IntVar -> IntRBindingT t m () Source #

data IntRBindingState t Source #

Ranked binding state for IntVar.

Instances

Instances details

Show (t (UTerm t IntVar)) => Show (IntRBindingState t) Source #
Instance details Defined in Control.Unification.Ranked.IntVar Methods showsPrec :: Int -> IntRBindingState t -> ShowS # show :: IntRBindingState t -> String # showList :: [IntRBindingState t] -> ShowS #
Monad m => MonadState (IntRBindingState t) (IntRBindingT t m) Source #
Instance details Defined in Control.Unification.Ranked.IntVar Methods get :: IntRBindingT t m (IntRBindingState t) # put :: IntRBindingState t -> IntRBindingT t m () # state :: (IntRBindingState t -> (a, IntRBindingState t)) -> IntRBindingT t m a #

data IntRBindingT t m a Source #

A monad for storing IntVar bindings, implemented as a StateT. For a plain state monad, set m = Identity; for a backtracking state monad, set m = Logic.

Instances

Instances details

(Unifiable t, Applicative m, Monad m) => BindingMonad t IntVar (IntRBindingT t m) Source #
Instance details Defined in Control.Unification.Ranked.IntVar Methods lookupVar :: IntVar -> IntRBindingT t m (Maybe (UTerm t IntVar)) Source # freeVar :: IntRBindingT t m IntVar Source # newVar :: UTerm t IntVar -> IntRBindingT t m IntVar Source # bindVar :: IntVar -> UTerm t IntVar -> IntRBindingT t m () Source #
(Unifiable t, Applicative m, Monad m) => RankedBindingMonad t IntVar (IntRBindingT t m) Source #
Instance details Defined in Control.Unification.Ranked.IntVar Methods lookupRankVar :: IntVar -> IntRBindingT t m (Rank t IntVar) Source # incrementRank :: IntVar -> IntRBindingT t m () Source # incrementBindVar :: IntVar -> UTerm t IntVar -> IntRBindingT t m () Source #
MonadTrans (IntRBindingT t) Source #
Instance details Defined in Control.Unification.Ranked.IntVar Methods lift :: Monad m => m a -> IntRBindingT t m a #
Monad m => MonadState (IntRBindingState t) (IntRBindingT t m) Source #
Instance details Defined in Control.Unification.Ranked.IntVar Methods get :: IntRBindingT t m (IntRBindingState t) # put :: IntRBindingState t -> IntRBindingT t m () # state :: (IntRBindingState t -> (a, IntRBindingState t)) -> IntRBindingT t m a #
(Functor m, MonadPlus m) => Alternative (IntRBindingT t m) Source #
Instance details Defined in Control.Unification.Ranked.IntVar Methods empty :: IntRBindingT t m a # (<\|>) :: IntRBindingT t m a -> IntRBindingT t m a -> IntRBindingT t m a # some :: IntRBindingT t m a -> IntRBindingT t m [a] # many :: IntRBindingT t m a -> IntRBindingT t m [a] #
(Functor m, Monad m) => Applicative (IntRBindingT t m) Source #
Instance details Defined in Control.Unification.Ranked.IntVar Methods pure :: a -> IntRBindingT t m a # (<>) :: IntRBindingT t m (a -> b) -> IntRBindingT t m a -> IntRBindingT t m b # liftA2 :: (a -> b -> c) -> IntRBindingT t m a -> IntRBindingT t m b -> IntRBindingT t m c # (>) :: IntRBindingT t m a -> IntRBindingT t m b -> IntRBindingT t m b # (<*) :: IntRBindingT t m a -> IntRBindingT t m b -> IntRBindingT t m a #
Functor m => Functor (IntRBindingT t m) Source #
Instance details Defined in Control.Unification.Ranked.IntVar Methods fmap :: (a -> b) -> IntRBindingT t m a -> IntRBindingT t m b # (<$) :: a -> IntRBindingT t m b -> IntRBindingT t m a #
Monad m => Monad (IntRBindingT t m) Source #
Instance details Defined in Control.Unification.Ranked.IntVar Methods (>>=) :: IntRBindingT t m a -> (a -> IntRBindingT t m b) -> IntRBindingT t m b # (>>) :: IntRBindingT t m a -> IntRBindingT t m b -> IntRBindingT t m b # return :: a -> IntRBindingT t m a #
MonadPlus m => MonadPlus (IntRBindingT t m) Source #
Instance details Defined in Control.Unification.Ranked.IntVar Methods mzero :: IntRBindingT t m a # mplus :: IntRBindingT t m a -> IntRBindingT t m a -> IntRBindingT t m a #
(MonadLogic m, MonadPlus m) => MonadLogic (IntRBindingT t m) Source #
Instance details Defined in Control.Unification.Ranked.IntVar Methods msplit :: IntRBindingT t m a -> IntRBindingT t m (Maybe (a, IntRBindingT t m a)) # interleave :: IntRBindingT t m a -> IntRBindingT t m a -> IntRBindingT t m a # (>>-) :: IntRBindingT t m a -> (a -> IntRBindingT t m b) -> IntRBindingT t m b # once :: IntRBindingT t m a -> IntRBindingT t m a # lnot :: IntRBindingT t m a -> IntRBindingT t m () # ifte :: IntRBindingT t m a -> (a -> IntRBindingT t m b) -> IntRBindingT t m b -> IntRBindingT t m b #

runIntRBindingT :: IntRBindingT t m a -> m (a, IntRBindingState t) Source #

Run the binding computation with the empty initial binding state, and return both the final value and the final state.

evalIntRBindingT :: Monad m => IntRBindingT t m a -> m a Source #

Run the binding computation with the empty initial binding state, and return both the final value but discard the final state.

NOTE: you should explicitly apply bindings before calling this function, or else the bindings will be lost

execIntRBindingT :: Monad m => IntRBindingT t m a -> m (IntRBindingState t) Source #

Run the binding computation with the empty initial binding state, and return both the final state but discard the final value.