exprEq

Structural equality of two expressions: same shape, same payload and same labels, recursively over the children. Deterministic trees built the same way compare equal; the comparison is exact (a NaN literal parameter never equals itself, so such trees never falsely share). The shared-subplan memo and the fusion guards use this as the identity of a subexpression.