Language.SMTLib2.Internals.Type.List

Documentation

type family Head (lst :: [a]) :: a where ...

Equations

Head (x ': xs) = x

type family Tail (lst :: [a]) :: [a] where ...

Equations

Tail (x ': xs) = xs

type family Index (lst :: [a]) (idx :: Nat) :: a where ...

Equations

Index (x ': xs) Z = x

Index (x ': xs) (S n) = Index xs n

type family Insert (lst :: [a]) (idx :: Nat) (el :: a) :: [a] where ...

Equations

Insert (x ': xs) Z y = y ': xs

Insert (x ': xs) (S n) y = x ': Insert xs n y

type family Remove (lst :: [a]) (idx :: Nat) :: [a] where ...

Equations

Remove (x ': xs) Z = xs

Remove (x ': xs) (S n) = x ': Remove xs n

type family Append (lst :: [a]) (el :: a) :: [a] where ...

Equations

Append '[] y = y ': '[]

Append (x ': xs) y = x ': Append xs y

type family Length (lst :: [a]) :: Nat where ...

Equations

Length '[] = Z

Length (x ': xs) = S (Length xs)

type family Drop (lst :: [a]) (i :: Nat) :: [a] where ...

Equations

Drop lst Z = lst

Drop (x ': xs) (S n) = Drop xs n

type family Take (lst :: [a]) (i :: Nat) :: [a] where ...

Equations

Take xs Z = '[]

Take (x ': xs) (S n) = x ': Take xs n

type family StripPrefix (lst :: [a]) (pre :: [a]) :: [a] where ...

Equations

StripPrefix xs '[] = xs

StripPrefix (x ': xs) (x ': ys) = StripPrefix xs ys

type family Last (lst :: [a]) :: a where ...

Equations

Last '[x] = x

Last (x ': (y ': rest)) = Last (y ': rest)

type family DropLast (lst :: [a]) :: [a] where ...

Equations

DropLast '[x] = '[]

DropLast (x ': (y ': rest)) = x ': DropLast (y ': rest)

type family Reverse (lst :: [a]) :: [a] where ...

Equations

Reverse '[] = '[]

Reverse (x ': xs) = Append (Reverse xs) x

type family Map (lst :: [a]) (f :: a -> b) :: [b] where ...

Equations

Map '[] f = '[]

Map (x ': xs) f = f x ': Map xs f

type family Concat (xs :: [a]) (ys :: [a]) :: [a] where ...

Equations

Concat '[] ys = ys

Concat (x ': xs) ys = x ': Concat xs ys

type family Replicate (n :: Nat) (x :: a) :: [a] where ...

Equations

Replicate Z x = '[]

Replicate (S n) x = x ': Replicate n x

data List e tp where

Strongly typed heterogenous lists.

A List e '[tp1,tp2,tp3] contains 3 elements of types e tp1, e tp2 and e tp3 respectively.

As an example, the following list contains two types:

>>> int ::: bool ::: Nil :: List Repr '[IntType,BoolType]
[IntRepr,BoolRepr]

Constructors

Nil :: List e '[]

(:::) :: e x -> List e xs -> List e (x ': xs) infixr 9

Instances

HasMonad (m (List Type e tp))

Associated Types

type MatchMonad (m (List Type e tp)) (m :: * -> *) :: Constraint

type MonadResult (m (List Type e tp)) :: *

Methods

embedM :: (Applicative m, MatchMonad (m (List Type e tp)) m) => m (List Type e tp) -> m (MonadResult (m (List Type e tp)))

GCompare a e => GCompare [a] (List a e)

Methods

gcompare :: f a -> f b -> GOrdering (List a e) a b

GEq a e => GEq [a] (List a e)

Methods

geq :: f a -> f b -> Maybe ((List a e := a) b)

GShow a e => GShow [a] (List a e)

Methods

gshowsPrec :: Int -> t a -> ShowS

GEq a e => Eq (List a e lst)

Methods

(==) :: List a e lst -> List a e lst -> Bool

(/=) :: List a e lst -> List a e lst -> Bool

GCompare a e => Ord (List a e lst)

Methods

compare :: List a e lst -> List a e lst -> Ordering

(<) :: List a e lst -> List a e lst -> Bool

(<=) :: List a e lst -> List a e lst -> Bool

(>) :: List a e lst -> List a e lst -> Bool

(>=) :: List a e lst -> List a e lst -> Bool

max :: List a e lst -> List a e lst -> List a e lst

min :: List a e lst -> List a e lst -> List a e lst

GShow a e => Show (List a e lst)

Methods

showsPrec :: Int -> List a e lst -> ShowS

show :: List a e lst -> String

showList :: [List a e lst] -> ShowS

HasMonad (List Type e tp)

Associated Types

type MatchMonad (List Type e tp) (m :: * -> *) :: Constraint

type MonadResult (List Type e tp) :: *

Methods

embedM :: (Applicative m, MatchMonad (List Type e tp) m) => List Type e tp -> m (MonadResult (List Type e tp))

type MonadResult (m (List Type e tp))

type MonadResult (m (List Type e tp)) = List Type e tp

type MatchMonad (m (List Type e tp)) m'

type MatchMonad (m (List Type e tp)) m' = (~) (* -> *) m m'

type MonadResult (List Type e tp)

type MonadResult (List Type e tp) = List Type e tp

type MatchMonad (List Type e tp) m

type MatchMonad (List Type e tp) m = ()

list :: [ExpQ] -> ExpQ

nil :: List e '[]

list1 :: e t1 -> List e '[t1]

list2 :: e t1 -> e t2 -> List e '[t1, t2]

list3 :: e t1 -> e t2 -> e t3 -> List e '[t1, t2, t3]

reifyList :: (forall r'. a -> (forall tp. e tp -> r') -> r') -> [a] -> (forall tp. List e tp -> r) -> r

Get a static representation of a dynamic list.

For example, to convert a list of strings into a list of types:

>>> reifyList (\name f -> case name of { "int" -> f int ; "bool" -> f bool }) ["bool","int"] show
"[BoolRepr,IntRepr]"

access :: Monad m => List e lst -> Natural idx -> (e (Index lst idx) -> m (a, e tp)) -> m (a, List e (Insert lst idx tp))

access' :: Monad m => List e lst -> Natural idx -> (e (Index lst idx) -> m (a, e (Index lst idx))) -> m (a, List e lst)

head :: List e lst -> e (Head lst)

tail :: List e lst -> List e (Tail lst)

index :: List e lst -> Natural idx -> e (Index lst idx)

indexDyn :: Integral i => List e tps -> i -> (forall tp. e tp -> a) -> a

insert :: List e lst -> Natural idx -> e tp -> List e (Insert lst idx tp)

remove :: List e lst -> Natural idx -> List e (Remove lst idx)

mapM :: Monad m => (forall x. e x -> m (e' x)) -> List e lst -> m (List e' lst)

mapIndexM :: Monad m => (forall n. Natural n -> e (Index lst n) -> m (e' (Index lst n))) -> List e lst -> m (List e' lst)

traverse :: Applicative f => (forall x. e x -> f (e' x)) -> List e lst -> f (List e' lst)

cons :: e x -> List e xs -> List e (x ': xs)

append :: List e xs -> e x -> List e (Append xs x)

length :: List e lst -> Natural (Length lst)

drop :: List e lst -> Natural i -> List e (Drop lst i)

take :: List e lst -> Natural i -> List e (Take lst i)

last :: List e lst -> e (Last lst)

dropLast :: List e lst -> List e (DropLast lst)

stripPrefix :: GEq e => List e lst -> List e pre -> Maybe (List e (StripPrefix lst pre))

reverse :: List e lst -> List e (Reverse lst)

map :: List e lst -> (forall x. e x -> e (f x)) -> List e (Map lst f)

unmap :: List p lst -> List e (Map lst f) -> (forall x. e (f x) -> e x) -> List e lst

unmapM :: Monad m => List p lst -> List e (Map lst f) -> (forall x. e (f x) -> m (e x)) -> m (List e lst)

mapM' :: Monad m => List e lst -> (forall x. e x -> m (e (f x))) -> m (List e (Map lst f))

concat :: List e xs -> List e ys -> List e (Concat xs ys)

replicate :: Natural n -> e x -> List e (Replicate n x)

toList :: Monad m => (forall x. e x -> m a) -> List e lst -> m [a]

toListIndex :: Monad m => (forall n. Natural n -> e (Index lst n) -> m a) -> List e lst -> m [a]

foldM :: Monad m => (forall x. s -> e x -> m s) -> s -> List e lst -> m s

zipWithM :: Monad m => (forall x. e1 x -> e2 x -> m (e3 x)) -> List e1 lst -> List e2 lst -> m (List e3 lst)

zipToListM :: Monad m => (forall x. e1 x -> e2 x -> m a) -> List e1 lst -> List e2 lst -> m [a]

mapAccumM :: Monad m => (forall x. s -> e x -> m (s, e' x)) -> s -> List e xs -> m (s, List e' xs)