Intersection types and merge operators provide a foundation for compositional programming, but their runtime semantics can become surprisingly complex. This talk presents Fᵢᵒᵇˢ and Fᵢᵗʳⁱᵉ, which revisit merge from an observational perspective: Fᵢᵒᵇˢ gives merged programs a simpler behavioral interpretation, and Fᵢᵗʳⁱᵉ turns that interpretation into a canonical runtime representation designed for straightforward execution and compilation.