Tree.reduce: def of bend-lawful-stdlib@0.1.0.0
Import: import bend-lawful-stdlib@0.1.0.0/src/tree.bend as Tree
Lines 21-27 of bend-lawful-stdlib@0.1.0.0/src/tree.bend: https://jend.leeeet.dev/read.txt?path=bend-lawful-stdlib@0.1.0.0/src/tree.bend&start_line=21&end_line=27

import Base
import bend-lawful-stdlib@0.1.0.0/src/class.bend as C

def reduce(~A: Data, ~m: C.Semigroup<A>, t: Tree<A>) -> A:
  match t:
    case Tip{x}:
      x
    case Fork{l, r}:
      a b = reduce(~A, ~m, l) reduce(~A, ~m, r)
      C.Semigroup.op(A, m, a, b)

Uses (3):
  https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/class.bend&name=Semigroup
  https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/class.bend&name=Semigroup.op
  https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/tree.bend&name=Tree