Kernel-reduction variants of Int arithmetic, written with Int.rec, Bool.rec, and Nat
operations that the kernel evaluates on literals, together with proofs that they agree with the
standard operations. They avoid match and explicit recursion, which the kernel unfolds slowly.
Used in certificates that the kernel checks by evaluation, such as those of lia.
subNatNat for kernel reduction.
Equations
- Int.subNatNat_k m n = Bool.rec (Int.negSucc ((n.sub m).sub 1)) (Int.ofNat (m.sub n)) (n.ble m)
Instances For
negOfNat for kernel reduction.
Equations
- Int.negOfNat_k k = Bool.rec (Int.negSucc (k.sub 1)) (Int.ofNat 0) (k.beq 0)
Instances For
a / b for kernel reduction.
Equations
- One or more equations did not get rendered due to their size.