library colibrilib.zarith — module QThe rationals Q: fractions in lowest terms
module Q72use int.Int73use number.Gcd74use real.RealInfix75use real.FromInt76use real.Abs77use mach.int.Int6378Valid (377ms) (colibri2)79type t = private { num: int; den: int }80invariant { 0 < den /\ gcd num den = 1 }8182function real (q:t) : real = from_int q.num /. from_int q.den8384meta coercion function real85
Equal values have the same fraction in lowest terms (proved in colibrilib/q_model.mlw)
axiom equal_is_eq: forall a b:t. real a = real b -> a = b8990val make (n d:int) : t91requires { d <> 0 }92ensures { real result = from_int n /. from_int d }93
{ num = n; den = d }, without normalization
val make_exact (n d:int) : t96requires { 0 < d /\ gcd n d = 1 }97ensures { result.num = n /\ result.den = d }9899val function of_bigint (n:int) : t100ensures { result.num = n /\ result.den = 1 }101102val of_int (n:int63) : t103ensures { result.num = n /\ result.den = 1 }104105val equal (a b:t) : bool106ensures { result <-> real a = real b }107108val leq (a b:t) : bool109ensures { result <-> real a <=. real b }110111val lt (a b:t) : bool112ensures { result <-> real a <. real b }113114val function sign (a:t) : int63115ensures { result = if real a >. 0. then 1 else if real a <. 0. then -1 else 0 }116
The sign of a - b (Q.compare)
val compare (a b:t) : int63119ensures { result > 0 <-> real a >. real b }120ensures { result < 0 <-> real a <. real b }121122val function add (a b:t) : t123ensures { real result = real a +. real b }124125val function sub (a b:t) : t126ensures { real result = real a -. real b }127128val function mul (a b:t) : t129ensures { real result = real a *. real b }130131val function div (a b:t) : t132requires { real b <> 0. }133ensures { real result = real a /. real b }134135val neg (a:t) : t136ensures { real result = -. real a }137138val abs (a:t) : t139ensures { real result = abs (real a) }140end141