sbv-13.1: SMT Based Verification: Symbolic Haskell theorem prover using SMT solving.
Copyright(c) Levent Erkok
LicenseBSD3
Maintainererkokl@gmail.com
Stabilityexperimental
Safe HaskellNone
LanguageHaskell2010

Data.SBV.Rational

Description

Symbolic rationals, corresponds to Haskell's Rational type

Synopsis

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.

Instance details

OrdSymbolic SRational Source #

Symbolic ordering for SRational. Note that denominators are always positive.

Instance details