Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- data NsT
- type Name = Text
- newtype NameTy = NameTy Text
- type NameConst = NameTy
- type NameFam = NameTy
- class NameOf a where
- class NameTyOf (c :: kc) where
- nameTyOf :: proxy c -> Mod NameTy
- isNameTyOp :: proxy c -> Bool
- data Mod a = Mod PathMod a
- type PathMod = [NameMod]
- newtype NameMod = NameMod Name
- newtype Imports name = Imports (Map PathMod (MapFixity (Map name PathMod)))
- lookupImports :: Ord name => Fixy p i q a -> Mod name -> Imports name -> Maybe PathMod
- revlookupImports :: Ord name => Fixy p i q a -> Mod name -> Imports name -> Maybe PathMod
- class ImportTypes ts where
- importTypes :: PathMod -> Imports NameTy
- data Fixy p i q a where
- FixyPrefix :: Fixy p i q p
- FixyInfix :: Fixy p i q i
- FixyPostfix :: Fixy p i q q
- fixyOfFixity :: Fixity -> Fixy a a a a
- class FixityOf (c :: kc) where
- newtype FixyA = FixyA (forall (a :: *). Fixy a a a a)
- data WithFixity a = WithFixity a Fixity
- withInfix :: a -> Infix -> WithFixity a
- withInfixR :: a -> Precedence -> WithFixity a
- withInfixL :: a -> Precedence -> WithFixity a
- withInfixN :: a -> Precedence -> WithFixity a
- withInfixB :: a -> (Side, Precedence) -> WithFixity a
- withPrefix :: a -> Precedence -> WithFixity a
- withPostfix :: a -> Precedence -> WithFixity a
- data ByFixity p i q = ByFixity {}
- getByFixity :: Fixy p i q a -> MapFixity b -> b
- selectByFixity :: Fixy p i q a -> ByFixity p i q -> a
- type MapFixity a = ByFixity a a a
- mapMapFixity :: (a -> b) -> MapFixity a -> MapFixity b
Type NsT
Type Name
Type NameTy
Name
of a Type
.
Type NameConst
Type NameFam
Class NameOf
Class NameTyOf
class NameTyOf (c :: kc) where Source #
Return the NameTy
of something.
Nothing
nameTyOf :: proxy c -> Mod NameTy Source #
nameTyOf :: Typeable c => proxy c -> Mod NameTy Source #
isNameTyOp :: proxy c -> Bool Source #
isNameTyOp :: Typeable c => proxy c -> Bool Source #
Type Mod
PathMod
of something.
Type PathMod
Type NameMod
Name
of Module
.
Type Imports
Class ImportTypes
class ImportTypes ts where Source #
Instances
ImportTypes ([] :: [k]) Source # | |
Defined in Language.Symantic.Typing.Module | |
(NameTyOf t, FixityOf t, ImportTypes ts) => ImportTypes (Proxy t ': ts :: [Type]) Source # | |
Defined in Language.Symantic.Typing.Module |
Type Fixy
data Fixy p i q a where Source #
FixyPrefix :: Fixy p i q p | |
FixyInfix :: Fixy p i q i | |
FixyPostfix :: Fixy p i q q |
fixyOfFixity :: Fixity -> Fixy a a a a Source #
Class FixityOf
class FixityOf (c :: kc) where Source #
Return the Fixity
of something.
Nothing
Type FixyA
Like Fixy
, but when all choices have the same type.
Type WithFixity
data WithFixity a Source #
Instances
Functor WithFixity Source # | |
Defined in Language.Symantic.Typing.Module fmap :: (a -> b) -> WithFixity a -> WithFixity b # (<$) :: a -> WithFixity b -> WithFixity a # | |
Eq a => Eq (WithFixity a) Source # | |
Defined in Language.Symantic.Typing.Module (==) :: WithFixity a -> WithFixity a -> Bool # (/=) :: WithFixity a -> WithFixity a -> Bool # | |
Show a => Show (WithFixity a) Source # | |
Defined in Language.Symantic.Typing.Module showsPrec :: Int -> WithFixity a -> ShowS # show :: WithFixity a -> String # showList :: [WithFixity a] -> ShowS # | |
IsString a => IsString (WithFixity a) Source # | |
Defined in Language.Symantic.Typing.Module fromString :: String -> WithFixity a # |
withInfix :: a -> Infix -> WithFixity a Source #
withInfixR :: a -> Precedence -> WithFixity a Source #
withInfixL :: a -> Precedence -> WithFixity a Source #
withInfixN :: a -> Precedence -> WithFixity a Source #
withInfixB :: a -> (Side, Precedence) -> WithFixity a Source #
withPrefix :: a -> Precedence -> WithFixity a Source #
withPostfix :: a -> Precedence -> WithFixity a Source #
Type ByFixity
Fixity namespace.
getByFixity :: Fixy p i q a -> MapFixity b -> b Source #
selectByFixity :: Fixy p i q a -> ByFixity p i q -> a Source #
Type MapFixity
mapMapFixity :: (a -> b) -> MapFixity a -> MapFixity b Source #