def nodes_length
bendtorch-core@0.1.0.0 · src/autograd/backward_PROOF.bend:374
import bendtorch-core@0.1.0.0/src/autograd/backward_PROOF.bend as BackwardPROOF
import Base
import bendtorch-core@0.1.0.0/src/autograd/backward.bend as Backward
374def nodes_length(+entries: List<&2, Backward.Entry>) ->
375 {List.length(&2, Backward.Entry, entries) == List.length(&2, Backward.Node, Backward.nodes(entries)) : Nat}:
376 match entries:
377 case Nil{}:
378 {==}
379 case Con{Backward.Entry{node, value, slot}, rest}:
380 Equal.cong(Nat, Nat, number => 1n+number, List.length(&2, Backward.Entry, rest),
381 List.length(&2, Backward.Node, Backward.nodes(rest)), nodes_length(rest))