def TreeFacts
bendtorch-core@0.1.0.0 · src/tensor/parallel_proofs.bend:36
import bendtorch-core@0.1.0.0/src/tensor/parallel_proofs.bend as ParallelProofs
import Base
36
37def TreeFacts(~P: Data, ~A: Type, ~B: Type, ~cell: @+p: P -> @+position: Nat -> (A & B) -> Bool -> F32 & (A & B),
38 +p: P, -start: (A & B), +depth: Nat, +count: Nat, +base: Nat, -result: Array<F32> & (A & B)) -> Type:
39 {Pair.snd(Array<F32>, (A & B), result) == start : (A & B)} & Cells(~P, ~A, ~B, ~cell, p, start, depth, count, base, Pair.fst(Array<F32>, (A & B), result))