derive-gadt-0.1.1: Instance deriving for (a subset of) GADTs. Source code Contents Index

Language.Haskell.Derive.Gadt.Unify

Description

A clusterfrolick at the moment. Among other things, the Exists con in the Type type isn't handled correctly (or at all really, it's just pretended that it's Forall because I don't know how to handle it).

Synopsis

unify :: Type -> Type -> Q (Either String (Substs, Substs)) type Substs = Map Name [Type] type SubstMap = Map Name [Name] type UnifyMap = Map Name [Type] data UnifyEnv = UnifyEnv { substMaps :: (SubstMap, SubstMap) isubstMaps :: (SubstMap, SubstMap) noDupsMap :: Either String (Map Name (Name, Name)) finalMap :: Either String (Map Name Name) unifyMap :: (UnifyMap, UnifyMap) stragglers :: [(Type, Type)] } varT :: String -> Type tupT :: [Type] -> Type listT :: Type -> Type invertSubstMap :: SubstMap -> SubstMap invertSubsts :: SubstMap -> SubstMap -> Map Name ([Name], [Name]) checkForDups :: Map Name ([Name], [Name]) -> Either String (Map Name (Name, Name)) extractSubsts :: UnifyEnv -> Either String (Substs, Substs) (|.|) :: (Ord a, Ord b) => Map b c -> Map a b -> Map a c renameT :: Type -> Type noDupsMapToFinalSubsts :: Map Name (Name, Name) -> Either String (Map Name Name) buildUMap :: [(Type, Type)] -> ((UnifyMap, UnifyMap), [(Type, Type)]) splitSubsts :: [(Type, Type)] -> Q UnifyEnv matchTypes :: Type -> Type -> [(Type, Type)] typeViaT :: ViaT Type Type Type typeToT :: Type -> T Type typeFromT :: T Type -> Type firstNameMap :: Map Name [Name] -> [(Name, Type)] isInf :: Name -> Type -> Bool bothVars :: (Type, Type) -> Bool varOnLeft :: (Type, Type) -> Bool varOnRight :: (Type, Type) -> Bool data Name = NameG String | NameL String | NameU String !Int data Type = ArrowT | VarT Name | ConT Name | AppT Type Type | ForallT [Name] Type | ExistsT [Name] Type ftvs :: Type -> Set Name btvs :: Type -> Set Name closeT :: Type -> Type openT :: Type -> Type (.->.) :: Type -> Type -> Type unwindFunT :: Type -> (Type, [Type]) unwindAppT :: Type -> (Type, [Type]) substT :: [(Name, Type)] -> Type -> Type listName :: Name tupName :: Int -> Name listCon :: Type tupCon :: Int -> Type testType0 :: Type idType :: Type -> Type testType1 :: Type testType2 :: Type pprName :: Name -> Doc pprType :: Type -> Doc pprParenType :: Type -> Doc newtype Q a = Q (IO a) runQ :: Q a -> IO a runIO :: IO a -> Q a unQ :: Q a -> a newName :: String -> Q Name mkName :: String -> Name mkNameG :: String -> Name mkNameL :: String -> Name mkNameU :: String -> Int -> Name newUniq :: Q Int gensymQ :: IORef Int tick :: IORef Int -> Q Int reset :: IORef Int -> Q () resetQ :: Q () newtype S s a = S { unS :: forall o. (a -> s -> o) -> s -> o } get :: S s s gets :: (s -> a) -> S s a set :: s -> S s () modify :: (s -> s) -> S s () runS :: S s a -> s -> (a, s) evalS :: S s a -> s -> a execS :: S s a -> s -> s type SubstM a = S SubstEnv a data SubstEnv = SubstEnv { boundSet :: Set Name substMap :: Map Name Type } initSubstEnv :: [(Name, Type)] -> SubstEnv runSubstM :: SubstM a -> SubstEnv -> a bindM :: Name -> SubstM () substM :: Name -> SubstM Type localM :: SubstM a -> SubstM a data T a = Tip a | T (T a) (T a) toListT :: T a -> [a] fromListT :: [a] -> [T a] toTreeT :: (Maybe a -> b) -> T a -> Tree b foldrT :: (a -> b -> b) -> b -> T a -> b foldlT :: (a -> b -> a) -> a -> T b -> a foldl'T :: (a -> b -> a) -> a -> T b -> a sumT :: Num a => T a -> a prodT :: Num a => T a -> a andT :: T Bool -> Bool orT :: T Bool -> Bool unifyT :: (Either a (T a) -> c) -> (Either b (T b) -> d) -> (c -> d -> e) -> T a -> T b -> T e zipT :: (T a -> T b -> c) -> T a -> T b -> T c matchT :: (a -> T x) -> (b -> T y) -> (T x -> c) -> (T y -> d) -> (c -> d -> e) -> a -> b -> T e data ViaT a b c = ViaT { toT :: a -> T b fromT :: T b -> c } match :: ViaT a x c -> ViaT b y d -> (c -> d -> e) -> a -> b -> [e]

Documentation

unify :: Type -> Type -> Q (Either String (Substs, Substs)) Source

.

type Substs = Map Name [Type] Source

type SubstMap = Map Name [Name] Source

type UnifyMap = Map Name [Type] Source

data UnifyEnv Source

Constructors UnifyEnv substMaps :: (SubstMap, SubstMap) isubstMaps :: (SubstMap, SubstMap) noDupsMap :: Either String (Map Name (Name, Name)) finalMap :: Either String (Map Name Name) unifyMap :: (UnifyMap, UnifyMap) stragglers :: [(Type, Type)] Instances Eq UnifyEnv Show UnifyEnv

