ReduceParallelProof.FiberRun: type of bendtorch-core@0.1.0.0 Import: import bendtorch-core@0.1.0.0/src/autograd/reduce_parallel_proof.bend as ReduceParallelProof Lines 275-280 of bendtorch-core@0.1.0.0/src/autograd/reduce_parallel_proof.bend: https://jend.leeeet.dev/read.txt?path=bendtorch-core@0.1.0.0/src/autograd/reduce_parallel_proof.bend&start_line=275&end_line=280 import Base import bendtorch-core@0.1.0.0/src/autograd/reduce.bend as Reduce # A run of `Reduce.fiber`: its total adds the words it saw, in order, and # the array comes back unchanged. type FiberRun<-d: Nat, -A: Array, -positions: List<&2, Nat>, -accumulator: F32, -result: F32 & Array> is Data: FiberRun{-words: List<&2, F32>, -seen: Obs(d, A, positions, words), -total: {Pair.fst(F32, Array, result) == fsum(words, accumulator) : F32}, -kept: {Pair.snd(F32, Array, result) == A : Array}} Uses (9): https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=F32 https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair.fst https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair.snd https://jend.leeeet.dev/definition.txt?path=bendtorch-core@0.1.0.0/src/autograd/reduce_parallel_proof.bend&name=Obs https://jend.leeeet.dev/definition.txt?path=bendtorch-core@0.1.0.0/src/autograd/reduce_parallel_proof.bend&name=fsum