law fan_out_arrival_order

bendtorch-core@0.1.0.0 · src/autograd/backward_LAWS.bend:306

import Base
import bendtorch-core@0.1.0.0/src/autograd/backward.bend as Backward

306# The contributions of x's three consumers arrive newest consumer first, and
307# each is added to the held total.
308law fan_out_arrival_order:
309  for +x: F32
310  for +a: F32
311  for +b: F32
312  for +c: F32
313  {grad_after(Backward.backward(program_fan_out(x, a, b, c), 8n), 0n) ==
314    Done{Some{F32.add(F32.add(F32.mul(1.0, c), F32.mul(1.0, b)), F32.mul(1.0, a))}} :
315    Result<&2, &2, Backward.Error, Maybe<&2, F32>>}