BackwardLAWS.bounded: def of bendtorch-core@0.1.0.0
Import: import bendtorch-core@0.1.0.0/src/autograd/backward_LAWS.bend as BackwardLAWS
Lines 86-95 of bendtorch-core@0.1.0.0/src/autograd/backward_LAWS.bend: https://jend.leeeet.dev/read.txt?path=bendtorch-core@0.1.0.0/src/autograd/backward_LAWS.bend&start_line=86&end_line=95

import Base

# Operand bounds, stated without the engine's validator: a node may name only
# nodes older than itself, so each operand id must be below the number of
# older nodes. An operand that is the node itself, a newer node or a missing
# node fails this bound.
def bounded(ids: List<&2, Nat>, +bound: Nat) -> Bool:
  match ids:
    case Nil{}:
      True{}
    case Con{+id, rest}:
      Bool.and(Nat.is_lt(id, bound), bounded(rest, bound))

Uses (5):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool.and
  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=Nat.is_lt