Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
(
.~& ) :: SBool -> SBool -> SBoolsbv Data.SBV.Internals Symbolic nand
(
.~| ) :: SBool -> SBool -> SBoolsbv Data.SBV.Internals Symbolic nor
(
.: ) :: SymVal a => SBV a -> SList a -> SList asbv Data.SBV.List Prepend an element, the traditional cons.
(
.% ) :: SInteger -> SInteger -> SRationalsbv Data.SBV.Rational Construct a symbolic rational from a given numerator and denominator. Note that it is not possible to deconstruct a rational by taking numerator and denominator fields, since we do not represent them canonically. (This is due to the fact that SMTLib has no functions to compute the GCD. One can use the maximization engine to compute the GCD of numbers, but not as a function.)
(
.: ) :: SChar -> SString -> SStringsbv Data.SBV.String Prepend an element, the traditional cons.
(
.&& ) :: SBool -> SBool -> SBoolsbv Data.SBV.Trans Symbolic conjunction
(
./= ) :: EqSymbolic a => a -> a -> SBoolsbv Data.SBV.Trans Symbolic inequality.
(
./== ) :: EqSymbolic a => a -> a -> SBoolsbv Data.SBV.Trans Negation of strong equality. Equaivalent to negation of (.===) on all types.
(
.< ) :: OrdSymbolic a => a -> a -> SBoolsbv Data.SBV.Trans Symbolic less than.
(
.<+> ) :: SBool -> SBool -> SBoolsbv Data.SBV.Trans Symbolic logical xor