def tree

bendtorch@1.3.0.0 · PROOF.bend:416

import Base
import bendtorch@1.3.0.0/main.bend as T
import bend-ml-tensor-array@0.1.18.0/main.bend as TA

416def tree(d: Nat, gs: T.Halves<T.FS>, +n: Nat, +h: Nat, +dm: T.Dm) -> MR<d, gs, n, h, dm>:
417  match d gs:
418    case 0n T.Halves{l, r}:
419      m0a(l, r, n, h, dm, l1(l, h, dm, Nil{}))
420    case 1n++e T.Halves{l, r}:
421      m1a(e, l, r, n, h, dm, cg(TA.half(TA.half(n)), l, Nil{}), cg(TA.half(Nat.sub(n, TA.half(n))), r, Nil{}), g1 => tree(e, g1, TA.half(n), h, dm), g2 => tree(e, g2, Nat.sub(n, TA.half(n)), h, dm))