cryptol-2.11.0: Cryptol: The Language of Cryptography
Copyright(c) 2013-2016 Galois Inc.
LicenseBSD3
Maintainercryptol@galois.com
Stabilityprovisional
Portabilityportable
Safe HaskellSafe
LanguageHaskell2010

Cryptol.TypeCheck.TypeMap

Description

 

Documentation

data TypeMap a Source #

Constructors

TM 

Instances

Instances details
Functor TypeMap Source # 
Instance details

Defined in Cryptol.TypeCheck.TypeMap

Methods

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

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

Foldable TypeMap Source # 
Instance details

Defined in Cryptol.TypeCheck.TypeMap

Methods

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

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

foldMap' :: Monoid m => (a -> m) -> TypeMap a -> m #

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

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

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

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

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

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

toList :: TypeMap a -> [a] #

null :: TypeMap a -> Bool #

length :: TypeMap a -> Int #

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

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

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

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

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

Traversable TypeMap Source # 
Instance details

Defined in Cryptol.TypeCheck.TypeMap

Methods

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

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

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

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

TrieMap TypeMap Type Source # 
Instance details

Defined in Cryptol.TypeCheck.TypeMap

Methods

emptyTM :: TypeMap a Source #

nullTM :: TypeMap a -> Bool Source #

lookupTM :: Type -> TypeMap a -> Maybe a Source #

alterTM :: Type -> (Maybe a -> Maybe a) -> TypeMap a -> TypeMap a Source #

unionTM :: (a -> a -> a) -> TypeMap a -> TypeMap a -> TypeMap a Source #

toListTM :: TypeMap a -> [(Type, a)] Source #

mapMaybeWithKeyTM :: (Type -> a -> Maybe b) -> TypeMap a -> TypeMap b Source #

Show a => Show (TypeMap a) Source # 
Instance details

Defined in Cryptol.TypeCheck.TypeMap

Methods

showsPrec :: Int -> TypeMap a -> ShowS #

show :: TypeMap a -> String #

showList :: [TypeMap a] -> ShowS #

TVars a => TVars (TypeMap a) Source # 
Instance details

Defined in Cryptol.TypeCheck.Subst

Methods

apSubst :: Subst -> TypeMap a -> TypeMap a Source #

class TrieMap m k | m -> k where Source #

Methods

emptyTM :: m a Source #

nullTM :: m a -> Bool Source #

lookupTM :: k -> m a -> Maybe a Source #

alterTM :: k -> (Maybe a -> Maybe a) -> m a -> m a Source #

unionTM :: (a -> a -> a) -> m a -> m a -> m a Source #

toListTM :: m a -> [(k, a)] Source #

mapMaybeWithKeyTM :: (k -> a -> Maybe b) -> m a -> m b Source #

Instances

Instances details
TrieMap TypeMap Type Source # 
Instance details

Defined in Cryptol.TypeCheck.TypeMap

Methods

emptyTM :: TypeMap a Source #

nullTM :: TypeMap a -> Bool Source #

lookupTM :: Type -> TypeMap a -> Maybe a Source #

alterTM :: Type -> (Maybe a -> Maybe a) -> TypeMap a -> TypeMap a Source #

unionTM :: (a -> a -> a) -> TypeMap a -> TypeMap a -> TypeMap a Source #

toListTM :: TypeMap a -> [(Type, a)] Source #

mapMaybeWithKeyTM :: (Type -> a -> Maybe b) -> TypeMap a -> TypeMap b Source #

Ord a => TrieMap (Map a) a Source # 
Instance details

Defined in Cryptol.TypeCheck.TypeMap

Methods

emptyTM :: Map a a0 Source #

nullTM :: Map a a0 -> Bool Source #

lookupTM :: a -> Map a a0 -> Maybe a0 Source #

alterTM :: a -> (Maybe a0 -> Maybe a0) -> Map a a0 -> Map a a0 Source #

unionTM :: (a0 -> a0 -> a0) -> Map a a0 -> Map a a0 -> Map a a0 Source #

