def go

stelliferous@0.0.2.0 · proofs/binary_division.bend:39

import stelliferous@0.0.2.0/proofs/binary_division.bend as BinaryDivision

import Base

39def go(n: Nat,w: Word(n),+b: Nat) -> Quotient:
40  match n:
41    case 0n:
42      Quotient{0n,0n}
43    case 1n+p:
44      WCon{bit,tail} = w
45      step(bit,b,go(p,tail,b))

Uses (5)

Used by (8)