Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

Exact lookup

1. PB_Le :: [Int] -> Int -> PBOp

   sbv	Data.SBV.Internals

   At most k, with coefficients given. Generalizes PB_AtMost

2. Pareto :: Maybe Int -> OptimizeStyle

   sbv	Data.SBV.Internals

   Objectives are optimized according to pareto front: That is, no objective can be made better without making some other worse.

3. data Penalty

   sbv	Data.SBV.Internals

   Penalty for a soft-assertion. The default penalty is 1, with all soft-assertions belonging to the same objective goal. A positive weight and an optional group can be provided by using the Penalty constructor.

4. Penalty :: Rational -> Maybe String -> Penalty

   sbv	Data.SBV.Internals

   Penalty with a weight and an optional group

5. Plus :: Op

   sbv	Data.SBV.Internals

   No documentation available.

6. PlusOv :: Bool -> OvOp

   sbv	Data.SBV.Internals

   Addition overflow. Bool is True if signed.

7. Power :: Int -> RegExp -> RegExp

   sbv	Data.SBV.Internals

   Exactly n repetitions, i.e., nth power

8. class PrettyNum a

   sbv	Data.SBV.Internals

   PrettyNum class captures printing of numbers in hex and binary formats; also supporting negative numbers.

9. PrintTiming :: Timing

   sbv	Data.SBV.Internals

   No documentation available.

10. ProofError :: SMTConfig -> [String] -> Maybe SMTResult -> SMTResult

    sbv	Data.SBV.Internals

    Prover errored out, with possibly a bogus result

Page 993 of many | Previous | Next