toListTM :: Map a a0 -> [(a, a0)] Source #

mapMaybeWithKeyTM :: (a -> a0 -> Maybe b) -> Map a a0 -> Map a b Source #

TrieMap m a => TrieMap (List m) [a] Source # 
Instance details

Defined in Cryptol.TypeCheck.TypeMap

Methods

emptyTM :: List m a0 Source #

nullTM :: List m a0 -> Bool Source #

lookupTM :: [a] -> List m a0 -> Maybe a0 Source #

alterTM :: [a] -> (Maybe a0 -> Maybe a0) -> List m a0 -> List m a0 Source #

unionTM :: (a0 -> a0 -> a0) -> List m a0 -> List m a0 -> List m a0 Source #

toListTM :: List m a0 -> [([a], a0)] Source #

mapMaybeWithKeyTM :: ([a] -> a0 -> Maybe b) -> List m a0 -> List m b Source #

insertTM :: TrieMap m k => k -> a -> m a -> m a Source #

insertWithTM :: TrieMap m k => (a -> a -> a) -> k -> a -> m a -> m a Source #

membersTM :: TrieMap m k => m a -> [a] Source #

mapTM :: TrieMap m k => (a -> b) -> m a -> m b Source #

mapWithKeyTM :: TrieMap m k => (k -> a -> b) -> m a -> m b Source #

mapMaybeTM :: TrieMap m k => (a -> Maybe b) -> m a -> m b Source #

data List m a Source #

Constructors

L 

Fields

Instances

Instances details
Functor m => Functor (List m) Source # 
Instance details

Defined in Cryptol.TypeCheck.TypeMap

Methods

fmap :: (a -> b) -> List m a -> List m b #

(<$) :: a -> List m b -> List m a #

Foldable m => Foldable (List m) Source # 
Instance details

Defined in Cryptol.TypeCheck.TypeMap

Methods

fold :: Monoid m0 => List m m0 -> m0 #

foldMap :: Monoid m0 => (a -> m0) -> List m a -> m0 #

foldMap' :: Monoid m0 => (a -> m0) -> List m a -> m0 #

foldr :: (a -> b -> b) -> b -> List m a -> b #

foldr' :: (a -> b -> b) -> b -> List m a -> b #

foldl :: (b -> a -> b) -> b -> List m a -> b #

foldl' :: (b -> a -> b) -> b -> List m a -> b #

foldr1 :: (a -> a -> a) -> List m a -> a #

foldl1 :: (a -> a -> a) -> List m a -> a #

toList :: List m a -> [a] #

null :: List m a -> Bool #

length :: List m a -> Int #

elem :: Eq a => a -> List m a -> Bool #

maximum :: Ord a => List m a -> a #

minimum :: Ord a => List m a -> a #

sum :: Num a => List m a -> a #

product :: Num a => List m a -> a #

Traversable m => Traversable (List m) Source # 
Instance details

Defined in Cryptol.TypeCheck.TypeMap

Methods

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

sequenceA :: Applicative f => List m (f a) -> f (List m a) #

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

sequence :: Monad m0 => List m (m0 a) -> m0 (List m a) #

TrieMap m a => TrieMap (List m) [a] Source # 
Instance details

Defined in Cryptol.TypeCheck.TypeMap

Methods

emptyTM :: List m a0 Source #

nullTM :: List m a0 -> Bool Source #

lookupTM :: [a] -> List m a0 -> Maybe a0 Source #

alterTM :: [a] -> (Maybe a0 -> Maybe a0) -> List m a0 -> List m a0 Source #

unionTM :: (a0 -> a0 -> a0) -> List m a0 -> List m a0 -> List m a0 Source #

toListTM :: List m a0 -> [([a], a0)] Source #

mapMaybeWithKeyTM :: ([a] -> a0 -> Maybe b) -> List m a0 -> List m b Source #

(Traversable m, TVars a) => TVars (List m a) Source # 
Instance details

Defined in Cryptol.TypeCheck.Subst

Methods

apSubst :: Subst -> List m a -> List m a Source #