def lsum

bend-collections-laws-crypto@1.0.0.0 · spec/math/natural.bend:79

import Base

79# List.sum and List.prod as right folds
80def lsum(xs: List<&2, Nat>) -> Nat:
81  match xs:
82    case Nil{}:
83      0n
84    case Con{x, t}:
85      Nat.add(x, lsum(t))