Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

1. type ConstraintSet = Symbolic ()

   sbv	Data.SBV

   A constraint set is a symbolic program that returns no values. The idea is that the constraints/min-max goals will serve as the collection of constraints that will be used for sat/optimize calls.

2. KSet :: Kind -> Kind

   sbv	Data.SBV

   No documentation available.

3. data RCSet a

   sbv	Data.SBV

   A RCSet is either a regular set or a set given by its complement from the corresponding universal set.

4. RegularSet :: Set a -> RCSet a

   sbv	Data.SBV

   No documentation available.

5. type SSet a = SBV RCSet a

   sbv	Data.SBV

   Symbolic Set. Note that we use RCSet, which supports both regular sets and complements, i.e., those obtained from the universal set (of the right type) by removing elements. Similar to SArray the contents are stored with object equality, which makes a difference if the underlying type contains IEEE Floats.

6. isSet :: HasKind a => a -> Bool

   sbv	Data.SBV

   No documentation available.

7. sSet :: (Ord a, SymVal a) => String -> Symbolic (SSet a)

   sbv	Data.SBV

   Declare a named SSet. NB. For a version which generalizes over the underlying monad, see sSet

8. sSetBitTo :: SFiniteBits a => SBV a -> SBV a -> SBool -> SBV a

   sbv	Data.SBV

   Variant of setBitTo when the index is symbolic. If the index it out-of-bounds, then the result is underspecified.

9. sSet_ :: (Ord a, SymVal a) => Symbolic (SSet a)

   sbv	Data.SBV

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

10. sSets :: (Ord a, SymVal a) => [String] -> Symbolic [SSet a]

    sbv	Data.SBV

    Declare a list of SSet values. NB. For a version which generalizes over the underlying monad, see sSets

Page 160 of many | Previous | Next