library colibrilib.flocq — module BinaryFlocq's IEEE754.BinarySingleNaN floats of prec = mw + 1 bits of significand and the largest exponent emax = 2^(ew-1), with 0 < mw, 0 < ew and prec < emax (the hypotheses of Flocq's IEEE754.Bits), seen through their encoding on mw + ew + 1 bits: b_add mw ew m x y is bits_of_binary_float (Bplus m (binary_float_of_bits x) (binary_float_of_bits y)) (with the conversions between Binary and BinarySingleNaN, and one fixed NaN for the encoding of a NaN result).
The views of an encoding (bnan, binf, bfin, bneg, bval) are defined here on the bits, as Flocq's split_bits. The axioms are proved in Rocq (common/rocq/flocq/Binary.v): each is the definition of the operation in Flocq on the special values, and its theorem B..._correct on the finite values.
theory Binary97use int.Int98use int.Power99use int.EuclideanDivision100use real.RealInfix101use real.FromInt102use real.Abs103use real.Square104use Round105
type mode109constant rne: mode110constant rna: mode111constant rtp: mode112constant rtn: mode113constant rtz: mode114115axiom mode_distinct:116rne <> rna /\ rne <> rtp /\ rne <> rtn /\ rne <> rtz /\ rna <> rtp /\117rna <> rtn /\ rna <> rtz /\ rtp <> rtn /\ rtp <> rtz /\ rtn <> rtz118
round radix2 (FLT_exp emin prec) (round_mode m)
function rnd (prec emin: int) (m: mode) (r: real) : real121122axiom rnd_modes: forall prec emin r.123rnd prec emin rne r = rnd_ne prec emin r /\124rnd prec emin rna r = rnd_na prec emin r /\125rnd prec emin rtp r = rnd_up prec emin r /\126rnd prec emin rtn r = rnd_dn prec emin r /\127rnd prec emin rtz r = rnd_zr prec emin r128
round_mode m r: the rounding to an integer (Flocq's round radix2 (FIX_exp 0) (round_mode m) r is its real)
function rnd_int (m: mode) (r: real) : int132133axiom rnd_int_dn: forall r.134from_int (rnd_int rtn r) <=. r <. from_int (rnd_int rtn r) +. 1.0135axiom rnd_int_up: forall r.136from_int (rnd_int rtp r) -. 1.0 <. r <=. from_int (rnd_int rtp r)137axiom rnd_int_zr: forall r.138rnd_int rtz r = if 0.0 <=. r then rnd_int rtn r else rnd_int rtp r139axiom rnd_int_ne: forall r.140abs (r -. from_int (rnd_int rne r)) <=. 0.5 /\141(abs (r -. from_int (rnd_int rne r)) = 0.5 -> exists q. rnd_int rne r = 2 * q)142axiom rnd_int_na: forall r.143abs (r -. from_int (rnd_int rna r)) <=. 0.5 /\144(abs (r -. from_int (rnd_int rna r)) = 0.5 -> abs r <. abs (from_int (rnd_int rna r)))145
succ radix2 (FLT_exp emin prec), the next float; Flocq's pred x is - succ (- x)
function succ (prec emin: int) (x: real) : real149150axiom succ_spec: forall prec emin x. 0 < prec -> generic prec emin x ->151generic prec emin (succ prec emin x) /\ x <. succ prec emin x /\152forall g. generic prec emin g -> x <. g -> succ prec emin x <=. g153
function prec (mw: int) : int = mw + 1157function emax (ew: int) : int = power 2 (ew - 1)158function emin (mw ew: int) : int = 3 - emax ew - prec mw159
The formats of Flocq's Bits
predicate valid (mw ew: int) = 0 < mw /\ 0 < ew /\ prec mw < emax ew162163predicate in_range (mw ew b: int) = 0 <= b < power 2 (mw + ew + 1)164165function bman (mw b: int) : int = mod b (power 2 mw)166function bexp (mw ew b: int) : int = mod (div b (power 2 mw)) (power 2 ew)167predicate bneg (mw ew b: int) = power 2 mw * power 2 ew <= b168169predicate bnan (mw ew b: int) = bexp mw ew b = power 2 ew - 1 /\ bman mw b <> 0170predicate binf (mw ew b: int) = bexp mw ew b = power 2 ew - 1 /\ bman mw b = 0171predicate bfin (mw ew b: int) = bexp mw ew b <> power 2 ew - 1172predicate bzero (mw ew b: int) = bexp mw ew b = 0 /\ bman mw b = 0173
The magnitude of a finite float
function bmag (mw ew b: int) : real =176if bexp mw ew b = 0 then from_int (bman mw b) *. pow2 (emin mw ew)177else from_int (bman mw b + power 2 mw) *. pow2 (bexp mw ew b + emin mw ew - 1)178
The value of a finite float (Flocq's B2R)
function bval (mw ew b: int) : real =181if bneg mw ew b then -. bmag mw ew b else bmag mw ew b182
The largest finite magnitude
function maxv (mw ew: int) : real =185from_int (power 2 (prec mw) - 1) *. pow2 (emax ew - prec mw)186
No overflow: the rounding is below 2^emax
predicate small (mw ew: int) (m: mode) (r: real) =189abs (rnd (prec mw) (emin mw ew) m r) <. pow2 (emax ew)190
The rounding of r, finite
predicate rounded (mw ew: int) (m: mode) (r: real) (z: int) =193bfin mw ew z /\ bval mw ew z = rnd (prec mw) (emin mw ew) m r194
The overflow (Flocq's binary_overflow), the sign being the one of z
predicate ovf (mw ew: int) (m: mode) (z: int) =198if m = rne \/ m = rna \/ (m = rtp /\ not bneg mw ew z) \/199(m = rtn /\ bneg mw ew z)200then binf mw ew z201else bfin mw ew z /\ bmag mw ew z = maxv mw ew202
function b_neg (mw ew: int) (x: int) : int206function b_abs (mw ew: int) (x: int) : int207function b_add (mw ew: int) (m: mode) (x y: int) : int208function b_sub (mw ew: int) (m: mode) (x y: int) : int209function b_mul (mw ew: int) (m: mode) (x y: int) : int210function b_div (mw ew: int) (m: mode) (x y: int) : int211function b_fma (mw ew: int) (m: mode) (x y z: int) : int212function b_sqrt (mw ew: int) (m: mode) (x: int) : int213function b_rti (mw ew: int) (m: mode) (x: int) : int214function b_succ (mw ew: int) (x: int) : int215function b_pred (mw ew: int) (x: int) : int216predicate b_lt (mw ew: int) (x y: int)217predicate b_le (mw ew: int) (x y: int)218predicate b_eq (mw ew: int) (x y: int)219
Bopp
axiom neg_spec: forall mw ew x. valid mw ew -> in_range mw ew x ->222let z = b_neg mw ew x in223in_range mw ew z /\224(bnan mw ew x -> bnan mw ew z) /\225(binf mw ew x -> binf mw ew z /\ (bneg mw ew z <-> not bneg mw ew x)) /\226(bfin mw ew x -> bfin mw ew z /\ bmag mw ew z = bmag mw ew x /\227(bneg mw ew z <-> not bneg mw ew x))228
Babs
axiom abs_spec: forall mw ew x. valid mw ew -> in_range mw ew x ->231let z = b_abs mw ew x in232in_range mw ew z /\233(bnan mw ew x -> bnan mw ew z) /\234(binf mw ew x -> binf mw ew z /\ not bneg mw ew z) /\235(bfin mw ew x -> bfin mw ew z /\ bmag mw ew z = bmag mw ew x /\236not bneg mw ew z)237
Bplus
axiom add_spec: forall mw ew m x y. valid mw ew ->240in_range mw ew x -> in_range mw ew y ->241let z = b_add mw ew m x y in242in_range mw ew z /\243(bnan mw ew x \/ bnan mw ew y -> bnan mw ew z) /\244(binf mw ew x /\ binf mw ew y ->245if bneg mw ew x <-> bneg mw ew y246then binf mw ew z /\ (bneg mw ew z <-> bneg mw ew x)247else bnan mw ew z) /\248(binf mw ew x /\ bfin mw ew y ->249binf mw ew z /\ (bneg mw ew z <-> bneg mw ew x)) /\250(bfin mw ew x /\ binf mw ew y ->251binf mw ew z /\ (bneg mw ew z <-> bneg mw ew y)) /\252(bfin mw ew x /\ bfin mw ew y ->253let r = bval mw ew x +. bval mw ew y in254if small mw ew m r then255rounded mw ew m r z /\256(bneg mw ew z <-> (r <. 0.0 \/ (r = 0.0 /\257(if m = rtn then bneg mw ew x \/ bneg mw ew y258else bneg mw ew x /\ bneg mw ew y))))259else ovf mw ew m z /\ (bneg mw ew z <-> bneg mw ew x) /\260(bneg mw ew x <-> bneg mw ew y))261
Bminus
axiom sub_spec: forall mw ew m x y. valid mw ew ->264in_range mw ew x -> in_range mw ew y ->265let z = b_sub mw ew m x y in266in_range mw ew z /\267(bnan mw ew x \/ bnan mw ew y -> bnan mw ew z) /\268(binf mw ew x /\ binf mw ew y ->269if bneg mw ew x <-> bneg mw ew y then bnan mw ew z270else binf mw ew z /\ (bneg mw ew z <-> bneg mw ew x)) /\271(binf mw ew x /\ bfin mw ew y ->272binf mw ew z /\ (bneg mw ew z <-> bneg mw ew x)) /\273(bfin mw ew x /\ binf mw ew y ->274binf mw ew z /\ (bneg mw ew z <-> not bneg mw ew y)) /\275(bfin mw ew x /\ bfin mw ew y ->276let r = bval mw ew x -. bval mw ew y in277if small mw ew m r then278rounded mw ew m r z /\279(bneg mw ew z <-> (r <. 0.0 \/ (r = 0.0 /\280(if m = rtn then bneg mw ew x \/ not bneg mw ew y281else bneg mw ew x /\ not bneg mw ew y))))282else ovf mw ew m z /\ (bneg mw ew z <-> bneg mw ew x) /\283(bneg mw ew x <-> not bneg mw ew y))284
Bmult
axiom mul_spec: forall mw ew m x y. valid mw ew ->287in_range mw ew x -> in_range mw ew y ->288let z = b_mul mw ew m x y in289in_range mw ew z /\290(bnan mw ew x \/ bnan mw ew y -> bnan mw ew z) /\291(binf mw ew x /\ bzero mw ew y \/ bzero mw ew x /\ binf mw ew y ->292bnan mw ew z) /\293((binf mw ew x \/ binf mw ew y) /\ not bnan mw ew x /\ not bnan mw ew y /\294not bzero mw ew x /\ not bzero mw ew y ->295binf mw ew z /\ (bneg mw ew z <-> not (bneg mw ew x <-> bneg mw ew y))) /\296(bfin mw ew x /\ bfin mw ew y ->297let r = bval mw ew x *. bval mw ew y in298(if small mw ew m r then rounded mw ew m r z else ovf mw ew m z) /\299(bneg mw ew z <-> not (bneg mw ew x <-> bneg mw ew y)))300
Bdiv
axiom div_spec: forall mw ew m x y. valid mw ew ->303in_range mw ew x -> in_range mw ew y ->304let z = b_div mw ew m x y in305in_range mw ew z /\306(bnan mw ew x \/ bnan mw ew y -> bnan mw ew z) /\307(binf mw ew x /\ binf mw ew y \/ bzero mw ew x /\ bzero mw ew y ->308bnan mw ew z) /\309(binf mw ew x /\ bfin mw ew y \/310bfin mw ew x /\ not bzero mw ew x /\ bzero mw ew y ->311binf mw ew z /\ (bneg mw ew z <-> not (bneg mw ew x <-> bneg mw ew y))) /\312(bfin mw ew x /\ binf mw ew y ->313bzero mw ew z /\ (bneg mw ew z <-> not (bneg mw ew x <-> bneg mw ew y))) /\314(bfin mw ew x /\ bfin mw ew y /\ not bzero mw ew y ->315let r = bval mw ew x /. bval mw ew y in316(if small mw ew m r then rounded mw ew m r z else ovf mw ew m z) /\317(bneg mw ew z <-> not (bneg mw ew x <-> bneg mw ew y)))318
Bfma
axiom fma_spec: forall mw ew m x y z. valid mw ew ->321in_range mw ew x -> in_range mw ew y -> in_range mw ew z ->322let w = b_fma mw ew m x y z in323in_range mw ew w /\324(bnan mw ew x \/ bnan mw ew y \/ bnan mw ew z -> bnan mw ew w) /\325(binf mw ew x /\ bzero mw ew y \/ bzero mw ew x /\ binf mw ew y ->326bnan mw ew w) /\327((binf mw ew x \/ binf mw ew y) /\ not bnan mw ew x /\ not bnan mw ew y /\328not bzero mw ew x /\ not bzero mw ew y /\ not bnan mw ew z ->329if binf mw ew z /\ not (bneg mw ew z <-> not (bneg mw ew x <-> bneg mw ew y))330then bnan mw ew w331else binf mw ew w /\332(bneg mw ew w <-> not (bneg mw ew x <-> bneg mw ew y))) /\333(bfin mw ew x /\ bfin mw ew y /\ binf mw ew z ->334binf mw ew w /\ (bneg mw ew w <-> bneg mw ew z)) /\335(bfin mw ew x /\ bfin mw ew y /\ bfin mw ew z ->336let r = bval mw ew x *. bval mw ew y +. bval mw ew z in337if small mw ew m r then338rounded mw ew m r w /\339(bneg mw ew w <-> (r <. 0.0 \/ (r = 0.0 /\340(if not (bneg mw ew x <-> bneg mw ew y) <-> bneg mw ew z341then not (bneg mw ew x <-> bneg mw ew y)342else m = rtn))))343else ovf mw ew m w /\ (bneg mw ew w <-> r <. 0.0))344
Bsqrt
axiom sqrt_spec: forall mw ew m x. valid mw ew -> in_range mw ew x ->347let z = b_sqrt mw ew m x in348in_range mw ew z /\349(bnan mw ew x -> bnan mw ew z) /\350(binf mw ew x ->351if bneg mw ew x then bnan mw ew z else binf mw ew z /\ not bneg mw ew z) /\352(bfin mw ew x /\ bneg mw ew x /\ not bzero mw ew x -> bnan mw ew z) /\353(bfin mw ew x /\ (not bneg mw ew x \/ bzero mw ew x) ->354rounded mw ew m (sqrt (bval mw ew x)) z /\ (bneg mw ew z <-> bneg mw ew x))355
Bnearbyint
axiom rti_spec: forall mw ew m x. valid mw ew -> in_range mw ew x ->358let z = b_rti mw ew m x in359in_range mw ew z /\360(bnan mw ew x -> bnan mw ew z) /\361(binf mw ew x -> binf mw ew z /\ (bneg mw ew z <-> bneg mw ew x)) /\362(bfin mw ew x -> bfin mw ew z /\363bval mw ew z = from_int (rnd_int m (bval mw ew x)) /\364(bneg mw ew z <-> bneg mw ew x))365
Bsucc
axiom succ_b_spec: forall mw ew x. valid mw ew -> in_range mw ew x ->368let z = b_succ mw ew x in369in_range mw ew z /\370(bnan mw ew x -> bnan mw ew z) /\371(binf mw ew x /\ not bneg mw ew x -> binf mw ew z /\ not bneg mw ew z) /\372(binf mw ew x /\ bneg mw ew x ->373bfin mw ew z /\ bneg mw ew z /\ bmag mw ew z = maxv mw ew) /\374(bfin mw ew x ->375let s = succ (prec mw) (emin mw ew) (bval mw ew x) in376if s <. pow2 (emax ew) then377bfin mw ew z /\ bval mw ew z = s /\378(bneg mw ew z <-> bneg mw ew x /\ not bzero mw ew x)379else binf mw ew z /\ not bneg mw ew z)380
Bpred
axiom pred_b_spec: forall mw ew x. valid mw ew -> in_range mw ew x ->383let z = b_pred mw ew x in384in_range mw ew z /\385(bnan mw ew x -> bnan mw ew z) /\386(binf mw ew x /\ bneg mw ew x -> binf mw ew z /\ bneg mw ew z) /\387(binf mw ew x /\ not bneg mw ew x ->388bfin mw ew z /\ not bneg mw ew z /\ bmag mw ew z = maxv mw ew) /\389(bfin mw ew x ->390let p = -. succ (prec mw) (emin mw ew) (-. bval mw ew x) in391if -. pow2 (emax ew) <. p then392bfin mw ew z /\ bval mw ew z = p /\393(bneg mw ew z <-> bneg mw ew x \/ bzero mw ew x)394else binf mw ew z /\ bneg mw ew z)395
Bltb, Bleb, Beqb
axiom lt_spec: forall mw ew x y. valid mw ew ->398in_range mw ew x -> in_range mw ew y ->399(b_lt mw ew x y <-> not bnan mw ew x /\ not bnan mw ew y /\400((bfin mw ew x /\ bfin mw ew y /\ bval mw ew x <. bval mw ew y) \/401(binf mw ew x /\ bneg mw ew x /\ not (binf mw ew y /\ bneg mw ew y)) \/402(binf mw ew y /\ not bneg mw ew y /\ not (binf mw ew x /\ not bneg mw ew x))))403404axiom le_spec: forall mw ew x y. valid mw ew ->405in_range mw ew x -> in_range mw ew y ->406(b_le mw ew x y <-> not bnan mw ew x /\ not bnan mw ew y /\407((bfin mw ew x /\ bfin mw ew y /\ bval mw ew x <=. bval mw ew y) \/408(binf mw ew x /\ bneg mw ew x) \/ (binf mw ew y /\ not bneg mw ew y)))409410axiom eq_spec: forall mw ew x y. valid mw ew ->411in_range mw ew x -> in_range mw ew y ->412(b_eq mw ew x y <-> not bnan mw ew x /\ not bnan mw ew y /\413((bfin mw ew x /\ bfin mw ew y /\ bval mw ew x = bval mw ew y) \/414(binf mw ew x /\ binf mw ew y /\ (bneg mw ew x <-> bneg mw ew y))))415end416