kleene-type-0

Safe HaskellNone
LanguageHaskell2010

KleenePlugin.TypeEq

Documentation

maybeEqType Source #

Arguments

:: KleNames

Names (only Key is used)

-> Map TyVar FastString

IsLabel map

-> Type 
-> Type 
-> Either UnifResult Bool 

data UnifResult Source #

Constructors

MayUnify (UTerm Mono TyVar) (UTerm Mono TyVar) 

data Mono a Source #

Constructors

MonoC Type

concrete type

MonoApp a a

application

MonoSym FastString

either IsLabel sym a => a or Key sym

Instances
Functor Mono Source # 
Instance details

Defined in KleenePlugin.TypeEq

Methods

fmap :: (a -> b) -> Mono a -> Mono b #

(<$) :: a -> Mono b -> Mono a #

Foldable Mono Source # 
Instance details

Defined in KleenePlugin.TypeEq

Methods

fold :: Monoid m => Mono m -> m #

foldMap :: Monoid m => (a -> m) -> Mono a -> m #

foldr :: (a -> b -> b) -> b -> Mono a -> b #

foldr' :: (a -> b -> b) -> b -> Mono a -> b #

foldl :: (b -> a -> b) -> b -> Mono a -> b #

foldl' :: (b -> a -> b) -> b -> Mono a -> b #

foldr1 :: (a -> a -> a) -> Mono a -> a #

foldl1 :: (a -> a -> a) -> Mono a -> a #

toList :: Mono a -> [a] #

null :: Mono a -> Bool #

length :: Mono a -> Int #

elem :: Eq a => a -> Mono a -> Bool #

maximum :: Ord a => Mono a -> a #

minimum :: Ord a => Mono a -> a #

sum :: Num a => Mono a -> a #

product :: Num a => Mono a -> a #

Traversable Mono Source # 
Instance details

Defined in KleenePlugin.TypeEq

Methods

traverse :: Applicative f => (a -> f b) -> Mono a -> f (Mono b) #

sequenceA :: Applicative f => Mono (f a) -> f (Mono a) #

mapM :: Monad m => (a -> m b) -> Mono a -> m (Mono b) #

sequence :: Monad m => Mono (m a) -> m (Mono a) #

Unifiable Mono Source # 
Instance details

Defined in KleenePlugin.TypeEq

Methods

zipMatch :: Mono a -> Mono a -> Maybe (Mono (Either a (a, a)))

type M = EitherKT (UFailure Mono IntVar) (IntBindingT Mono Identity) Source #

newtype UF Source #

Constructors

UF (UFailure Mono IntVar) 
Instances
Outputable UF Source # 
Instance details

Defined in KleenePlugin.TypeEq

Methods

ppr :: UF -> SDoc #

pprPrec :: Rational -> UF -> SDoc #

mayUnify :: UTerm Mono TyVar -> UTerm Mono TyVar -> Bool Source #

pprMono :: Rational -> Mono (UTerm Mono IntVar) -> SDoc Source #

pprMono' :: Rational -> UTerm Mono IntVar -> SDoc Source #