Language.Symantic.Typing.Module

Type NsT

data NsT

Constructors

NsTerm

NsType

Type Name

type Name = Text

Type NameTy

newtype NameTy

Name of a Type.

Constructors

NameTy Text

Instances

Eq NameTy

Methods

(==) :: NameTy -> NameTy -> Bool

(/=) :: NameTy -> NameTy -> Bool

Ord NameTy

Methods

compare :: NameTy -> NameTy -> Ordering

(<) :: NameTy -> NameTy -> Bool

(<=) :: NameTy -> NameTy -> Bool

(>) :: NameTy -> NameTy -> Bool

(>=) :: NameTy -> NameTy -> Bool

max :: NameTy -> NameTy -> NameTy

min :: NameTy -> NameTy -> NameTy

Show NameTy

Methods

showsPrec :: Int -> NameTy -> ShowS

show :: NameTy -> String

showList :: [NameTy] -> ShowS

IsString NameTy

Methods

fromString :: String -> NameTy

Type NameConst

type NameConst = NameTy

Name of a Const.

Type NameFam

type NameFam = NameTy

Name of a Fam.

Class NameOf

class NameOf a where

Minimal complete definition

nameOf

Methods

nameOf :: a -> Name

Instances

NameOf NameTe

Methods

nameOf :: NameTe -> Name

Class NameTyOf

class NameTyOf c where

Return the NameTy of something.

Methods

nameTyOf :: proxy c -> Mod NameTy

nameTyOf :: Typeable c => proxy c -> Mod NameTy

isNameTyOp :: proxy c -> Bool

isNameTyOp :: Typeable c => proxy c -> Bool

Instances