varT :: String -> Type Source

tupT :: [Type] -> Type Source

listT :: Type -> Type Source

invertSubstMap :: SubstMap -> SubstMap Source

invertSubsts :: SubstMap -> SubstMap -> Map Name ([Name], [Name]) Source

checkForDups :: Map Name ([Name], [Name]) -> Either String (Map Name (Name, Name)) Source

extractSubsts :: UnifyEnv -> Either String (Substs, Substs) Source

(|.|) :: (Ord a, Ord b) => Map b c -> Map a b -> Map a c Source

renameT :: Type -> Type Source

noDupsMapToFinalSubsts :: Map Name (Name, Name) -> Either String (Map Name Name) Source

buildUMap :: [(Type, Type)] -> ((UnifyMap, UnifyMap), [(Type, Type)]) Source

splitSubsts :: [(Type, Type)] -> Q UnifyEnv Source

matchTypes :: Type -> Type -> [(Type, Type)] Source

typeViaT :: ViaT Type Type Type Source

typeToT :: Type -> T Type Source

typeFromT :: T Type -> Type Source

firstNameMap :: Map Name [Name] -> [(Name, Type)] Source

isInf :: Name -> Type -> Bool Source

bothVars :: (Type, Type) -> Bool Source

varOnLeft :: (Type, Type) -> Bool Source

varOnRight :: (Type, Type) -> Bool Source

data Name Source

Constructors NameG String NameL String NameU String !Int Instances Eq Name Ord Name Read Name Show Name

data Type Source

Constructors ArrowT VarT Name ConT Name AppT Type Type ForallT [Name] Type ExistsT [Name] Type Instances Eq Type Ord Type Read Type Show Type

ftvs :: Type -> Set Name Source

btvs :: Type -> Set Name Source

closeT :: Type -> Type Source

openT :: Type -> Type Source

(.->.) :: Type -> Type -> Type Source

unwindFunT :: Type -> (Type, [Type]) Source

unwindAppT :: Type -> (Type, [Type]) Source

substT :: [(Name, Type)] -> Type -> Type Source

listName :: Name Source

tupName :: Int -> Name Source

listCon :: Type Source

tupCon :: Int -> Type Source

testType0 :: Type Source

idType :: Type -> Type Source

testType1 :: Type Source

testType2 :: Type Source

pprName :: Name -> Doc Source

pprType :: Type -> Doc Source

pprParenType :: Type -> Doc Source

newtype Q a Source

Constructors Q (IO a) Instances Monad Q Functor Q Applicative Q

runQ :: Q a -> IO a Source

runIO :: IO a -> Q a Source

unQ :: Q a -> a Source

newName :: String -> Q Name Source

mkName :: String -> Name Source

mkNameG :: String -> Name Source

mkNameL :: String -> Name Source

mkNameU :: String -> Int -> Name Source

newUniq :: Q Int Source

gensymQ :: IORef Int Source

tick :: IORef Int -> Q Int Source

reset :: IORef Int -> Q () Source

resetQ :: Q () Source

newtype S s a Source

Constructors S unS :: forall o. (a -> s -> o) -> s -> o Instances Monad (S s) Functor (S s) MonadFix (S s) Applicative (S s)

get :: S s s Source

gets :: (s -> a) -> S s a Source

set :: s -> S s () Source

modify :: (s -> s) -> S s () Source

runS :: S s a -> s -> (a, s) Source

evalS :: S s a -> s -> a Source

execS :: S s a -> s -> s Source

type SubstM a = S SubstEnv a Source

data SubstEnv Source

Constructors SubstEnv boundSet :: Set Name substMap :: Map Name Type Instances Eq SubstEnv Ord SubstEnv Read SubstEnv Show SubstEnv

initSubstEnv :: [(Name, Type)] -> SubstEnv Source

runSubstM :: SubstM a -> SubstEnv -> a Source

bindM :: Name -> SubstM () Source

substM :: Name -> SubstM Type Source

localM :: SubstM a -> SubstM a Source

data T a Source

Constructors Tip a T (T a) (T a) Instances Functor T Eq a => Eq (T a) Ord a => Ord (T a) Read a => Read (T a) Show a => Show (T a)

toListT :: T a -> [a] Source

fromListT :: [a] -> [T a] Source

toTreeT :: (Maybe a -> b) -> T a -> Tree b Source

foldrT :: (a -> b -> b) -> b -> T a -> b Source

foldlT :: (a -> b -> a) -> a -> T b -> a Source

foldl'T :: (a -> b -> a) -> a -> T b -> a Source

sumT :: Num a => T a -> a Source

prodT :: Num a => T a -> a Source

andT :: T Bool -> Bool Source

orT :: T Bool -> Bool Source

unifyT :: (Either a (T a) -> c) -> (Either b (T b) -> d) -> (c -> d -> e) -> T a -> T b -> T e Source

zipT :: (T a -> T b -> c) -> T a -> T b -> T c Source

matchT :: (a -> T x) -> (b -> T y) -> (T x -> c) -> (T y -> d) -> (c -> d -> e) -> a -> b -> T e Source

data ViaT a b c Source

Constructors ViaT toT :: a -> T b fromT :: T b -> c

match :: ViaT a x c -> ViaT b y d -> (c -> d -> e) -> a -> b -> [e] Source

Produced by Haddock version 2.4.2