This is the numerical expression tree, not a network-algorithm label.
A leaf contributes once. A branch combines left then right at its named
owner; no associativity or commutativity is assumed. Placement may change
only through an explicit new tree/identity. Leaf values may carry numerators
and weight masses together; normalization is a separate learning operation.
Explicit ordered members retain the original exact leaf-order contract.
A compact group specifies a set: the numerical tree still fixes its own
operand order, and must cover every group member exactly once.
25family CombineCoverage : Type 0
26constructor CombineOrderedMembers
27field unrestricted combineOrderedMembers : (family StdList Nat)
28constructor CombineParticipantGroup
29field unrestricted combineParticipantGroup : (family ParticipantGroup)
30field unrestricted combineGroupNodeBudget : Nat
31field unrestricted combineGroupDepthBudget : NatThe compiler supplied declaration spans and resolved links from this source snapshot. This page does not assert that this file belongs to a checked closure.