def signed_order

bend-collections-laws-math@1.0.0.0 · proofs/lib/lemmas/src/wide.bend:39

import Base

39def signed_order(a: Word(64n), b: Word(64n), sa: Bool, sb: Bool) -> Bool:
40  match sa sb:
41    case True{} False{}:
42      True{}
43    case False{} True{}:
44      False{}
45    case x y:
46      Cmp.is_le(Word.cmp(64n, a, b))