| Copyright | (c) Levent Erkok |
|---|---|
| License | BSD3 |
| Maintainer | erkokl@gmail.com |
| Stability | experimental |
| Safe Haskell | None |
| Language | Haskell2010 |
Data.SBV.Rational
Description
Symbolic rationals, corresponds to Haskell's Rational type
Constructing rationals
(.%) :: SInteger -> SInteger -> SRational infixl 7 Source #
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. While we can define a recursive function to do so, it would almost always imply non-decidability for even the simplest queries.)
Orphan instances
| Num SRational Source # | Num instance for SRational. Note that denominators are always positive. |
| OrdSymbolic SRational Source # | Symbolic ordering for SRational. Note that denominators are always positive. |
Methods (.<) :: SRational -> SRational -> SBool Source # (.<=) :: SRational -> SRational -> SBool Source # (.>) :: SRational -> SRational -> SBool Source # (.>=) :: SRational -> SRational -> SBool Source # smin :: SRational -> SRational -> SRational Source # smax :: SRational -> SRational -> SRational Source # inRange :: SRational -> (SRational, SRational) -> SBool Source # | |