Hoogle Search

Within LTS Haskell 24.62 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. isList :: HasKind a => a -> Bool

   sbv	Data.SBV

   No documentation available.

2. sList :: SymVal a => String -> Symbolic (SList a)

   sbv	Data.SBV

   Declare a named SList NB. For a version which generalizes over the underlying monad, see sList

3. sList_ :: SymVal a => Symbolic (SList a)

   sbv	Data.SBV

   Declare an unnamed SList NB. For a version which generalizes over the underlying monad, see sList_

4. sLists :: SymVal a => [String] -> Symbolic [SList a]

   sbv	Data.SBV

   Declare a list of SLists NB. For a version which generalizes over the underlying monad, see sLists

5. CList :: [CVal] -> CVal

   sbv	Data.SBV.Dynamic

   List

6. KList :: Kind -> Kind

   sbv	Data.SBV.Dynamic

   No documentation available.

7. isList :: HasKind a => a -> Bool

   sbv	Data.SBV.Dynamic

   No documentation available.

8. CList :: [CVal] -> CVal

   sbv	Data.SBV.Internals

   List

9. KList :: Kind -> Kind

   sbv	Data.SBV.Internals

   No documentation available.

10. type SList a = SBV [a]

    sbv	Data.SBV.Internals

    A symbolic list of items. Note that a symbolic list is not a list of symbolic items, that is, it is not the case that SList a = [a], unlike what one might expect following haskell lists/sequences. An SList is a symbolic value of its own, of possibly arbitrary but finite length, and internally processed as one unit as opposed to a fixed-length list of items. Note that lists can be nested, i.e., we do allow lists of lists of ... items.

Page 172 of many | Previous | Next