NameTyOf (Constraint -> Type -> *) (#>)

Methods

nameTyOf :: proxy c -> Mod NameTy

isNameTyOp :: proxy c -> Bool

NameTyOf (Constraint -> Constraint -> Constraint) (#)

Methods

nameTyOf :: proxy c -> Mod NameTy

isNameTyOp :: proxy c -> Bool

NameTyOf (k -> k -> Constraint) ((#~) k)

Methods

nameTyOf :: proxy c -> Mod NameTy

isNameTyOp :: proxy c -> Bool

Type Mod

data Mod a

PathMod of something.

Constructors

Mod PathMod a

Instances

Functor Mod

Methods

fmap :: (a -> b) -> Mod a -> Mod b

(<$) :: a -> Mod b -> Mod a

Eq a => Eq (Mod a)

Methods

(==) :: Mod a -> Mod a -> Bool

(/=) :: Mod a -> Mod a -> Bool

Ord a => Ord (Mod a)

Methods

compare :: Mod a -> Mod a -> Ordering

(<) :: Mod a -> Mod a -> Bool

(<=) :: Mod a -> Mod a -> Bool

(>) :: Mod a -> Mod a -> Bool

(>=) :: Mod a -> Mod a -> Bool

max :: Mod a -> Mod a -> Mod a

min :: Mod a -> Mod a -> Mod a

Show a => Show (Mod a)

Methods

showsPrec :: Int -> Mod a -> ShowS

show :: Mod a -> String

showList :: [Mod a] -> ShowS

Type PathMod

type PathMod = [NameMod]

Path to a Module.

Type NameMod

newtype NameMod

Name of Module.

Constructors

NameMod Name

Instances

Eq NameMod

Methods

(==) :: NameMod -> NameMod -> Bool

(/=) :: NameMod -> NameMod -> Bool

Ord NameMod

Methods

compare :: NameMod -> NameMod -> Ordering

(<) :: NameMod -> NameMod -> Bool

(<=) :: NameMod -> NameMod -> Bool

(>) :: NameMod -> NameMod -> Bool

(>=) :: NameMod -> NameMod -> Bool

max :: NameMod -> NameMod -> NameMod

min :: NameMod -> NameMod -> NameMod

Show NameMod

Methods

showsPrec :: Int -> NameMod -> ShowS

show :: NameMod -> String

showList :: [NameMod] -> ShowS

IsString NameMod

Methods

fromString :: String -> NameMod

Type Imports

newtype Imports name

Map PathMods of Names.

Constructors

Imports (Map PathMod (MapFixity (Map name PathMod)))

Instances

Eq name => Eq (Imports name)

Methods

(==) :: Imports name -> Imports name -> Bool

(/=) :: Imports name -> Imports name -> Bool

Show name => Show (Imports name)

Methods

showsPrec :: Int -> Imports name -> ShowS

show :: Imports name -> String

showList :: [Imports name] -> ShowS

Ord name => Semigroup (Imports name)

Methods

(<>) :: Imports name -> Imports name -> Imports name

sconcat :: NonEmpty (Imports name) -> Imports name

stimes :: Integral b => b -> Imports name -> Imports name

Ord name => Monoid (Imports name)

Methods

mempty :: Imports name

mappend :: Imports name -> Imports name -> Imports name

mconcat :: [Imports name] -> Imports name

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

class ImportTypes ts where

Minimal complete definition

importTypes

Methods

importTypes :: PathMod -> Imports NameTy

Instances

ImportTypes [k] ([] k)

Methods

importTypes :: PathMod -> Imports NameTy

(NameTyOf k t, FixityOf k t, ImportTypes [*] ts) => ImportTypes [*] ((:) * (Proxy k t) ts)

Methods

importTypes :: PathMod -> Imports NameTy

Type Fixy

data Fixy p i q a where

Constructors

FixyPrefix :: Fixy p i q p

FixyInfix :: Fixy p i q i

FixyPostfix :: Fixy p i q q

Instances

Eq (Fixy k p i q a)

Methods

(==) :: Fixy k p i q a -> Fixy k p i q a -> Bool

(/=) :: Fixy k p i q a -> Fixy k p i q a -> Bool

Show (Fixy k p i q a)

Methods

showsPrec :: Int -> Fixy k p i q a -> ShowS

show :: Fixy k p i q a -> String

showList :: [Fixy k p i q a] -> ShowS

fixyOfFixity :: Fixity -> Fixy a a a a

Class FixityOf

class FixityOf c where

Return the Fixity of something.

Methods

fixityOf :: proxy c -> Maybe Fixity

Instances

FixityOf Type c

Methods

fixityOf :: proxy c -> Maybe Fixity

FixityOf Constraint c

Methods

fixityOf :: proxy c -> Maybe Fixity

FixityOf (Constraint -> Type -> *) (#>)

Methods

fixityOf :: proxy c -> Maybe Fixity

FixityOf (Constraint -> Constraint -> Constraint) (#)

Methods

fixityOf :: proxy c -> Maybe Fixity

FixityOf (k -> k -> Constraint) ((#~) k)

Methods

fixityOf :: proxy c -> Maybe Fixity

Type FixyA

newtype FixyA

Like Fixy, but when all choices have the same type.

Constructors

FixyA (forall a. Fixy a a a a)

Instances

Eq FixyA

Methods

(==) :: FixyA -> FixyA -> Bool

(/=) :: FixyA -> FixyA -> Bool

Show FixyA

Methods

showsPrec :: Int -> FixyA -> ShowS

show :: FixyA -> String

showList :: [FixyA] -> ShowS

Type WithFixity

data WithFixity a

Constructors

WithFixity a Fixity

Instances

Functor WithFixity

Methods

fmap :: (a -> b) -> WithFixity a -> WithFixity b

(<$) :: a -> WithFixity b -> WithFixity a

Eq a => Eq (WithFixity a)

Methods

(==) :: WithFixity a -> WithFixity a -> Bool

(/=) :: WithFixity a -> WithFixity a -> Bool

Show a => Show (WithFixity a)

Methods

showsPrec :: Int -> WithFixity a -> ShowS

show :: WithFixity a -> String

showList :: [WithFixity a] -> ShowS

IsString a => IsString (WithFixity a)

Methods

fromString :: String -> WithFixity a

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

Type ByFixity

data ByFixity p i q

Fixity namespace.

Constructors

ByFixity

Fields

• byPrefix :: p
• byInfix :: i
• byPostfix :: q

Instances

(Eq q, Eq i, Eq p) => Eq (ByFixity p i q)

Methods

(==) :: ByFixity p i q -> ByFixity p i q -> Bool

(/=) :: ByFixity p i q -> ByFixity p i q -> Bool

(Show q, Show i, Show p) => Show (ByFixity p i q)

Methods

showsPrec :: Int -> ByFixity p i q -> ShowS

show :: ByFixity p i q -> String

showList :: [ByFixity p i q] -> ShowS

(Semigroup p, Semigroup i, Semigroup q) => Semigroup (ByFixity p i q)

Methods

(<>) :: ByFixity p i q -> ByFixity p i q -> ByFixity p i q

sconcat :: NonEmpty (ByFixity p i q) -> ByFixity p i q

stimes :: Integral b => b -> ByFixity p i q -> ByFixity p i q

(Monoid p, Monoid i, Monoid q) => Monoid (ByFixity p i q)

Methods

mempty :: ByFixity p i q

mappend :: ByFixity p i q -> ByFixity p i q -> ByFixity p i q

mconcat :: [ByFixity p i q] -> ByFixity p i q

getByFixity :: Fixy p i q a -> MapFixity b -> b

selectByFixity :: Fixy p i q a -> ByFixity p i q -> a

Type MapFixity

type MapFixity a = ByFixity a a a

Like ByFixity, but with the same type parameter.

mapMapFixity :: (a -> b) -> MapFixity a -> MapFixity b